./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/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_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/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_942f30c7-cc7c-4912-a0af-e34edf446c31/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 f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 20:48:25,256 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:48:25,258 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:48:25,295 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:48:25,297 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:48:25,301 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:48:25,304 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:48:25,307 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:48:25,310 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:48:25,315 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:48:25,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:48:25,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:48:25,320 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:48:25,322 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:48:25,324 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:48:25,325 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:48:25,327 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:48:25,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:48:25,330 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:48:25,335 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:48:25,339 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:48:25,341 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:48:25,344 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:48:25,345 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:48:25,351 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:48:25,356 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:48:25,357 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:48:25,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:48:25,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:48:25,360 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:48:25,361 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:48:25,361 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:48:25,363 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:48:25,364 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:48:25,365 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:48:25,367 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:48:25,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:48:25,368 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:48:25,368 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:48:25,369 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:48:25,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:48:25,370 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-18 20:48:25,403 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:48:25,403 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:48:25,404 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:48:25,404 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:48:25,405 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:48:25,405 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:48:25,406 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:48:25,406 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:48:25,406 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:48:25,406 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:48:25,407 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:48:25,408 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:48:25,408 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:48:25,408 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:48:25,409 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:48:25,409 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:48:25,409 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:48:25,409 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:48:25,409 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-18 20:48:25,410 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:48:25,410 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:48:25,410 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:48:25,410 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:48:25,410 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:48:25,411 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:48:25,411 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:48:25,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:48:25,411 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:48:25,412 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:48:25,412 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:48:25,414 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:48:25,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:48:25,414 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:48:25,415 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:48:25,415 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:48:25,415 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_942f30c7-cc7c-4912-a0af-e34edf446c31/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_942f30c7-cc7c-4912-a0af-e34edf446c31/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 -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2022-11-18 20:48:25,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:48:25,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:48:25,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:48:25,731 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:48:25,731 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:48:25,733 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-18 20:48:25,801 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/data/d31bd16d4/bc355f7b6f0c4645b84f0c262afa88c9/FLAG99e236f4a [2022-11-18 20:48:26,471 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:48:26,471 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-18 20:48:26,489 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/data/d31bd16d4/bc355f7b6f0c4645b84f0c262afa88c9/FLAG99e236f4a [2022-11-18 20:48:26,731 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/data/d31bd16d4/bc355f7b6f0c4645b84f0c262afa88c9 [2022-11-18 20:48:26,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:48:26,736 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:48:26,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:48:26,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:48:26,743 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:48:26,744 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:48:26" (1/1) ... [2022-11-18 20:48:26,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c1723e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:26, skipping insertion in model container [2022-11-18 20:48:26,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:48:26" (1/1) ... [2022-11-18 20:48:26,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:48:26,844 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:48:27,406 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_942f30c7-cc7c-4912-a0af-e34edf446c31/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-18 20:48:27,409 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_942f30c7-cc7c-4912-a0af-e34edf446c31/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-18 20:48:27,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:48:27,426 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:48:27,475 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_942f30c7-cc7c-4912-a0af-e34edf446c31/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-18 20:48:27,478 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_942f30c7-cc7c-4912-a0af-e34edf446c31/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-18 20:48:27,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:48:27,541 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:48:27,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:27 WrapperNode [2022-11-18 20:48:27,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:48:27,542 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:48:27,542 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:48:27,543 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:48:27,551 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:48:27" (1/1) ... [2022-11-18 20:48:27,574 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:48:27" (1/1) ... [2022-11-18 20:48:27,621 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 214 [2022-11-18 20:48:27,622 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:48:27,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:48:27,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:48:27,623 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:48:27,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:27" (1/1) ... [2022-11-18 20:48:27,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:27" (1/1) ... [2022-11-18 20:48:27,638 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:27" (1/1) ... [2022-11-18 20:48:27,639 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:27" (1/1) ... [2022-11-18 20:48:27,649 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:27" (1/1) ... [2022-11-18 20:48:27,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:27" (1/1) ... [2022-11-18 20:48:27,665 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:27" (1/1) ... [2022-11-18 20:48:27,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:27" (1/1) ... [2022-11-18 20:48:27,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:48:27,671 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:48:27,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:48:27,672 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:48:27,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:27" (1/1) ... [2022-11-18 20:48:27,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:48:27,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:48:27,729 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:48:27,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:48:27,773 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-18 20:48:27,773 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-18 20:48:27,774 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-18 20:48:27,774 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-18 20:48:27,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:48:27,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:48:27,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:48:27,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:48:27,775 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-18 20:48:27,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:48:27,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:48:27,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:48:27,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:48:27,778 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:48:27,942 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:48:27,944 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:48:28,529 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:48:28,541 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:48:28,554 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-18 20:48:28,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:48:28 BoogieIcfgContainer [2022-11-18 20:48:28,558 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:48:28,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:48:28,577 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:48:28,581 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:48:28,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:48:26" (1/3) ... [2022-11-18 20:48:28,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75bdb278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:48:28, skipping insertion in model container [2022-11-18 20:48:28,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:27" (2/3) ... [2022-11-18 20:48:28,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75bdb278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:48:28, skipping insertion in model container [2022-11-18 20:48:28,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:48:28" (3/3) ... [2022-11-18 20:48:28,585 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-11-18 20:48:28,595 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 20:48:28,607 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:48:28,607 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-18 20:48:28,607 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 20:48:28,762 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-18 20:48:28,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 251 transitions, 518 flow [2022-11-18 20:48:28,935 INFO L130 PetriNetUnfolder]: 13/249 cut-off events. [2022-11-18 20:48:28,935 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-18 20:48:28,947 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:48:28,947 INFO L82 GeneralOperation]: Start removeDead. Operand has 245 places, 251 transitions, 518 flow [2022-11-18 20:48:28,955 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 239 transitions, 487 flow [2022-11-18 20:48:28,967 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:48:28,975 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;@9c4b0d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:48:28,981 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-11-18 20:48:29,028 INFO L130 PetriNetUnfolder]: 6/139 cut-off events. [2022-11-18 20:48:29,028 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-18 20:48:29,029 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:48:29,029 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:48:29,030 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:48:29,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:48:29,037 INFO L85 PathProgramCache]: Analyzing trace with hash 68024645, now seen corresponding path program 1 times [2022-11-18 20:48:29,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:48:29,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662655106] [2022-11-18 20:48:29,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:48:29,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:48:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:30,584 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:48:30,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:48:30,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662655106] [2022-11-18 20:48:30,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662655106] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:48:30,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:48:30,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-18 20:48:30,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022634009] [2022-11-18 20:48:30,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:48:30,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 20:48:30,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:48:30,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 20:48:30,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:48:30,685 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 251 [2022-11-18 20:48:30,701 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:48:30,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:48:30,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 251 [2022-11-18 20:48:30,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:48:32,002 INFO L130 PetriNetUnfolder]: 611/2940 cut-off events. [2022-11-18 20:48:32,003 INFO L131 PetriNetUnfolder]: For 88/91 co-relation queries the response was YES. [2022-11-18 20:48:32,017 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:48:32,035 INFO L137 encePairwiseOnDemand]: 234/251 looper letters, 42 selfloop transitions, 12 changer transitions 0/227 dead transitions. [2022-11-18 20:48:32,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 227 transitions, 571 flow [2022-11-18 20:48:32,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:48:32,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 20:48:32,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2477 transitions. [2022-11-18 20:48:32,068 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7591173766472571 [2022-11-18 20:48:32,069 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2477 transitions. [2022-11-18 20:48:32,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2477 transitions. [2022-11-18 20:48:32,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:48:32,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2477 transitions. [2022-11-18 20:48:32,089 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:48:32,110 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:48:32,113 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:48:32,115 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:48:32,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 227 transitions, 571 flow [2022-11-18 20:48:32,124 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:48:32,131 INFO L231 Difference]: Finished difference. Result has 235 places, 227 transitions, 482 flow [2022-11-18 20:48:32,134 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:48:32,141 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 2 predicate places. [2022-11-18 20:48:32,142 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 227 transitions, 482 flow [2022-11-18 20:48:32,144 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:48:32,144 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:48:32,145 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:48:32,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:48:32,146 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:48:32,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:48:32,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1738829715, now seen corresponding path program 1 times [2022-11-18 20:48:32,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:48:32,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043960887] [2022-11-18 20:48:32,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:48:32,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:48:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:46,585 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:48:46,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:48:46,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043960887] [2022-11-18 20:48:46,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043960887] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:48:46,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:48:46,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-18 20:48:46,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236945818] [2022-11-18 20:48:46,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:48:46,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-18 20:48:46,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:48:46,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-18 20:48:46,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-11-18 20:48:46,595 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 251 [2022-11-18 20:48:46,600 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:48:46,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:48:46,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 251 [2022-11-18 20:48:46,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:48:51,816 INFO L130 PetriNetUnfolder]: 1367/5618 cut-off events. [2022-11-18 20:48:51,817 INFO L131 PetriNetUnfolder]: For 30/33 co-relation queries the response was YES. [2022-11-18 20:48:51,830 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:48:51,853 INFO L137 encePairwiseOnDemand]: 229/251 looper letters, 108 selfloop transitions, 28 changer transitions 0/299 dead transitions. [2022-11-18 20:48:51,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 299 transitions, 904 flow [2022-11-18 20:48:51,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-18 20:48:51,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-18 20:48:51,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3857 transitions. [2022-11-18 20:48:51,864 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7317397078353254 [2022-11-18 20:48:51,864 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3857 transitions. [2022-11-18 20:48:51,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3857 transitions. [2022-11-18 20:48:51,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:48:51,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3857 transitions. [2022-11-18 20:48:51,877 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:48:51,886 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:48:51,889 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:48:51,890 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:48:51,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 299 transitions, 904 flow [2022-11-18 20:48:51,895 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:48:51,905 INFO L231 Difference]: Finished difference. Result has 253 places, 248 transitions, 618 flow [2022-11-18 20:48:51,906 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:48:51,906 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 20 predicate places. [2022-11-18 20:48:51,907 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 248 transitions, 618 flow [2022-11-18 20:48:51,911 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:48:51,911 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:48:51,912 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:48:51,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:48:51,913 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:48:51,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:48:51,917 INFO L85 PathProgramCache]: Analyzing trace with hash 689057386, now seen corresponding path program 1 times [2022-11-18 20:48:51,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:48:51,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205371573] [2022-11-18 20:48:51,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:48:51,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:48:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:54,437 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:48:54,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:48:54,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205371573] [2022-11-18 20:48:54,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205371573] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:48:54,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:48:54,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-18 20:48:54,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024430665] [2022-11-18 20:48:54,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:48:54,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-18 20:48:54,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:48:54,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-18 20:48:54,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2022-11-18 20:48:54,446 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 251 [2022-11-18 20:48:54,451 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:48:54,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:48:54,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 251 [2022-11-18 20:48:54,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:48:58,248 INFO L130 PetriNetUnfolder]: 2220/7783 cut-off events. [2022-11-18 20:48:58,249 INFO L131 PetriNetUnfolder]: For 888/895 co-relation queries the response was YES. [2022-11-18 20:48:58,280 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:48:58,322 INFO L137 encePairwiseOnDemand]: 229/251 looper letters, 208 selfloop transitions, 44 changer transitions 0/409 dead transitions. [2022-11-18 20:48:58,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 409 transitions, 1503 flow [2022-11-18 20:48:58,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-18 20:48:58,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-11-18 20:48:58,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3958 transitions. [2022-11-18 20:48:58,333 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7167692864904021 [2022-11-18 20:48:58,333 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3958 transitions. [2022-11-18 20:48:58,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3958 transitions. [2022-11-18 20:48:58,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:48:58,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3958 transitions. [2022-11-18 20:48:58,346 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:48:58,358 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:48:58,362 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:48:58,362 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:48:58,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 409 transitions, 1503 flow [2022-11-18 20:48:58,380 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:48:58,388 INFO L231 Difference]: Finished difference. Result has 273 places, 277 transitions, 861 flow [2022-11-18 20:48:58,388 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:48:58,391 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 40 predicate places. [2022-11-18 20:48:58,392 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 277 transitions, 861 flow [2022-11-18 20:48:58,393 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:48:58,394 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:48:58,394 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:48:58,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:48:58,395 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:48:58,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:48:58,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1840558730, now seen corresponding path program 1 times [2022-11-18 20:48:58,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:48:58,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377187187] [2022-11-18 20:48:58,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:48:58,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:48:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:58,502 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:48:58,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:48:58,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377187187] [2022-11-18 20:48:58,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377187187] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:48:58,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:48:58,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:48:58,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502453964] [2022-11-18 20:48:58,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:48:58,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:48:58,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:48:58,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:48:58,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:48:58,514 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 251 [2022-11-18 20:48:58,515 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:48:58,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:48:58,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 251 [2022-11-18 20:48:58,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:48:59,276 INFO L130 PetriNetUnfolder]: 220/3315 cut-off events. [2022-11-18 20:48:59,277 INFO L131 PetriNetUnfolder]: For 227/229 co-relation queries the response was YES. [2022-11-18 20:48:59,297 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:48:59,316 INFO L137 encePairwiseOnDemand]: 246/251 looper letters, 15 selfloop transitions, 4 changer transitions 0/284 dead transitions. [2022-11-18 20:48:59,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 284 transitions, 915 flow [2022-11-18 20:48:59,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:48:59,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-18 20:48:59,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 944 transitions. [2022-11-18 20:48:59,321 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9402390438247012 [2022-11-18 20:48:59,322 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 944 transitions. [2022-11-18 20:48:59,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 944 transitions. [2022-11-18 20:48:59,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:48:59,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 944 transitions. [2022-11-18 20:48:59,329 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:48:59,331 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:48:59,332 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:48:59,332 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:48:59,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 284 transitions, 915 flow [2022-11-18 20:48:59,341 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:48:59,345 INFO L231 Difference]: Finished difference. Result has 270 places, 280 transitions, 856 flow [2022-11-18 20:48:59,351 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:48:59,352 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 37 predicate places. [2022-11-18 20:48:59,353 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 280 transitions, 856 flow [2022-11-18 20:48:59,353 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:48:59,354 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:48:59,354 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:48:59,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:48:59,354 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:48:59,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:48:59,355 INFO L85 PathProgramCache]: Analyzing trace with hash -2061236017, now seen corresponding path program 1 times [2022-11-18 20:48:59,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:48:59,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050279267] [2022-11-18 20:48:59,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:48:59,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:48:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:59,449 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:48:59,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:48:59,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050279267] [2022-11-18 20:48:59,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050279267] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:48:59,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:48:59,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:48:59,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460957050] [2022-11-18 20:48:59,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:48:59,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:48:59,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:48:59,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:48:59,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:48:59,455 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 251 [2022-11-18 20:48:59,480 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:48:59,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:48:59,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 251 [2022-11-18 20:48:59,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:49:00,716 INFO L130 PetriNetUnfolder]: 372/4921 cut-off events. [2022-11-18 20:49:00,716 INFO L131 PetriNetUnfolder]: For 323/333 co-relation queries the response was YES. [2022-11-18 20:49:00,745 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:49:00,760 INFO L137 encePairwiseOnDemand]: 244/251 looper letters, 21 selfloop transitions, 4 changer transitions 0/290 dead transitions. [2022-11-18 20:49:00,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 290 transitions, 929 flow [2022-11-18 20:49:00,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:49:00,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 20:49:00,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1168 transitions. [2022-11-18 20:49:00,765 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9306772908366534 [2022-11-18 20:49:00,765 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1168 transitions. [2022-11-18 20:49:00,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1168 transitions. [2022-11-18 20:49:00,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:49:00,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1168 transitions. [2022-11-18 20:49:00,770 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:49:00,773 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:49:00,783 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:49:00,783 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:49:00,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 290 transitions, 929 flow [2022-11-18 20:49:00,790 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:49:00,795 INFO L231 Difference]: Finished difference. Result has 276 places, 283 transitions, 886 flow [2022-11-18 20:49:00,796 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:49:00,796 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 43 predicate places. [2022-11-18 20:49:00,797 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 283 transitions, 886 flow [2022-11-18 20:49:00,798 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:49:00,798 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:49:00,799 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:49:00,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:49:00,799 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:49:00,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:00,800 INFO L85 PathProgramCache]: Analyzing trace with hash 223433814, now seen corresponding path program 1 times [2022-11-18 20:49:00,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:49:00,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587672266] [2022-11-18 20:49:00,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:00,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:49:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:04,245 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:49:04,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:49:04,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587672266] [2022-11-18 20:49:04,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587672266] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:49:04,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:49:04,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-18 20:49:04,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503904892] [2022-11-18 20:49:04,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:49:04,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-18 20:49:04,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:49:04,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-18 20:49:04,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-11-18 20:49:04,252 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 251 [2022-11-18 20:49:04,256 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:49:04,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:49:04,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 251 [2022-11-18 20:49:04,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:49:12,133 INFO L130 PetriNetUnfolder]: 6682/26255 cut-off events. [2022-11-18 20:49:12,133 INFO L131 PetriNetUnfolder]: For 4451/4518 co-relation queries the response was YES. [2022-11-18 20:49:12,246 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:49:12,344 INFO L137 encePairwiseOnDemand]: 228/251 looper letters, 134 selfloop transitions, 34 changer transitions 0/350 dead transitions. [2022-11-18 20:49:12,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 350 transitions, 1395 flow [2022-11-18 20:49:12,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-18 20:49:12,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-18 20:49:12,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3861 transitions. [2022-11-18 20:49:12,353 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.732498577120091 [2022-11-18 20:49:12,354 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3861 transitions. [2022-11-18 20:49:12,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3861 transitions. [2022-11-18 20:49:12,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:49:12,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3861 transitions. [2022-11-18 20:49:12,365 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:49:12,373 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:49:12,376 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:49:12,376 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:49:12,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 350 transitions, 1395 flow [2022-11-18 20:49:12,450 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:49:12,454 INFO L231 Difference]: Finished difference. Result has 300 places, 293 transitions, 1031 flow [2022-11-18 20:49:12,455 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:49:12,458 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 67 predicate places. [2022-11-18 20:49:12,458 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 293 transitions, 1031 flow [2022-11-18 20:49:12,459 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:49:12,459 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:49:12,460 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:49:12,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:49:12,460 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:49:12,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:12,461 INFO L85 PathProgramCache]: Analyzing trace with hash 302890185, now seen corresponding path program 1 times [2022-11-18 20:49:12,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:49:12,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541805956] [2022-11-18 20:49:12,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:12,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:49:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:14,167 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:49:14,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:49:14,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541805956] [2022-11-18 20:49:14,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541805956] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:49:14,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:49:14,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-18 20:49:14,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803303206] [2022-11-18 20:49:14,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:49:14,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-18 20:49:14,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:49:14,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-18 20:49:14,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-11-18 20:49:14,183 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 251 [2022-11-18 20:49:14,188 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:49:14,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:49:14,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 251 [2022-11-18 20:49:14,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:49:20,244 INFO L130 PetriNetUnfolder]: 7235/26095 cut-off events. [2022-11-18 20:49:20,244 INFO L131 PetriNetUnfolder]: For 6060/6075 co-relation queries the response was YES. [2022-11-18 20:49:20,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46387 conditions, 26095 events. 7235/26095 cut-off events. For 6060/6075 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 321467 event pairs, 890 based on Foata normal form. 238/24298 useless extension candidates. Maximal degree in co-relation 46254. Up to 6630 conditions per place. [2022-11-18 20:49:20,630 INFO L137 encePairwiseOnDemand]: 230/251 looper letters, 193 selfloop transitions, 42 changer transitions 0/411 dead transitions. [2022-11-18 20:49:20,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 411 transitions, 1799 flow [2022-11-18 20:49:20,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 20:49:20,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-18 20:49:20,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3420 transitions. [2022-11-18 20:49:20,655 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7171314741035857 [2022-11-18 20:49:20,656 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3420 transitions. [2022-11-18 20:49:20,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3420 transitions. [2022-11-18 20:49:20,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:49:20,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3420 transitions. [2022-11-18 20:49:20,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 180.0) internal successors, (3420), 19 states have internal predecessors, (3420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:49:20,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 251.0) internal successors, (5020), 20 states have internal predecessors, (5020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:49:20,682 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 251.0) internal successors, (5020), 20 states have internal predecessors, (5020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:49:20,682 INFO L175 Difference]: Start difference. First operand has 300 places, 293 transitions, 1031 flow. Second operand 19 states and 3420 transitions. [2022-11-18 20:49:20,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 411 transitions, 1799 flow [2022-11-18 20:49:20,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 411 transitions, 1765 flow, removed 2 selfloop flow, removed 13 redundant places. [2022-11-18 20:49:20,861 INFO L231 Difference]: Finished difference. Result has 309 places, 301 transitions, 1165 flow [2022-11-18 20:49:20,862 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=997, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1165, PETRI_PLACES=309, PETRI_TRANSITIONS=301} [2022-11-18 20:49:20,864 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 76 predicate places. [2022-11-18 20:49:20,864 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 301 transitions, 1165 flow [2022-11-18 20:49:20,865 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:49:20,865 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:49:20,866 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:49:20,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:49:20,866 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 20:49:20,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:20,867 INFO L85 PathProgramCache]: Analyzing trace with hash -777952197, now seen corresponding path program 1 times [2022-11-18 20:49:20,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:49:20,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919367889] [2022-11-18 20:49:20,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:20,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:49:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:20,953 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:49:20,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:49:20,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919367889] [2022-11-18 20:49:20,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919367889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:49:20,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:49:20,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:49:20,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785424978] [2022-11-18 20:49:20,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:49:20,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:49:20,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:49:20,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:49:20,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:49:20,957 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 251 [2022-11-18 20:49:20,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 301 transitions, 1165 flow. Second operand has 4 states, 4 states have (on average 229.75) internal successors, (919), 4 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:49:20,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:49:20,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 251 [2022-11-18 20:49:20,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:49:22,447 INFO L130 PetriNetUnfolder]: 378/6613 cut-off events. [2022-11-18 20:49:22,447 INFO L131 PetriNetUnfolder]: For 848/892 co-relation queries the response was YES. [2022-11-18 20:49:22,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8769 conditions, 6613 events. 378/6613 cut-off events. For 848/892 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 72683 event pairs, 23 based on Foata normal form. 0/6028 useless extension candidates. Maximal degree in co-relation 8685. Up to 199 conditions per place. [2022-11-18 20:49:22,510 INFO L137 encePairwiseOnDemand]: 244/251 looper letters, 21 selfloop transitions, 4 changer transitions 0/311 dead transitions. [2022-11-18 20:49:22,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 311 transitions, 1241 flow [2022-11-18 20:49:22,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:49:22,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 20:49:22,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1168 transitions. [2022-11-18 20:49:22,515 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9306772908366534 [2022-11-18 20:49:22,516 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1168 transitions. [2022-11-18 20:49:22,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1168 transitions. [2022-11-18 20:49:22,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:49:22,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1168 transitions. [2022-11-18 20:49:22,520 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:49:22,524 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:49:22,525 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:49:22,525 INFO L175 Difference]: Start difference. First operand has 309 places, 301 transitions, 1165 flow. Second operand 5 states and 1168 transitions. [2022-11-18 20:49:22,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 311 transitions, 1241 flow [2022-11-18 20:49:22,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 311 transitions, 1208 flow, removed 2 selfloop flow, removed 11 redundant places. [2022-11-18 20:49:22,551 INFO L231 Difference]: Finished difference. Result has 305 places, 304 transitions, 1164 flow [2022-11-18 20:49:22,552 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1164, PETRI_PLACES=305, PETRI_TRANSITIONS=304} [2022-11-18 20:49:22,556 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 72 predicate places. [2022-11-18 20:49:22,556 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 304 transitions, 1164 flow [2022-11-18 20:49:22,557 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:49:22,557 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:49:22,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, 1, 1, 1, 1] [2022-11-18 20:49:22,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:49:22,558 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 20:49:22,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:22,559 INFO L85 PathProgramCache]: Analyzing trace with hash -180825677, now seen corresponding path program 1 times [2022-11-18 20:49:22,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:49:22,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888193082] [2022-11-18 20:49:22,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:22,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:49:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:22,693 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:49:22,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:49:22,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888193082] [2022-11-18 20:49:22,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888193082] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:49:22,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:49:22,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:49:22,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734846019] [2022-11-18 20:49:22,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:49:22,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:49:22,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:49:22,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:49:22,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:49:22,698 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 251 [2022-11-18 20:49:22,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 304 transitions, 1164 flow. Second operand has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:49:22,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:49:22,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 251 [2022-11-18 20:49:22,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:49:22,956 INFO L130 PetriNetUnfolder]: 48/959 cut-off events. [2022-11-18 20:49:22,957 INFO L131 PetriNetUnfolder]: For 227/228 co-relation queries the response was YES. [2022-11-18 20:49:22,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1431 conditions, 959 events. 48/959 cut-off events. For 227/228 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4364 event pairs, 2 based on Foata normal form. 0/898 useless extension candidates. Maximal degree in co-relation 1381. Up to 24 conditions per place. [2022-11-18 20:49:22,963 INFO L137 encePairwiseOnDemand]: 247/251 looper letters, 7 selfloop transitions, 2 changer transitions 5/285 dead transitions. [2022-11-18 20:49:22,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 285 transitions, 1045 flow [2022-11-18 20:49:22,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:49:22,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:49:22,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions. [2022-11-18 20:49:22,965 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.949535192563081 [2022-11-18 20:49:22,966 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 715 transitions. [2022-11-18 20:49:22,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 715 transitions. [2022-11-18 20:49:22,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:49:22,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 715 transitions. [2022-11-18 20:49:22,968 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:49:22,970 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:49:22,970 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:49:22,970 INFO L175 Difference]: Start difference. First operand has 305 places, 304 transitions, 1164 flow. Second operand 3 states and 715 transitions. [2022-11-18 20:49:22,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 285 transitions, 1045 flow [2022-11-18 20:49:22,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 285 transitions, 1033 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-11-18 20:49:22,980 INFO L231 Difference]: Finished difference. Result has 302 places, 279 transitions, 1002 flow [2022-11-18 20:49:22,981 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1000, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1002, PETRI_PLACES=302, PETRI_TRANSITIONS=279} [2022-11-18 20:49:22,984 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 69 predicate places. [2022-11-18 20:49:22,984 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 279 transitions, 1002 flow [2022-11-18 20:49:22,985 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:49:22,985 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:49:22,985 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:49:22,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:49:22,986 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 20:49:22,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:22,986 INFO L85 PathProgramCache]: Analyzing trace with hash -477690277, now seen corresponding path program 1 times [2022-11-18 20:49:22,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:49:22,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235711106] [2022-11-18 20:49:22,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:22,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:49:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:24,326 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:49:24,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:49:24,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235711106] [2022-11-18 20:49:24,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235711106] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:49:24,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:49:24,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-18 20:49:24,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799068751] [2022-11-18 20:49:24,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:49:24,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-18 20:49:24,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:49:24,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-18 20:49:24,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-11-18 20:49:24,333 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 251 [2022-11-18 20:49:24,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 279 transitions, 1002 flow. Second operand has 17 states, 17 states have (on average 183.64705882352942) internal successors, (3122), 17 states have internal predecessors, (3122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:49:24,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:49:24,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 251 [2022-11-18 20:49:24,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:49:25,376 INFO L130 PetriNetUnfolder]: 302/1933 cut-off events. [2022-11-18 20:49:25,376 INFO L131 PetriNetUnfolder]: For 669/673 co-relation queries the response was YES. [2022-11-18 20:49:25,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3414 conditions, 1933 events. 302/1933 cut-off events. For 669/673 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 12148 event pairs, 213 based on Foata normal form. 2/1818 useless extension candidates. Maximal degree in co-relation 3288. Up to 580 conditions per place. [2022-11-18 20:49:25,388 INFO L137 encePairwiseOnDemand]: 235/251 looper letters, 71 selfloop transitions, 29 changer transitions 0/287 dead transitions. [2022-11-18 20:49:25,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 287 transitions, 1216 flow [2022-11-18 20:49:25,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 20:49:25,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-18 20:49:25,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2799 transitions. [2022-11-18 20:49:25,396 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7434262948207171 [2022-11-18 20:49:25,396 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2799 transitions. [2022-11-18 20:49:25,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2799 transitions. [2022-11-18 20:49:25,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:49:25,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2799 transitions. [2022-11-18 20:49:25,403 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:49:25,409 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:49:25,411 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:49:25,411 INFO L175 Difference]: Start difference. First operand has 302 places, 279 transitions, 1002 flow. Second operand 15 states and 2799 transitions. [2022-11-18 20:49:25,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 287 transitions, 1216 flow [2022-11-18 20:49:25,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 287 transitions, 1212 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:49:25,423 INFO L231 Difference]: Finished difference. Result has 316 places, 282 transitions, 1086 flow [2022-11-18 20:49:25,424 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=987, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1086, PETRI_PLACES=316, PETRI_TRANSITIONS=282} [2022-11-18 20:49:25,425 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 83 predicate places. [2022-11-18 20:49:25,425 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 282 transitions, 1086 flow [2022-11-18 20:49:25,426 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:49:25,427 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:49:25,427 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:49:25,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 20:49:25,427 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:49:25,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:25,428 INFO L85 PathProgramCache]: Analyzing trace with hash -2001734328, now seen corresponding path program 1 times [2022-11-18 20:49:25,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:49:25,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358997532] [2022-11-18 20:49:25,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:25,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:49:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:27,135 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:49:27,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:49:27,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358997532] [2022-11-18 20:49:27,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358997532] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:49:27,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:49:27,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-18 20:49:27,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152196267] [2022-11-18 20:49:27,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:49:27,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-18 20:49:27,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:49:27,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-18 20:49:27,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-11-18 20:49:27,142 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 251 [2022-11-18 20:49:27,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 282 transitions, 1086 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:49:27,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:49:27,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 251 [2022-11-18 20:49:27,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:49:28,761 INFO L130 PetriNetUnfolder]: 295/1884 cut-off events. [2022-11-18 20:49:28,761 INFO L131 PetriNetUnfolder]: For 756/760 co-relation queries the response was YES. [2022-11-18 20:49:28,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3421 conditions, 1884 events. 295/1884 cut-off events. For 756/760 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 11862 event pairs, 99 based on Foata normal form. 3/1778 useless extension candidates. Maximal degree in co-relation 3279. Up to 472 conditions per place. [2022-11-18 20:49:28,776 INFO L137 encePairwiseOnDemand]: 235/251 looper letters, 93 selfloop transitions, 23 changer transitions 0/296 dead transitions. [2022-11-18 20:49:28,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 296 transitions, 1354 flow [2022-11-18 20:49:28,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 20:49:28,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-18 20:49:28,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2676 transitions. [2022-11-18 20:49:28,785 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7107569721115538 [2022-11-18 20:49:28,786 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2676 transitions. [2022-11-18 20:49:28,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2676 transitions. [2022-11-18 20:49:28,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:49:28,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2676 transitions. [2022-11-18 20:49:28,797 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:49:28,806 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:49:28,808 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:49:28,808 INFO L175 Difference]: Start difference. First operand has 316 places, 282 transitions, 1086 flow. Second operand 15 states and 2676 transitions. [2022-11-18 20:49:28,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 296 transitions, 1354 flow [2022-11-18 20:49:28,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 296 transitions, 1323 flow, removed 2 selfloop flow, removed 11 redundant places. [2022-11-18 20:49:28,828 INFO L231 Difference]: Finished difference. Result has 321 places, 283 transitions, 1123 flow [2022-11-18 20:49:28,828 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1045, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1123, PETRI_PLACES=321, PETRI_TRANSITIONS=283} [2022-11-18 20:49:28,830 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 88 predicate places. [2022-11-18 20:49:28,830 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 283 transitions, 1123 flow [2022-11-18 20:49:28,832 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:49:28,832 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:49:28,833 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:49:28,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 20:49:28,833 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:49:28,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:28,834 INFO L85 PathProgramCache]: Analyzing trace with hash 51128915, now seen corresponding path program 1 times [2022-11-18 20:49:28,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:49:28,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460594494] [2022-11-18 20:49:28,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:28,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:49:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:32,898 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:49:32,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:49:32,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460594494] [2022-11-18 20:49:32,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460594494] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:49:32,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504943917] [2022-11-18 20:49:32,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:32,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:49:32,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:49:32,907 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:49:32,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:49:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:33,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-18 20:49:33,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:49:33,416 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:49:33,417 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:49:33,708 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:49:33,802 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:49:34,363 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:49:35,020 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:49:35,045 INFO L321 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2022-11-18 20:49:35,046 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:49:35,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:49:35,465 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:49:35,467 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:49:36,113 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:49:36,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:49:36,332 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:49:36,788 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-18 20:49:36,789 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:49:36,860 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:49:36,870 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:49:36,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:49:37,799 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_319 Int) (v_ArrVal_320 (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|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_319)) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_322) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_319 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-18 20:49:38,231 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_319 Int) (v_ArrVal_320 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_319)) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_322) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_319))))) is different from false [2022-11-18 20:49:38,290 WARN L837 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1|) (forall ((v_ArrVal_322 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_319 Int) (v_ArrVal_320 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_319)) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_322) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_319)))))) is different from false [2022-11-18 20:49:39,520 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_319 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_316 Int) (v_ArrVal_314 Int)) (let ((.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_314)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse2 .cse4)) (.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_316) .cse4 v_ArrVal_319)) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (or (= 400 .cse0) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse1 (+ |c_~#queue~0.offset| 1604)))) (< (+ .cse0 1) v_ArrVal_319) (< (+ (select .cse2 .cse3) 1) v_ArrVal_316) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_322) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-18 20:49:39,618 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (or (forall ((v_ArrVal_322 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_319 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_316 Int) (v_ArrVal_314 Int)) (let ((.cse1 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_314)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_316) .cse4 v_ArrVal_319)) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|)) (.cse3 (select .cse1 .cse4))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_316) (< (+ .cse3 1) v_ArrVal_319) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_322) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (= 400 .cse3))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| (select .cse5 .cse4)))))) is different from false [2022-11-18 20:49:39,755 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_319 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_316 Int) (v_ArrVal_314 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse4 (store .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| 4)) v_ArrVal_314)) (.cse5 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse4 .cse5 v_ArrVal_316) .cse1 v_ArrVal_319)) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|)) (.cse2 (select .cse4 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| (select .cse0 .cse1))) (= 400 .cse2) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse3 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_322) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse4 .cse5) 1) v_ArrVal_316) (< (+ .cse2 1) v_ArrVal_319)))))) is different from false [2022-11-18 20:49:47,272 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_319 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_316 Int) (v_ArrVal_313 (Array Int Int)) (v_ArrVal_314 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_313))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| 4) |c_~#queue~0.offset|) v_ArrVal_314)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_316) .cse1 v_ArrVal_319)) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|)) (.cse3 (select .cse4 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| (select .cse2 .cse1))) (= 400 .cse3) (< (+ 1 (select .cse4 .cse5)) v_ArrVal_316) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_322) .cse5) 2147483647) (< (+ .cse3 1) v_ArrVal_319))))))) is different from false [2022-11-18 20:49:48,321 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_312 Int) (v_ArrVal_322 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_319 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_316 Int) (v_ArrVal_313 (Array Int Int)) (v_ArrVal_314 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|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_312)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_313))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse0 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| 4) |c_~#queue~0.offset|) v_ArrVal_314)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select .cse0 .cse5)) (.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_316) .cse5 v_ArrVal_319)) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_312 0)) (< (+ (select .cse0 .cse1) 1) v_ArrVal_316) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_322) .cse1) 2147483647) (< (+ .cse3 1) v_ArrVal_319) (= 400 .cse3) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| (select .cse4 .cse5))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse2 .cse5))))))))) is different from false [2022-11-18 20:49:48,367 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:49:48,368 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:49:48,392 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:49:48,393 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:49:48,413 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:49:48,437 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:49:48,531 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:49:48,904 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:49:48,905 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 220 treesize of output 232 [2022-11-18 20:49:52,770 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-18 20:49:52,771 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:49:52,854 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:49:52,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504943917] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:49:52,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:49:52,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 29] total 80 [2022-11-18 20:49:52,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756339055] [2022-11-18 20:49:52,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:49:52,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-11-18 20:49:52,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:49:52,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-11-18 20:49:52,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=609, Invalid=4642, Unknown=37, NotChecked=1192, Total=6480 [2022-11-18 20:49:52,879 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 251 [2022-11-18 20:49:52,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 283 transitions, 1123 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:49:52,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:49:52,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 251 [2022-11-18 20:49:52,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:50:44,339 INFO L130 PetriNetUnfolder]: 769/3958 cut-off events. [2022-11-18 20:50:44,339 INFO L131 PetriNetUnfolder]: For 1982/1986 co-relation queries the response was YES. [2022-11-18 20:50:44,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7686 conditions, 3958 events. 769/3958 cut-off events. For 1982/1986 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 29537 event pairs, 329 based on Foata normal form. 10/3750 useless extension candidates. Maximal degree in co-relation 7540. Up to 675 conditions per place. [2022-11-18 20:50:44,376 INFO L137 encePairwiseOnDemand]: 214/251 looper letters, 200 selfloop transitions, 124 changer transitions 0/475 dead transitions. [2022-11-18 20:50:44,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 475 transitions, 2761 flow [2022-11-18 20:50:44,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-18 20:50:44,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2022-11-18 20:50:44,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 9931 transitions. [2022-11-18 20:50:44,395 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.648618640193325 [2022-11-18 20:50:44,395 INFO L72 ComplementDD]: Start complementDD. Operand 61 states and 9931 transitions. [2022-11-18 20:50:44,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 9931 transitions. [2022-11-18 20:50:44,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:50:44,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 61 states and 9931 transitions. [2022-11-18 20:50:44,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 62 states, 61 states have (on average 162.80327868852459) internal successors, (9931), 61 states have internal predecessors, (9931), 0 states have call successors, (0), 0 states 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:50:44,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 62 states, 62 states have (on average 251.0) internal successors, (15562), 62 states have internal predecessors, (15562), 0 states have call successors, (0), 0 states 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:50:44,454 INFO L81 ComplementDD]: Finished complementDD. Result has 62 states, 62 states have (on average 251.0) internal successors, (15562), 62 states have internal predecessors, (15562), 0 states have call successors, (0), 0 states 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:50:44,454 INFO L175 Difference]: Start difference. First operand has 321 places, 283 transitions, 1123 flow. Second operand 61 states and 9931 transitions. [2022-11-18 20:50:44,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 475 transitions, 2761 flow [2022-11-18 20:50:44,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 475 transitions, 2706 flow, removed 12 selfloop flow, removed 13 redundant places. [2022-11-18 20:50:44,479 INFO L231 Difference]: Finished difference. Result has 392 places, 375 transitions, 2196 flow [2022-11-18 20:50:44,480 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=2196, PETRI_PLACES=392, PETRI_TRANSITIONS=375} [2022-11-18 20:50:44,481 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 159 predicate places. [2022-11-18 20:50:44,481 INFO L495 AbstractCegarLoop]: Abstraction has has 392 places, 375 transitions, 2196 flow [2022-11-18 20:50:44,485 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:50:44,486 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:50:44,486 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:50:44,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-18 20:50:44,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-18 20:50:44,691 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 20:50:44,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:44,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1584996986, now seen corresponding path program 1 times [2022-11-18 20:50:44,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:44,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180442176] [2022-11-18 20:50:44,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:44,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:46,487 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:50:46,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:46,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180442176] [2022-11-18 20:50:46,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180442176] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:50:46,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092096512] [2022-11-18 20:50:46,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:46,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:50:46,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:50:46,491 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:50:46,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:50:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:46,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-18 20:50:46,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:50:47,369 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:50:47,594 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:50:47,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:50:47,720 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:50:48,141 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-18 20:50:48,141 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:50:48,209 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:50:48,217 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:50:48,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:50:49,048 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_384 Int) (v_ArrVal_381 Int) (v_ArrVal_383 (Array Int Int))) (or (< (+ v_ArrVal_384 2147483648) 0) (< 0 (+ (select (store (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_381)) |c_~#stored_elements~0.base| v_ArrVal_383) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_384) (+ 1608 |c_~#queue~0.offset|)) 2147483650)))) is different from false [2022-11-18 20:50:49,179 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:50:49,180 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:50:49,192 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:50:49,193 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:50:49,202 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:50:49,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2022-11-18 20:50:49,243 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:50:49,244 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:50:49,752 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:50:49,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092096512] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:50:49,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:50:49,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 50 [2022-11-18 20:50:49,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677357153] [2022-11-18 20:50:49,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:50:49,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-18 20:50:49,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:49,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-18 20:50:49,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=2191, Unknown=3, NotChecked=96, Total=2550 [2022-11-18 20:50:49,762 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 251 [2022-11-18 20:50:49,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 375 transitions, 2196 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:50:49,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:50:49,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 251 [2022-11-18 20:50:49,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:50:54,968 INFO L130 PetriNetUnfolder]: 1214/7299 cut-off events. [2022-11-18 20:50:54,968 INFO L131 PetriNetUnfolder]: For 4528/4531 co-relation queries the response was YES. [2022-11-18 20:50:55,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13891 conditions, 7299 events. 1214/7299 cut-off events. For 4528/4531 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 68973 event pairs, 408 based on Foata normal form. 22/6949 useless extension candidates. Maximal degree in co-relation 13730. Up to 1089 conditions per place. [2022-11-18 20:50:55,054 INFO L137 encePairwiseOnDemand]: 225/251 looper letters, 189 selfloop transitions, 135 changer transitions 0/516 dead transitions. [2022-11-18 20:50:55,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 516 transitions, 3625 flow [2022-11-18 20:50:55,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-18 20:50:55,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-11-18 20:50:55,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 5176 transitions. [2022-11-18 20:50:55,062 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.736482640865111 [2022-11-18 20:50:55,063 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 5176 transitions. [2022-11-18 20:50:55,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 5176 transitions. [2022-11-18 20:50:55,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:50:55,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 5176 transitions. [2022-11-18 20:50:55,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 184.85714285714286) internal successors, (5176), 28 states have internal predecessors, (5176), 0 states have call successors, (0), 0 states 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:50:55,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 251.0) internal successors, (7279), 29 states have internal predecessors, (7279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:50:55,085 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 251.0) internal successors, (7279), 29 states have internal predecessors, (7279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:50:55,085 INFO L175 Difference]: Start difference. First operand has 392 places, 375 transitions, 2196 flow. Second operand 28 states and 5176 transitions. [2022-11-18 20:50:55,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 516 transitions, 3625 flow [2022-11-18 20:50:55,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 516 transitions, 3078 flow, removed 231 selfloop flow, removed 22 redundant places. [2022-11-18 20:50:55,142 INFO L231 Difference]: Finished difference. Result has 405 places, 428 transitions, 2578 flow [2022-11-18 20:50:55,143 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1720, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=2578, PETRI_PLACES=405, PETRI_TRANSITIONS=428} [2022-11-18 20:50:55,144 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 172 predicate places. [2022-11-18 20:50:55,144 INFO L495 AbstractCegarLoop]: Abstraction has has 405 places, 428 transitions, 2578 flow [2022-11-18 20:50:55,146 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:50:55,146 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:50:55,146 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:50:55,156 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-18 20:50:55,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-18 20:50:55,347 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 20:50:55,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:55,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1750094602, now seen corresponding path program 1 times [2022-11-18 20:50:55,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:55,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108979338] [2022-11-18 20:50:55,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:55,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:59,150 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:50:59,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:59,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108979338] [2022-11-18 20:50:59,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108979338] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:50:59,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113091048] [2022-11-18 20:50:59,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:59,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:50:59,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:50:59,152 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:50:59,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:50:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:59,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-18 20:50:59,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:50:59,560 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:50:59,561 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:50:59,670 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:50:59,670 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:51:00,050 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:51:00,174 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:51:01,091 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:51:01,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-18 20:51:02,151 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:51:02,174 INFO L321 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2022-11-18 20:51:02,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-18 20:51:02,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:02,711 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:51:02,712 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:51:03,319 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:51:03,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:03,558 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:51:04,095 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-18 20:51:04,096 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:51:04,178 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:51:04,189 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:51:04,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:51:08,177 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_459 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_460 Int) (v_ArrVal_457 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_460) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_457))))) is different from false [2022-11-18 20:51:11,313 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_456 Int) (v_ArrVal_459 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_460 Int) (v_ArrVal_457 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_456) .cse2 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem37#1| 1) v_ArrVal_456) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_457) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_460) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-18 20:51:11,355 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_456 Int) (v_ArrVal_459 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_460 Int) (v_ArrVal_457 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_456) .cse3 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_456) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_457) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_460) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-18 20:51:11,436 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_456 Int) (v_ArrVal_454 Int) (v_ArrVal_459 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_460 Int) (v_ArrVal_457 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_454)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_456) .cse3 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_456) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_460) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse3) 1) v_ArrVal_457))))) is different from false [2022-11-18 20:51:13,199 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (v_ArrVal_456 Int) (v_ArrVal_454 Int) (v_ArrVal_459 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_460 Int) (v_ArrVal_457 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) v_ArrVal_454)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse0 .cse2 v_ArrVal_456) .cse1 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_457) (< (+ (select .cse0 .cse2) 1) v_ArrVal_456) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| (select .cse3 .cse1))) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_460) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse4 (+ |c_~#queue~0.offset| 1604))))))))) is different from false [2022-11-18 20:51:19,393 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (v_ArrVal_456 Int) (v_ArrVal_454 Int) (v_ArrVal_459 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_460 Int) (v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_457 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_452))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) v_ArrVal_454)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_456) .cse1 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_457) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_460) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| (select .cse4 .cse1))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_456))))))) is different from false [2022-11-18 20:51:20,386 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (v_ArrVal_456 Int) (v_ArrVal_454 Int) (v_ArrVal_459 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_450 Int) (v_ArrVal_460 Int) (v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_457 Int)) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_450)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_452))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) v_ArrVal_454)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_456) .cse4 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_460) .cse1) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_456) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| (select .cse3 .cse4))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 .cse4))) (< (+ (select .cse2 .cse4) 1) v_ArrVal_457) (not (<= v_ArrVal_450 0)))))))) is different from false [2022-11-18 20:51:20,425 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:51:20,425 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:51:20,450 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:51:20,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 644 treesize of output 640 [2022-11-18 20:51:20,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 408 treesize of output 376 [2022-11-18 20:51:20,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 304 treesize of output 292 [2022-11-18 20:51:20,531 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:51:20,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 549 treesize of output 525 [2022-11-18 20:51:20,667 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:51:20,667 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:51:21,869 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:51:21,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 304 treesize of output 320 [2022-11-18 20:51:24,404 INFO L321 Elim1Store]: treesize reduction 5, result has 89.8 percent of original size [2022-11-18 20:51:24,404 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:51:24,553 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:51:24,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113091048] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:51:24,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:51:24,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28, 29] total 84 [2022-11-18 20:51:24,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712664592] [2022-11-18 20:51:24,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:51:24,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-11-18 20:51:24,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:24,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-11-18 20:51:24,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=626, Invalid=5353, Unknown=55, NotChecked=1106, Total=7140 [2022-11-18 20:51:24,563 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 251 [2022-11-18 20:51:24,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 428 transitions, 2578 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:51:24,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:51:24,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 251 [2022-11-18 20:51:24,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:52:28,975 INFO L130 PetriNetUnfolder]: 1856/10866 cut-off events. [2022-11-18 20:52:28,976 INFO L131 PetriNetUnfolder]: For 7573/7577 co-relation queries the response was YES. [2022-11-18 20:52:29,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22227 conditions, 10866 events. 1856/10866 cut-off events. For 7573/7577 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 114235 event pairs, 560 based on Foata normal form. 11/10320 useless extension candidates. Maximal degree in co-relation 22050. Up to 1112 conditions per place. [2022-11-18 20:52:29,167 INFO L137 encePairwiseOnDemand]: 213/251 looper letters, 334 selfloop transitions, 181 changer transitions 0/684 dead transitions. [2022-11-18 20:52:29,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 684 transitions, 5214 flow [2022-11-18 20:52:29,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-11-18 20:52:29,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2022-11-18 20:52:29,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 9522 transitions. [2022-11-18 20:52:29,181 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6655483329838541 [2022-11-18 20:52:29,182 INFO L72 ComplementDD]: Start complementDD. Operand 57 states and 9522 transitions. [2022-11-18 20:52:29,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 9522 transitions. [2022-11-18 20:52:29,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:52:29,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 57 states and 9522 transitions. [2022-11-18 20:52:29,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 58 states, 57 states have (on average 167.05263157894737) internal successors, (9522), 57 states have internal predecessors, (9522), 0 states have call successors, (0), 0 states 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:52:29,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 58 states, 58 states have (on average 251.0) internal successors, (14558), 58 states have internal predecessors, (14558), 0 states have call successors, (0), 0 states 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:52:29,226 INFO L81 ComplementDD]: Finished complementDD. Result has 58 states, 58 states have (on average 251.0) internal successors, (14558), 58 states have internal predecessors, (14558), 0 states have call successors, (0), 0 states 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:52:29,226 INFO L175 Difference]: Start difference. First operand has 405 places, 428 transitions, 2578 flow. Second operand 57 states and 9522 transitions. [2022-11-18 20:52:29,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 684 transitions, 5214 flow [2022-11-18 20:52:29,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 684 transitions, 4946 flow, removed 127 selfloop flow, removed 7 redundant places. [2022-11-18 20:52:29,339 INFO L231 Difference]: Finished difference. Result has 473 places, 495 transitions, 3609 flow [2022-11-18 20:52:29,341 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=2426, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=3609, PETRI_PLACES=473, PETRI_TRANSITIONS=495} [2022-11-18 20:52:29,342 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 240 predicate places. [2022-11-18 20:52:29,342 INFO L495 AbstractCegarLoop]: Abstraction has has 473 places, 495 transitions, 3609 flow [2022-11-18 20:52:29,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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:52:29,345 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:52:29,345 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:52:29,360 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:52:29,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-18 20:52:29,555 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:52:29,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:29,556 INFO L85 PathProgramCache]: Analyzing trace with hash 531209846, now seen corresponding path program 2 times [2022-11-18 20:52:29,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:29,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982853310] [2022-11-18 20:52:29,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:29,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:33,791 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:52:33,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:33,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982853310] [2022-11-18 20:52:33,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982853310] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:52:33,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486022882] [2022-11-18 20:52:33,792 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:52:33,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:52:33,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:52:33,793 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:52:33,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 20:52:33,957 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:52:33,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:52:33,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-18 20:52:33,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:52:34,216 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:52:34,218 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:52:34,295 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:52:34,295 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:52:34,604 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:52:34,709 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:52:35,457 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:52:36,261 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:52:36,283 INFO L321 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2022-11-18 20:52:36,283 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:52:36,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:52:36,747 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:52:36,748 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:52:37,383 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:52:37,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:52:37,646 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:52:38,075 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:52:38,324 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-18 20:52:38,324 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:52:38,388 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:52:38,436 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:52:38,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:52:38,981 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_536 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_536) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-18 20:52:42,206 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 Int) (v_ArrVal_535 (Array Int Int)) (v_ArrVal_534 (Array Int Int)) (v_ArrVal_531 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_536 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_531) .cse1 v_ArrVal_533)) |c_~#stored_elements~0.base| v_ArrVal_534) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_533) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_536) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (not (<= v_ArrVal_531 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))))))) is different from false [2022-11-18 20:52:42,310 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 Int) (v_ArrVal_535 (Array Int Int)) (v_ArrVal_534 (Array Int Int)) (v_ArrVal_531 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_536 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_531) .cse1 v_ArrVal_533)) |c_~#stored_elements~0.base| v_ArrVal_534) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_533) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_536) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem37#1| 1) v_ArrVal_531))))) is different from false [2022-11-18 20:52:50,150 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| (select .cse0 .cse1))) (forall ((v_ArrVal_533 Int) (v_ArrVal_535 (Array Int Int)) (v_ArrVal_534 (Array Int Int)) (v_ArrVal_531 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_528 Int) (v_ArrVal_536 Int)) (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_528)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_531) .cse1 v_ArrVal_533)) |c_~#stored_elements~0.base| v_ArrVal_534) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (+ (select .cse2 .cse3) 1) v_ArrVal_531) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| (select .cse4 (+ |c_~#queue~0.offset| 1604)))) (< (+ 1 (select .cse2 .cse1)) v_ArrVal_533) (< (select (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_536) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))))) is different from false [2022-11-18 20:52:50,245 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 Int) (v_ArrVal_535 (Array Int Int)) (v_ArrVal_534 (Array Int Int)) (v_ArrVal_531 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_528 Int) (v_ArrVal_536 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse1 (store .cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| 4)) v_ArrVal_528)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse1 .cse3 v_ArrVal_531) .cse2 v_ArrVal_533)) |c_~#stored_elements~0.base| v_ArrVal_534) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_536) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_533) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse3) 1) v_ArrVal_531) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| (select .cse4 .cse2)))))))) is different from false [2022-11-18 20:52:59,383 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 Int) (v_ArrVal_535 (Array Int Int)) (v_ArrVal_534 (Array Int Int)) (v_ArrVal_531 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| Int) (v_ArrVal_527 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_528 Int) (v_ArrVal_536 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_527))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| 4)) v_ArrVal_528)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select (store (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse2 v_ArrVal_531) .cse1 v_ArrVal_533)) |c_~#stored_elements~0.base| v_ArrVal_534) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_533) (< (+ (select .cse0 .cse2) 1) v_ArrVal_531) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_536) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| (select .cse4 .cse1))))))))) is different from false [2022-11-18 20:53:00,273 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 Int) (v_ArrVal_535 (Array Int Int)) (v_ArrVal_534 (Array Int Int)) (v_ArrVal_531 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| Int) (v_ArrVal_527 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_528 Int) (v_ArrVal_526 Int) (v_ArrVal_536 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_526)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_527))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| 4)) v_ArrVal_528)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_531) .cse3 v_ArrVal_533)) |c_~#stored_elements~0.base| v_ArrVal_534) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_536) .cse1) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_531) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| (select .cse0 .cse3))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_533) (not (<= v_ArrVal_526 0)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| (select .cse4 .cse3))))))))) is different from false [2022-11-18 20:53:00,303 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:53:00,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 255 treesize of output 170 [2022-11-18 20:53:00,326 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:53:00,326 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 659 treesize of output 655 [2022-11-18 20:53:00,353 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 289 treesize of output 277 [2022-11-18 20:53:00,373 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 561 treesize of output 513 [2022-11-18 20:53:00,391 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 543 treesize of output 519 [2022-11-18 20:53:00,465 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:53:00,465 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:53:01,375 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:53:01,375 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 192 treesize of output 208 [2022-11-18 20:53:04,285 INFO L321 Elim1Store]: treesize reduction 5, result has 93.8 percent of original size [2022-11-18 20:53:04,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 131 [2022-11-18 20:53:04,709 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-11-18 20:53:04,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486022882] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:53:04,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:53:04,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28, 29] total 83 [2022-11-18 20:53:04,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506090812] [2022-11-18 20:53:04,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:53:04,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-11-18 20:53:04,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:53:04,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-11-18 20:53:04,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=549, Invalid=5255, Unknown=76, NotChecked=1092, Total=6972 [2022-11-18 20:53:04,761 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 251 [2022-11-18 20:53:04,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 495 transitions, 3609 flow. Second operand has 84 states, 84 states have (on average 163.04761904761904) internal successors, (13696), 84 states have internal predecessors, (13696), 0 states have call successors, (0), 0 states 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:53:04,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:53:04,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 251 [2022-11-18 20:53:04,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:54:23,400 WARN L233 SmtUtils]: Spent 12.40s on a formula simplification. DAG size of input: 85 DAG size of output: 81 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:54:49,573 INFO L130 PetriNetUnfolder]: 2143/12580 cut-off events. [2022-11-18 20:54:49,574 INFO L131 PetriNetUnfolder]: For 16674/16682 co-relation queries the response was YES. [2022-11-18 20:54:49,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28949 conditions, 12580 events. 2143/12580 cut-off events. For 16674/16682 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 131721 event pairs, 605 based on Foata normal form. 10/11953 useless extension candidates. Maximal degree in co-relation 28746. Up to 1160 conditions per place. [2022-11-18 20:54:49,691 INFO L137 encePairwiseOnDemand]: 211/251 looper letters, 364 selfloop transitions, 197 changer transitions 0/730 dead transitions. [2022-11-18 20:54:49,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 527 places, 730 transitions, 6655 flow [2022-11-18 20:54:49,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-18 20:54:49,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2022-11-18 20:54:49,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 9194 transitions. [2022-11-18 20:54:49,703 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6659905831220573 [2022-11-18 20:54:49,703 INFO L72 ComplementDD]: Start complementDD. Operand 55 states and 9194 transitions. [2022-11-18 20:54:49,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 9194 transitions. [2022-11-18 20:54:49,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:54:49,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 9194 transitions. [2022-11-18 20:54:49,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 56 states, 55 states have (on average 167.16363636363636) internal successors, (9194), 55 states have internal predecessors, (9194), 0 states have call successors, (0), 0 states 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:54:49,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 56 states, 56 states have (on average 251.0) internal successors, (14056), 56 states have internal predecessors, (14056), 0 states have call successors, (0), 0 states 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:54:49,736 INFO L81 ComplementDD]: Finished complementDD. Result has 56 states, 56 states have (on average 251.0) internal successors, (14056), 56 states have internal predecessors, (14056), 0 states have call successors, (0), 0 states 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:54:49,736 INFO L175 Difference]: Start difference. First operand has 473 places, 495 transitions, 3609 flow. Second operand 55 states and 9194 transitions. [2022-11-18 20:54:49,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 527 places, 730 transitions, 6655 flow [2022-11-18 20:54:49,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 501 places, 730 transitions, 6310 flow, removed 119 selfloop flow, removed 26 redundant places. [2022-11-18 20:54:49,875 INFO L231 Difference]: Finished difference. Result has 517 places, 542 transitions, 4429 flow [2022-11-18 20:54:49,876 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=3304, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=4429, PETRI_PLACES=517, PETRI_TRANSITIONS=542} [2022-11-18 20:54:49,877 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 284 predicate places. [2022-11-18 20:54:49,877 INFO L495 AbstractCegarLoop]: Abstraction has has 517 places, 542 transitions, 4429 flow [2022-11-18 20:54:49,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 163.04761904761904) internal successors, (13696), 84 states have internal predecessors, (13696), 0 states have call successors, (0), 0 states 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:54:49,879 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:54:49,879 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, 1, 1, 1, 1, 1] [2022-11-18 20:54:49,890 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:54:50,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-18 20:54:50,085 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 20:54:50,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:54:50,085 INFO L85 PathProgramCache]: Analyzing trace with hash 2059834877, now seen corresponding path program 1 times [2022-11-18 20:54:50,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:54:50,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811771281] [2022-11-18 20:54:50,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:54:50,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:54:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:54:51,515 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:54:51,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:54:51,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811771281] [2022-11-18 20:54:51,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811771281] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:54:51,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203126943] [2022-11-18 20:54:51,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:54:51,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:54:51,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:54:51,519 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:54:51,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 20:54:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:54:51,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-18 20:54:51,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:54:51,912 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:54:51,912 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:54:51,932 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:54:51,933 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:54:52,672 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:54:52,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:52,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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:54:53,076 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:54:53,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:53,192 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:54:53,596 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-18 20:54:53,596 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:54:53,661 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:54:53,669 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:54:53,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:54:54,858 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:54:54,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 48 [2022-11-18 20:54:54,875 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:54:54,876 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 2658 treesize of output 2624 [2022-11-18 20:54:54,895 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 3470 treesize of output 3358 [2022-11-18 20:54:54,925 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 3934 treesize of output 3742 [2022-11-18 20:54:55,143 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:54:55,143 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 1398 treesize of output 1370 [2022-11-18 20:54:58,814 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:54:58,815 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 3105 treesize of output 3065 [2022-11-18 20:55:06,232 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-18 20:55:06,233 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:55:06,293 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:55:06,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203126943] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:55:06,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:55:06,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 56 [2022-11-18 20:55:06,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774112314] [2022-11-18 20:55:06,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:55:06,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-18 20:55:06,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:55:06,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-18 20:55:06,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=2886, Unknown=15, NotChecked=0, Total=3192 [2022-11-18 20:55:06,303 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 251 [2022-11-18 20:55:06,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 542 transitions, 4429 flow. Second operand has 57 states, 57 states have (on average 171.03508771929825) internal successors, (9749), 57 states have internal predecessors, (9749), 0 states have call successors, (0), 0 states 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:55:06,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:55:06,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 251 [2022-11-18 20:55:06,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:55:12,748 INFO L130 PetriNetUnfolder]: 2145/13343 cut-off events. [2022-11-18 20:55:12,748 INFO L131 PetriNetUnfolder]: For 23412/23478 co-relation queries the response was YES. [2022-11-18 20:55:12,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31776 conditions, 13343 events. 2145/13343 cut-off events. For 23412/23478 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 142489 event pairs, 680 based on Foata normal form. 23/12673 useless extension candidates. Maximal degree in co-relation 31560. Up to 2365 conditions per place. [2022-11-18 20:55:12,997 INFO L137 encePairwiseOnDemand]: 230/251 looper letters, 286 selfloop transitions, 123 changer transitions 0/604 dead transitions. [2022-11-18 20:55:12,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 533 places, 604 transitions, 5690 flow [2022-11-18 20:55:12,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-18 20:55:12,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-11-18 20:55:13,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4027 transitions. [2022-11-18 20:55:13,002 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.69755759570414 [2022-11-18 20:55:13,003 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4027 transitions. [2022-11-18 20:55:13,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4027 transitions. [2022-11-18 20:55:13,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:55:13,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4027 transitions. [2022-11-18 20:55:13,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 175.08695652173913) internal successors, (4027), 23 states have internal predecessors, (4027), 0 states have call successors, (0), 0 states 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:55:13,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 251.0) internal successors, (6024), 24 states have internal predecessors, (6024), 0 states have call successors, (0), 0 states 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:55:13,017 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 251.0) internal successors, (6024), 24 states have internal predecessors, (6024), 0 states have call successors, (0), 0 states 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:55:13,017 INFO L175 Difference]: Start difference. First operand has 517 places, 542 transitions, 4429 flow. Second operand 23 states and 4027 transitions. [2022-11-18 20:55:13,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 533 places, 604 transitions, 5690 flow [2022-11-18 20:55:13,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 506 places, 604 transitions, 5361 flow, removed 95 selfloop flow, removed 27 redundant places. [2022-11-18 20:55:13,707 INFO L231 Difference]: Finished difference. Result has 510 places, 547 transitions, 4426 flow [2022-11-18 20:55:13,708 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=4029, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=4426, PETRI_PLACES=510, PETRI_TRANSITIONS=547} [2022-11-18 20:55:13,709 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 277 predicate places. [2022-11-18 20:55:13,709 INFO L495 AbstractCegarLoop]: Abstraction has has 510 places, 547 transitions, 4426 flow [2022-11-18 20:55:13,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 171.03508771929825) internal successors, (9749), 57 states have internal predecessors, (9749), 0 states have call successors, (0), 0 states 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:55:13,711 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:55:13,711 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-18 20:55:13,727 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-18 20:55:13,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:55:13,917 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 20:55:13,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:13,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1347372732, now seen corresponding path program 1 times [2022-11-18 20:55:13,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:55:13,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241212674] [2022-11-18 20:55:13,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:13,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:55:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:16,815 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:55:16,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:55:16,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241212674] [2022-11-18 20:55:16,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241212674] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:55:16,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359615976] [2022-11-18 20:55:16,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:16,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:55:16,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:55:16,816 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:55:16,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 20:55:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:17,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-18 20:55:17,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:55:17,187 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:55:17,188 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:55:17,411 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:55:17,490 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:55:17,876 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 16 treesize of output 18 [2022-11-18 20:55:18,297 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:55:18,308 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-18 20:55:18,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-18 20:55:18,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:55:18,442 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:55:18,840 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 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-18 20:55:18,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:55:18,973 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 16 treesize of output 18 [2022-11-18 20:55:19,239 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-18 20:55:19,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 31 treesize of output 27 [2022-11-18 20:55:19,315 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:55:19,361 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 15 treesize of output 7 [2022-11-18 20:55:19,366 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:55:19,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:55:19,853 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_679 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_678) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_679)) .cse1)) 2147483647)) is different from false [2022-11-18 20:55:19,874 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_679 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_678) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_679)) .cse1)) 2147483647)) is different from false [2022-11-18 20:55:19,884 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_679 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_678) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_679)) .cse1)) 2147483647)) is different from false [2022-11-18 20:55:20,188 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_675 Int) (v_ArrVal_679 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_675) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_678) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_679)) .cse1)) 2147483647)) (= 400 .cse4)))) is different from false [2022-11-18 20:55:20,252 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_675 Int) (v_ArrVal_673 Int) (v_ArrVal_679 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_673)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_675) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_678) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_679)) .cse1)) 2147483647) (= .cse4 400))))) is different from false [2022-11-18 20:55:20,283 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| (select .cse0 .cse1))) (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_675 Int) (v_ArrVal_673 Int) (v_ArrVal_679 Int)) (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_673))) (let ((.cse5 (select .cse4 .cse1))) (or (< (let ((.cse3 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_675) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_678) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_679)) .cse3)) 2147483647) (= 400 .cse5)))))))) is different from false [2022-11-18 20:55:20,332 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_675 Int) (v_ArrVal_673 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| Int) (v_ArrVal_679 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| 4)) v_ArrVal_673)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_675) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_678) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_679)) .cse1)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| (select .cse5 .cse3))) (= 400 .cse4)))))) is different from false [2022-11-18 20:55:20,761 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_675 Int) (v_ArrVal_673 Int) (v_ArrVal_671 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| Int) (v_ArrVal_679 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_671))) (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| 4) |c_~#queue~0.offset|) v_ArrVal_673)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse4 .cse2))) (or (= 400 .cse0) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_675) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_678) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_679)) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| (select .cse5 .cse2))))))))) is different from false [2022-11-18 20:55:21,356 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:55:21,357 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 273 treesize of output 173 [2022-11-18 20:55:21,383 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:55:21,384 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 261 treesize of output 257 [2022-11-18 20:55:21,393 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 206 treesize of output 182 [2022-11-18 20:55:21,407 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 176 treesize of output 156 [2022-11-18 20:55:21,436 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 8 treesize of output 4 [2022-11-18 20:55:22,164 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:55:22,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 709 treesize of output 581 [2022-11-18 20:55:22,679 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-18 20:55:22,680 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:55:22,736 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-11-18 20:55:22,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359615976] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:55:22,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:55:22,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 27] total 71 [2022-11-18 20:55:22,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915711565] [2022-11-18 20:55:22,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:55:22,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-18 20:55:22,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:55:22,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-18 20:55:22,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=3524, Unknown=25, NotChecked=1048, Total=5112 [2022-11-18 20:55:22,746 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 251 [2022-11-18 20:55:22,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 510 places, 547 transitions, 4426 flow. Second operand has 72 states, 72 states have (on average 167.41666666666666) internal successors, (12054), 72 states have internal predecessors, (12054), 0 states have call successors, (0), 0 states 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:55:22,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:55:22,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 251 [2022-11-18 20:55:22,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:55:39,329 INFO L130 PetriNetUnfolder]: 3207/19607 cut-off events. [2022-11-18 20:55:39,329 INFO L131 PetriNetUnfolder]: For 38136/38257 co-relation queries the response was YES. [2022-11-18 20:55:39,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47640 conditions, 19607 events. 3207/19607 cut-off events. For 38136/38257 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 227761 event pairs, 1501 based on Foata normal form. 52/18675 useless extension candidates. Maximal degree in co-relation 47421. Up to 4159 conditions per place. [2022-11-18 20:55:39,615 INFO L137 encePairwiseOnDemand]: 219/251 looper letters, 372 selfloop transitions, 224 changer transitions 0/841 dead transitions. [2022-11-18 20:55:39,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 841 transitions, 8247 flow [2022-11-18 20:55:39,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-11-18 20:55:39,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2022-11-18 20:55:39,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 8388 transitions. [2022-11-18 20:55:39,630 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6820066672087162 [2022-11-18 20:55:39,630 INFO L72 ComplementDD]: Start complementDD. Operand 49 states and 8388 transitions. [2022-11-18 20:55:39,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 8388 transitions. [2022-11-18 20:55:39,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:55:39,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 49 states and 8388 transitions. [2022-11-18 20:55:39,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 50 states, 49 states have (on average 171.18367346938774) internal successors, (8388), 49 states have internal predecessors, (8388), 0 states have call successors, (0), 0 states 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:55:39,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 50 states, 50 states have (on average 251.0) internal successors, (12550), 50 states have internal predecessors, (12550), 0 states have call successors, (0), 0 states 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:55:39,669 INFO L81 ComplementDD]: Finished complementDD. Result has 50 states, 50 states have (on average 251.0) internal successors, (12550), 50 states have internal predecessors, (12550), 0 states have call successors, (0), 0 states 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:55:39,669 INFO L175 Difference]: Start difference. First operand has 510 places, 547 transitions, 4426 flow. Second operand 49 states and 8388 transitions. [2022-11-18 20:55:39,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 841 transitions, 8247 flow [2022-11-18 20:55:39,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 841 transitions, 8107 flow, removed 8 selfloop flow, removed 14 redundant places. [2022-11-18 20:55:39,905 INFO L231 Difference]: Finished difference. Result has 569 places, 680 transitions, 6653 flow [2022-11-18 20:55:39,906 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=4282, PETRI_DIFFERENCE_MINUEND_PLACES=496, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=6653, PETRI_PLACES=569, PETRI_TRANSITIONS=680} [2022-11-18 20:55:39,907 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 336 predicate places. [2022-11-18 20:55:39,907 INFO L495 AbstractCegarLoop]: Abstraction has has 569 places, 680 transitions, 6653 flow [2022-11-18 20:55:39,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 167.41666666666666) internal successors, (12054), 72 states have internal predecessors, (12054), 0 states have call successors, (0), 0 states 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:55:39,909 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:55:39,909 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-18 20:55:39,921 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 20:55:40,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942f30c7-cc7c-4912-a0af-e34edf446c31/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-18 20:55:40,122 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 20:55:40,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:40,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1181117629, now seen corresponding path program 1 times [2022-11-18 20:55:40,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:55:40,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125456320] [2022-11-18 20:55:40,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:40,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:55:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat