./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a 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_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longest.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 16:47:29,565 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:47:29,567 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:47:29,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:47:29,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:47:29,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:47:29,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:47:29,608 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:47:29,610 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:47:29,620 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:47:29,622 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:47:29,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:47:29,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:47:29,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:47:29,629 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:47:29,632 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:47:29,633 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:47:29,634 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:47:29,637 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:47:29,644 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:47:29,645 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:47:29,648 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:47:29,650 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:47:29,651 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:47:29,661 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:47:29,662 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:47:29,662 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:47:29,664 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:47:29,665 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:47:29,666 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:47:29,666 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:47:29,667 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:47:29,669 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:47:29,670 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:47:29,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:47:29,673 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:47:29,674 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:47:29,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:47:29,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:47:29,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:47:29,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:47:29,678 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-25 16:47:29,714 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:47:29,714 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:47:29,715 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:47:29,715 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:47:29,716 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:47:29,716 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:47:29,717 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:47:29,717 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:47:29,717 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:47:29,717 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:47:29,718 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:47:29,719 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 16:47:29,719 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:47:29,719 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:47:29,719 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:47:29,719 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 16:47:29,719 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:47:29,720 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 16:47:29,720 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 16:47:29,720 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:47:29,720 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 16:47:29,720 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:47:29,720 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 16:47:29,721 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:47:29,721 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:47:29,721 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:47:29,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:47:29,721 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:47:29,722 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:47:29,722 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 16:47:29,722 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:47:29,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 16:47:29,723 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:47:29,723 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 16:47:29,723 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:47:29,724 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:47:29,724 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/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_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d [2022-11-25 16:47:30,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:47:30,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:47:30,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:47:30,070 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:47:30,070 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:47:30,071 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread/queue_ok_longest.i [2022-11-25 16:47:33,030 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:47:33,316 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:47:33,323 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/sv-benchmarks/c/pthread/queue_ok_longest.i [2022-11-25 16:47:33,346 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/data/99e3bb36c/e38a57aa9ced4094b16624f15a04b458/FLAG285f49a73 [2022-11-25 16:47:33,615 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/data/99e3bb36c/e38a57aa9ced4094b16624f15a04b458 [2022-11-25 16:47:33,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:47:33,620 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:47:33,624 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:47:33,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:47:33,633 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:47:33,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:47:33" (1/1) ... [2022-11-25 16:47:33,635 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c556ab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:47:33, skipping insertion in model container [2022-11-25 16:47:33,635 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:47:33" (1/1) ... [2022-11-25 16:47:33,643 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:47:33,712 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:47:34,172 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-11-25 16:47:34,175 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-11-25 16:47:34,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:47:34,193 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:47:34,247 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-11-25 16:47:34,251 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-11-25 16:47:34,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:47:34,316 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:47:34,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:47:34 WrapperNode [2022-11-25 16:47:34,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:47:34,318 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:47:34,318 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:47:34,318 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:47:34,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:47:34" (1/1) ... [2022-11-25 16:47:34,344 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:47:34" (1/1) ... [2022-11-25 16:47:34,373 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 214 [2022-11-25 16:47:34,374 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:47:34,375 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:47:34,375 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:47:34,375 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:47:34,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:47:34" (1/1) ... [2022-11-25 16:47:34,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:47:34" (1/1) ... [2022-11-25 16:47:34,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:47:34" (1/1) ... [2022-11-25 16:47:34,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:47:34" (1/1) ... [2022-11-25 16:47:34,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:47:34" (1/1) ... [2022-11-25 16:47:34,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:47:34" (1/1) ... [2022-11-25 16:47:34,415 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:47:34" (1/1) ... [2022-11-25 16:47:34,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:47:34" (1/1) ... [2022-11-25 16:47:34,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:47:34,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:47:34,424 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:47:34,424 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:47:34,425 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:47:34" (1/1) ... [2022-11-25 16:47:34,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:47:34,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:47:34,467 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:47:34,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:47:34,506 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-25 16:47:34,506 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-25 16:47:34,506 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-25 16:47:34,507 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-25 16:47:34,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 16:47:34,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 16:47:34,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 16:47:34,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 16:47:34,508 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-25 16:47:34,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:47:34,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:47:34,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:47:34,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:47:34,511 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 16:47:34,675 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:47:34,676 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:47:35,118 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:47:35,128 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:47:35,129 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 16:47:35,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:47:35 BoogieIcfgContainer [2022-11-25 16:47:35,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:47:35,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:47:35,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:47:35,137 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:47:35,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:47:33" (1/3) ... [2022-11-25 16:47:35,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af6f3e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:47:35, skipping insertion in model container [2022-11-25 16:47:35,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:47:34" (2/3) ... [2022-11-25 16:47:35,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af6f3e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:47:35, skipping insertion in model container [2022-11-25 16:47:35,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:47:35" (3/3) ... [2022-11-25 16:47:35,140 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2022-11-25 16:47:35,157 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 16:47:35,168 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:47:35,168 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-25 16:47:35,169 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 16:47:35,347 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-25 16:47:35,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 251 transitions, 518 flow [2022-11-25 16:47:35,591 INFO L130 PetriNetUnfolder]: 13/249 cut-off events. [2022-11-25 16:47:35,592 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-25 16:47:35,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 249 events. 13/249 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 458 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2022-11-25 16:47:35,601 INFO L82 GeneralOperation]: Start removeDead. Operand has 245 places, 251 transitions, 518 flow [2022-11-25 16:47:35,608 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 239 transitions, 487 flow [2022-11-25 16:47:35,612 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 16:47:35,632 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 233 places, 239 transitions, 487 flow [2022-11-25 16:47:35,635 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 233 places, 239 transitions, 487 flow [2022-11-25 16:47:35,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 239 transitions, 487 flow [2022-11-25 16:47:35,695 INFO L130 PetriNetUnfolder]: 13/239 cut-off events. [2022-11-25 16:47:35,695 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-25 16:47:35,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 239 events. 13/239 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 373 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2022-11-25 16:47:35,705 INFO L119 LiptonReduction]: Number of co-enabled transitions 14376 [2022-11-25 16:47:47,884 INFO L134 LiptonReduction]: Checked pairs total: 31775 [2022-11-25 16:47:47,884 INFO L136 LiptonReduction]: Total number of compositions: 227 [2022-11-25 16:47:47,903 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:47:47,909 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;@5052f910, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:47:47,910 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-11-25 16:47:47,916 INFO L130 PetriNetUnfolder]: 1/19 cut-off events. [2022-11-25 16:47:47,916 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-25 16:47:47,917 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:47:47,917 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:47:47,918 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:47:47,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:47:47,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1252954978, now seen corresponding path program 1 times [2022-11-25 16:47:47,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:47:47,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055482941] [2022-11-25 16:47:47,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:47:47,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:47:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:48,910 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-25 16:47:48,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:47:48,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055482941] [2022-11-25 16:47:48,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055482941] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:47:48,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:47:48,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:47:48,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911177507] [2022-11-25 16:47:48,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:47:48,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:47:48,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:47:48,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:47:48,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:47:49,295 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 478 [2022-11-25 16:47:49,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 59 transitions, 127 flow. Second operand has 5 states, 5 states have (on average 226.4) internal successors, (1132), 5 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:49,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:47:49,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 478 [2022-11-25 16:47:49,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:47:49,854 INFO L130 PetriNetUnfolder]: 1630/2709 cut-off events. [2022-11-25 16:47:49,854 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-11-25 16:47:49,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5409 conditions, 2709 events. 1630/2709 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 13810 event pairs, 1187 based on Foata normal form. 0/1938 useless extension candidates. Maximal degree in co-relation 5193. Up to 2621 conditions per place. [2022-11-25 16:47:49,877 INFO L137 encePairwiseOnDemand]: 471/478 looper letters, 58 selfloop transitions, 7 changer transitions 0/71 dead transitions. [2022-11-25 16:47:49,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 71 transitions, 281 flow [2022-11-25 16:47:49,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:47:49,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:47:49,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1192 transitions. [2022-11-25 16:47:49,905 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49874476987447697 [2022-11-25 16:47:49,906 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1192 transitions. [2022-11-25 16:47:49,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1192 transitions. [2022-11-25 16:47:49,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:47:49,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1192 transitions. [2022-11-25 16:47:49,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 238.4) internal successors, (1192), 5 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:49,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:49,935 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:49,937 INFO L175 Difference]: Start difference. First operand has 59 places, 59 transitions, 127 flow. Second operand 5 states and 1192 transitions. [2022-11-25 16:47:49,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 71 transitions, 281 flow [2022-11-25 16:47:49,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 71 transitions, 276 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 16:47:49,947 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 169 flow [2022-11-25 16:47:49,949 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2022-11-25 16:47:49,954 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 4 predicate places. [2022-11-25 16:47:49,954 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 169 flow [2022-11-25 16:47:49,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 226.4) internal successors, (1132), 5 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:49,956 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:47:49,956 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:47:49,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 16:47:49,958 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:47:49,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:47:49,963 INFO L85 PathProgramCache]: Analyzing trace with hash 186648025, now seen corresponding path program 1 times [2022-11-25 16:47:49,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:47:49,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044625789] [2022-11-25 16:47:49,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:47:49,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:47:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:51,139 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-25 16:47:51,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:47:51,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044625789] [2022-11-25 16:47:51,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044625789] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:47:51,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:47:51,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:47:51,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852901747] [2022-11-25 16:47:51,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:47:51,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:47:51,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:47:51,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:47:51,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:47:51,893 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 478 [2022-11-25 16:47:51,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 169 flow. Second operand has 6 states, 6 states have (on average 223.33333333333334) internal successors, (1340), 6 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:51,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:47:51,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 478 [2022-11-25 16:47:51,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:47:52,985 INFO L130 PetriNetUnfolder]: 2142/3574 cut-off events. [2022-11-25 16:47:52,985 INFO L131 PetriNetUnfolder]: For 176/176 co-relation queries the response was YES. [2022-11-25 16:47:52,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7462 conditions, 3574 events. 2142/3574 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 19702 event pairs, 431 based on Foata normal form. 31/2775 useless extension candidates. Maximal degree in co-relation 6359. Up to 2644 conditions per place. [2022-11-25 16:47:53,006 INFO L137 encePairwiseOnDemand]: 470/478 looper letters, 112 selfloop transitions, 13 changer transitions 0/131 dead transitions. [2022-11-25 16:47:53,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 131 transitions, 566 flow [2022-11-25 16:47:53,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:47:53,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:47:53,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1234 transitions. [2022-11-25 16:47:53,010 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5163179916317991 [2022-11-25 16:47:53,010 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1234 transitions. [2022-11-25 16:47:53,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1234 transitions. [2022-11-25 16:47:53,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:47:53,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1234 transitions. [2022-11-25 16:47:53,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 246.8) internal successors, (1234), 5 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:53,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:53,020 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:53,020 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 169 flow. Second operand 5 states and 1234 transitions. [2022-11-25 16:47:53,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 131 transitions, 566 flow [2022-11-25 16:47:53,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 131 transitions, 566 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 16:47:53,034 INFO L231 Difference]: Finished difference. Result has 69 places, 72 transitions, 241 flow [2022-11-25 16:47:53,034 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=69, PETRI_TRANSITIONS=72} [2022-11-25 16:47:53,035 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 10 predicate places. [2022-11-25 16:47:53,035 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 72 transitions, 241 flow [2022-11-25 16:47:53,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 223.33333333333334) internal successors, (1340), 6 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:53,036 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:47:53,037 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:47:53,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 16:47:53,037 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:47:53,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:47:53,041 INFO L85 PathProgramCache]: Analyzing trace with hash 186900985, now seen corresponding path program 2 times [2022-11-25 16:47:53,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:47:53,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840709733] [2022-11-25 16:47:53,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:47:53,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:47:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:53,825 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-25 16:47:53,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:47:53,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840709733] [2022-11-25 16:47:53,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840709733] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:47:53,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:47:53,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:47:53,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567400063] [2022-11-25 16:47:53,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:47:53,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:47:53,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:47:53,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:47:53,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:47:54,240 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 478 [2022-11-25 16:47:54,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 72 transitions, 241 flow. Second operand has 6 states, 6 states have (on average 222.33333333333334) internal successors, (1334), 6 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:54,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:47:54,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 478 [2022-11-25 16:47:54,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:47:55,233 INFO L130 PetriNetUnfolder]: 2711/4511 cut-off events. [2022-11-25 16:47:55,234 INFO L131 PetriNetUnfolder]: For 979/979 co-relation queries the response was YES. [2022-11-25 16:47:55,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10039 conditions, 4511 events. 2711/4511 cut-off events. For 979/979 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 26200 event pairs, 1503 based on Foata normal form. 0/3454 useless extension candidates. Maximal degree in co-relation 5626. Up to 3432 conditions per place. [2022-11-25 16:47:55,304 INFO L137 encePairwiseOnDemand]: 469/478 looper letters, 124 selfloop transitions, 14 changer transitions 0/144 dead transitions. [2022-11-25 16:47:55,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 144 transitions, 684 flow [2022-11-25 16:47:55,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:47:55,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:47:55,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1679 transitions. [2022-11-25 16:47:55,309 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5017931858936043 [2022-11-25 16:47:55,309 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1679 transitions. [2022-11-25 16:47:55,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1679 transitions. [2022-11-25 16:47:55,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:47:55,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1679 transitions. [2022-11-25 16:47:55,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 239.85714285714286) internal successors, (1679), 7 states have internal predecessors, (1679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:55,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 478.0) internal successors, (3824), 8 states have internal predecessors, (3824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:55,323 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 478.0) internal successors, (3824), 8 states have internal predecessors, (3824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:55,323 INFO L175 Difference]: Start difference. First operand has 69 places, 72 transitions, 241 flow. Second operand 7 states and 1679 transitions. [2022-11-25 16:47:55,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 144 transitions, 684 flow [2022-11-25 16:47:55,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 144 transitions, 668 flow, removed 8 selfloop flow, removed 0 redundant places. [2022-11-25 16:47:55,331 INFO L231 Difference]: Finished difference. Result has 78 places, 79 transitions, 310 flow [2022-11-25 16:47:55,331 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=310, PETRI_PLACES=78, PETRI_TRANSITIONS=79} [2022-11-25 16:47:55,332 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 19 predicate places. [2022-11-25 16:47:55,332 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 79 transitions, 310 flow [2022-11-25 16:47:55,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 222.33333333333334) internal successors, (1334), 6 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:55,333 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:47:55,333 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:47:55,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 16:47:55,334 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:47:55,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:47:55,335 INFO L85 PathProgramCache]: Analyzing trace with hash 186900986, now seen corresponding path program 1 times [2022-11-25 16:47:55,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:47:55,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759948663] [2022-11-25 16:47:55,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:47:55,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:47:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:56,416 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-25 16:47:56,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:47:56,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759948663] [2022-11-25 16:47:56,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759948663] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:47:56,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:47:56,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:47:56,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246032417] [2022-11-25 16:47:56,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:47:56,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:47:56,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:47:56,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:47:56,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:47:57,030 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 478 [2022-11-25 16:47:57,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 79 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:57,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:47:57,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 478 [2022-11-25 16:47:57,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:47:58,031 INFO L130 PetriNetUnfolder]: 2662/4416 cut-off events. [2022-11-25 16:47:58,032 INFO L131 PetriNetUnfolder]: For 966/966 co-relation queries the response was YES. [2022-11-25 16:47:58,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10095 conditions, 4416 events. 2662/4416 cut-off events. For 966/966 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 25548 event pairs, 439 based on Foata normal form. 31/3448 useless extension candidates. Maximal degree in co-relation 7571. Up to 3326 conditions per place. [2022-11-25 16:47:58,056 INFO L137 encePairwiseOnDemand]: 472/478 looper letters, 118 selfloop transitions, 14 changer transitions 0/138 dead transitions. [2022-11-25 16:47:58,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 138 transitions, 699 flow [2022-11-25 16:47:58,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:47:58,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:47:58,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1237 transitions. [2022-11-25 16:47:58,060 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5175732217573221 [2022-11-25 16:47:58,065 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1237 transitions. [2022-11-25 16:47:58,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1237 transitions. [2022-11-25 16:47:58,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:47:58,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1237 transitions. [2022-11-25 16:47:58,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 247.4) internal successors, (1237), 5 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:58,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:58,075 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:58,075 INFO L175 Difference]: Start difference. First operand has 78 places, 79 transitions, 310 flow. Second operand 5 states and 1237 transitions. [2022-11-25 16:47:58,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 138 transitions, 699 flow [2022-11-25 16:47:58,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 138 transitions, 689 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-25 16:47:58,089 INFO L231 Difference]: Finished difference. Result has 81 places, 79 transitions, 338 flow [2022-11-25 16:47:58,089 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=338, PETRI_PLACES=81, PETRI_TRANSITIONS=79} [2022-11-25 16:47:58,090 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 22 predicate places. [2022-11-25 16:47:58,090 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 79 transitions, 338 flow [2022-11-25 16:47:58,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:58,091 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:47:58,092 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:47:58,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 16:47:58,092 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:47:58,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:47:58,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1122777527, now seen corresponding path program 1 times [2022-11-25 16:47:58,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:47:58,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082135614] [2022-11-25 16:47:58,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:47:58,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:47:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:58,139 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-25 16:47:58,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:47:58,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082135614] [2022-11-25 16:47:58,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082135614] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:47:58,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:47:58,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:47:58,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442929680] [2022-11-25 16:47:58,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:47:58,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:47:58,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:47:58,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:47:58,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:47:58,160 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 478 [2022-11-25 16:47:58,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 79 transitions, 338 flow. Second operand has 4 states, 4 states have (on average 234.25) internal successors, (937), 4 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:58,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:47:58,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 478 [2022-11-25 16:47:58,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:47:59,175 INFO L130 PetriNetUnfolder]: 4518/7347 cut-off events. [2022-11-25 16:47:59,175 INFO L131 PetriNetUnfolder]: For 3791/3791 co-relation queries the response was YES. [2022-11-25 16:47:59,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17329 conditions, 7347 events. 4518/7347 cut-off events. For 3791/3791 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 44625 event pairs, 2211 based on Foata normal form. 0/5653 useless extension candidates. Maximal degree in co-relation 14554. Up to 4490 conditions per place. [2022-11-25 16:47:59,235 INFO L137 encePairwiseOnDemand]: 471/478 looper letters, 158 selfloop transitions, 4 changer transitions 0/167 dead transitions. [2022-11-25 16:47:59,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 167 transitions, 1016 flow [2022-11-25 16:47:59,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:47:59,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 16:47:59,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1053 transitions. [2022-11-25 16:47:59,240 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5507322175732218 [2022-11-25 16:47:59,240 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1053 transitions. [2022-11-25 16:47:59,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1053 transitions. [2022-11-25 16:47:59,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:47:59,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1053 transitions. [2022-11-25 16:47:59,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 263.25) internal successors, (1053), 4 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:59,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 478.0) internal successors, (2390), 5 states have internal predecessors, (2390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:59,248 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 478.0) internal successors, (2390), 5 states have internal predecessors, (2390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:59,249 INFO L175 Difference]: Start difference. First operand has 81 places, 79 transitions, 338 flow. Second operand 4 states and 1053 transitions. [2022-11-25 16:47:59,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 167 transitions, 1016 flow [2022-11-25 16:47:59,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 167 transitions, 942 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-11-25 16:47:59,262 INFO L231 Difference]: Finished difference. Result has 81 places, 82 transitions, 334 flow [2022-11-25 16:47:59,263 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=334, PETRI_PLACES=81, PETRI_TRANSITIONS=82} [2022-11-25 16:47:59,265 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 22 predicate places. [2022-11-25 16:47:59,266 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 82 transitions, 334 flow [2022-11-25 16:47:59,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 234.25) internal successors, (937), 4 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:47:59,266 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:47:59,267 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:47:59,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 16:47:59,267 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:47:59,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:47:59,268 INFO L85 PathProgramCache]: Analyzing trace with hash -782335366, now seen corresponding path program 1 times [2022-11-25 16:47:59,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:47:59,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049691745] [2022-11-25 16:47:59,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:47:59,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:47:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:48:00,661 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-25 16:48:00,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:48:00,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049691745] [2022-11-25 16:48:00,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049691745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:48:00,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:48:00,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:48:00,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472036890] [2022-11-25 16:48:00,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:48:00,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:48:00,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:48:00,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:48:00,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:48:01,315 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 478 [2022-11-25 16:48:01,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 82 transitions, 334 flow. Second operand has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:01,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:48:01,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 478 [2022-11-25 16:48:01,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:48:02,814 INFO L130 PetriNetUnfolder]: 4364/7242 cut-off events. [2022-11-25 16:48:02,815 INFO L131 PetriNetUnfolder]: For 2861/2863 co-relation queries the response was YES. [2022-11-25 16:48:02,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17500 conditions, 7242 events. 4364/7242 cut-off events. For 2861/2863 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 44725 event pairs, 3026 based on Foata normal form. 0/5907 useless extension candidates. Maximal degree in co-relation 12807. Up to 6979 conditions per place. [2022-11-25 16:48:02,864 INFO L137 encePairwiseOnDemand]: 470/478 looper letters, 78 selfloop transitions, 8 changer transitions 0/92 dead transitions. [2022-11-25 16:48:02,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 92 transitions, 529 flow [2022-11-25 16:48:02,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:48:02,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:48:02,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1196 transitions. [2022-11-25 16:48:02,870 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.500418410041841 [2022-11-25 16:48:02,870 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1196 transitions. [2022-11-25 16:48:02,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1196 transitions. [2022-11-25 16:48:02,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:48:02,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1196 transitions. [2022-11-25 16:48:02,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 239.2) internal successors, (1196), 5 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:02,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:02,881 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:02,881 INFO L175 Difference]: Start difference. First operand has 81 places, 82 transitions, 334 flow. Second operand 5 states and 1196 transitions. [2022-11-25 16:48:02,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 92 transitions, 529 flow [2022-11-25 16:48:02,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 92 transitions, 527 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 16:48:02,897 INFO L231 Difference]: Finished difference. Result has 85 places, 84 transitions, 369 flow [2022-11-25 16:48:02,897 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=369, PETRI_PLACES=85, PETRI_TRANSITIONS=84} [2022-11-25 16:48:02,898 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 26 predicate places. [2022-11-25 16:48:02,898 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 84 transitions, 369 flow [2022-11-25 16:48:02,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:02,899 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:48:02,899 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:48:02,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 16:48:02,900 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:48:02,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:48:02,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1554621182, now seen corresponding path program 1 times [2022-11-25 16:48:02,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:48:02,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736324229] [2022-11-25 16:48:02,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:48:02,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:48:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:48:03,927 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-25 16:48:03,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:48:03,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736324229] [2022-11-25 16:48:03,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736324229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:48:03,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:48:03,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:48:03,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641648839] [2022-11-25 16:48:03,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:48:03,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:48:03,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:48:03,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:48:03,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:48:04,936 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 478 [2022-11-25 16:48:04,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 84 transitions, 369 flow. Second operand has 6 states, 6 states have (on average 223.83333333333334) internal successors, (1343), 6 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:04,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:48:04,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 478 [2022-11-25 16:48:04,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:48:06,280 INFO L130 PetriNetUnfolder]: 4589/7597 cut-off events. [2022-11-25 16:48:06,280 INFO L131 PetriNetUnfolder]: For 2583/2617 co-relation queries the response was YES. [2022-11-25 16:48:06,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18782 conditions, 7597 events. 4589/7597 cut-off events. For 2583/2617 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 47824 event pairs, 1045 based on Foata normal form. 98/6580 useless extension candidates. Maximal degree in co-relation 12963. Up to 5766 conditions per place. [2022-11-25 16:48:06,333 INFO L137 encePairwiseOnDemand]: 469/478 looper letters, 131 selfloop transitions, 16 changer transitions 0/153 dead transitions. [2022-11-25 16:48:06,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 153 transitions, 862 flow [2022-11-25 16:48:06,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:48:06,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:48:06,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1238 transitions. [2022-11-25 16:48:06,338 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5179916317991632 [2022-11-25 16:48:06,338 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1238 transitions. [2022-11-25 16:48:06,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1238 transitions. [2022-11-25 16:48:06,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:48:06,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1238 transitions. [2022-11-25 16:48:06,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 247.6) internal successors, (1238), 5 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:06,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:06,347 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:06,348 INFO L175 Difference]: Start difference. First operand has 85 places, 84 transitions, 369 flow. Second operand 5 states and 1238 transitions. [2022-11-25 16:48:06,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 153 transitions, 862 flow [2022-11-25 16:48:06,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 153 transitions, 850 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 16:48:06,388 INFO L231 Difference]: Finished difference. Result has 87 places, 86 transitions, 417 flow [2022-11-25 16:48:06,388 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=417, PETRI_PLACES=87, PETRI_TRANSITIONS=86} [2022-11-25 16:48:06,389 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 28 predicate places. [2022-11-25 16:48:06,389 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 86 transitions, 417 flow [2022-11-25 16:48:06,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 223.83333333333334) internal successors, (1343), 6 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:06,390 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:48:06,390 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:48:06,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 16:48:06,391 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:48:06,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:48:06,391 INFO L85 PathProgramCache]: Analyzing trace with hash 161938586, now seen corresponding path program 2 times [2022-11-25 16:48:06,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:48:06,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880747198] [2022-11-25 16:48:06,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:48:06,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:48:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:48:07,069 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-25 16:48:07,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:48:07,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880747198] [2022-11-25 16:48:07,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880747198] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:48:07,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:48:07,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:48:07,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456178969] [2022-11-25 16:48:07,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:48:07,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:48:07,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:48:07,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:48:07,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:48:07,764 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 478 [2022-11-25 16:48:07,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 86 transitions, 417 flow. Second operand has 6 states, 6 states have (on average 224.83333333333334) internal successors, (1349), 6 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:07,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:48:07,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 478 [2022-11-25 16:48:07,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:48:09,032 INFO L130 PetriNetUnfolder]: 5003/8229 cut-off events. [2022-11-25 16:48:09,032 INFO L131 PetriNetUnfolder]: For 4635/4657 co-relation queries the response was YES. [2022-11-25 16:48:09,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21419 conditions, 8229 events. 5003/8229 cut-off events. For 4635/4657 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 51967 event pairs, 2032 based on Foata normal form. 98/7151 useless extension candidates. Maximal degree in co-relation 11493. Up to 5786 conditions per place. [2022-11-25 16:48:09,151 INFO L137 encePairwiseOnDemand]: 469/478 looper letters, 133 selfloop transitions, 18 changer transitions 0/157 dead transitions. [2022-11-25 16:48:09,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 157 transitions, 936 flow [2022-11-25 16:48:09,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:48:09,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:48:09,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1242 transitions. [2022-11-25 16:48:09,157 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5196652719665272 [2022-11-25 16:48:09,157 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1242 transitions. [2022-11-25 16:48:09,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1242 transitions. [2022-11-25 16:48:09,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:48:09,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1242 transitions. [2022-11-25 16:48:09,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 248.4) internal successors, (1242), 5 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:09,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:09,170 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:09,170 INFO L175 Difference]: Start difference. First operand has 87 places, 86 transitions, 417 flow. Second operand 5 states and 1242 transitions. [2022-11-25 16:48:09,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 157 transitions, 936 flow [2022-11-25 16:48:09,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 157 transitions, 912 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 16:48:09,216 INFO L231 Difference]: Finished difference. Result has 89 places, 89 transitions, 472 flow [2022-11-25 16:48:09,217 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=472, PETRI_PLACES=89, PETRI_TRANSITIONS=89} [2022-11-25 16:48:09,218 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 30 predicate places. [2022-11-25 16:48:09,218 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 89 transitions, 472 flow [2022-11-25 16:48:09,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.83333333333334) internal successors, (1349), 6 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:09,219 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:48:09,219 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:48:09,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 16:48:09,220 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:48:09,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:48:09,220 INFO L85 PathProgramCache]: Analyzing trace with hash 952572074, now seen corresponding path program 1 times [2022-11-25 16:48:09,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:48:09,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771711443] [2022-11-25 16:48:09,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:48:09,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:48:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:48:09,332 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-25 16:48:09,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:48:09,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771711443] [2022-11-25 16:48:09,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771711443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:48:09,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:48:09,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:48:09,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632004123] [2022-11-25 16:48:09,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:48:09,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:48:09,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:48:09,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:48:09,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:48:09,348 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 478 [2022-11-25 16:48:09,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 89 transitions, 472 flow. Second operand has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:09,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:48:09,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 478 [2022-11-25 16:48:09,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:48:09,732 INFO L130 PetriNetUnfolder]: 991/1877 cut-off events. [2022-11-25 16:48:09,732 INFO L131 PetriNetUnfolder]: For 970/970 co-relation queries the response was YES. [2022-11-25 16:48:09,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4794 conditions, 1877 events. 991/1877 cut-off events. For 970/970 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 10487 event pairs, 695 based on Foata normal form. 92/1717 useless extension candidates. Maximal degree in co-relation 3767. Up to 1031 conditions per place. [2022-11-25 16:48:09,746 INFO L137 encePairwiseOnDemand]: 474/478 looper letters, 77 selfloop transitions, 2 changer transitions 8/91 dead transitions. [2022-11-25 16:48:09,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 91 transitions, 603 flow [2022-11-25 16:48:09,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:48:09,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:48:09,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 769 transitions. [2022-11-25 16:48:09,751 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5362622036262203 [2022-11-25 16:48:09,751 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 769 transitions. [2022-11-25 16:48:09,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 769 transitions. [2022-11-25 16:48:09,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:48:09,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 769 transitions. [2022-11-25 16:48:09,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:09,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:09,779 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:09,779 INFO L175 Difference]: Start difference. First operand has 89 places, 89 transitions, 472 flow. Second operand 3 states and 769 transitions. [2022-11-25 16:48:09,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 91 transitions, 603 flow [2022-11-25 16:48:09,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 91 transitions, 576 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-25 16:48:09,787 INFO L231 Difference]: Finished difference. Result has 88 places, 78 transitions, 374 flow [2022-11-25 16:48:09,788 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=374, PETRI_PLACES=88, PETRI_TRANSITIONS=78} [2022-11-25 16:48:09,790 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 29 predicate places. [2022-11-25 16:48:09,790 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 78 transitions, 374 flow [2022-11-25 16:48:09,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:09,791 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:48:09,791 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:48:09,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 16:48:09,791 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:48:09,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:48:09,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1686342882, now seen corresponding path program 3 times [2022-11-25 16:48:09,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:48:09,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068914677] [2022-11-25 16:48:09,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:48:09,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:48:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:48:10,560 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-25 16:48:10,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:48:10,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068914677] [2022-11-25 16:48:10,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068914677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:48:10,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:48:10,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:48:10,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495514830] [2022-11-25 16:48:10,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:48:10,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:48:10,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:48:10,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:48:10,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:48:11,416 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 478 [2022-11-25 16:48:11,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 78 transitions, 374 flow. Second operand has 6 states, 6 states have (on average 224.83333333333334) internal successors, (1349), 6 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:11,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:48:11,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 478 [2022-11-25 16:48:11,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:48:12,103 INFO L130 PetriNetUnfolder]: 897/1721 cut-off events. [2022-11-25 16:48:12,103 INFO L131 PetriNetUnfolder]: For 889/889 co-relation queries the response was YES. [2022-11-25 16:48:12,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4329 conditions, 1721 events. 897/1721 cut-off events. For 889/889 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 9580 event pairs, 281 based on Foata normal form. 36/1545 useless extension candidates. Maximal degree in co-relation 3410. Up to 918 conditions per place. [2022-11-25 16:48:12,113 INFO L137 encePairwiseOnDemand]: 470/478 looper letters, 97 selfloop transitions, 11 changer transitions 0/113 dead transitions. [2022-11-25 16:48:12,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 113 transitions, 687 flow [2022-11-25 16:48:12,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:48:12,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:48:12,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1210 transitions. [2022-11-25 16:48:12,119 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5062761506276151 [2022-11-25 16:48:12,119 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1210 transitions. [2022-11-25 16:48:12,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1210 transitions. [2022-11-25 16:48:12,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:48:12,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1210 transitions. [2022-11-25 16:48:12,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:12,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:12,129 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:12,129 INFO L175 Difference]: Start difference. First operand has 88 places, 78 transitions, 374 flow. Second operand 5 states and 1210 transitions. [2022-11-25 16:48:12,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 113 transitions, 687 flow [2022-11-25 16:48:12,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 113 transitions, 673 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-11-25 16:48:12,137 INFO L231 Difference]: Finished difference. Result has 90 places, 78 transitions, 401 flow [2022-11-25 16:48:12,137 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=401, PETRI_PLACES=90, PETRI_TRANSITIONS=78} [2022-11-25 16:48:12,138 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 31 predicate places. [2022-11-25 16:48:12,138 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 78 transitions, 401 flow [2022-11-25 16:48:12,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.83333333333334) internal successors, (1349), 6 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:12,139 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:48:12,139 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:48:12,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 16:48:12,140 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:48:12,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:48:12,140 INFO L85 PathProgramCache]: Analyzing trace with hash -2060660023, now seen corresponding path program 1 times [2022-11-25 16:48:12,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:48:12,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997169699] [2022-11-25 16:48:12,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:48:12,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:48:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:48:12,204 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-25 16:48:12,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:48:12,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997169699] [2022-11-25 16:48:12,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997169699] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:48:12,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:48:12,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:48:12,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040318772] [2022-11-25 16:48:12,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:48:12,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:48:12,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:48:12,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:48:12,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:48:12,237 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 478 [2022-11-25 16:48:12,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 78 transitions, 401 flow. Second operand has 4 states, 4 states have (on average 235.25) internal successors, (941), 4 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:12,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:48:12,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 478 [2022-11-25 16:48:12,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:48:12,573 INFO L130 PetriNetUnfolder]: 770/1444 cut-off events. [2022-11-25 16:48:12,574 INFO L131 PetriNetUnfolder]: For 913/913 co-relation queries the response was YES. [2022-11-25 16:48:12,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3801 conditions, 1444 events. 770/1444 cut-off events. For 913/913 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 7018 event pairs, 572 based on Foata normal form. 10/1263 useless extension candidates. Maximal degree in co-relation 3229. Up to 915 conditions per place. [2022-11-25 16:48:12,582 INFO L137 encePairwiseOnDemand]: 472/478 looper letters, 86 selfloop transitions, 4 changer transitions 0/94 dead transitions. [2022-11-25 16:48:12,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 94 transitions, 621 flow [2022-11-25 16:48:12,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:48:12,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 16:48:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1004 transitions. [2022-11-25 16:48:12,587 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5251046025104602 [2022-11-25 16:48:12,587 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1004 transitions. [2022-11-25 16:48:12,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1004 transitions. [2022-11-25 16:48:12,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:48:12,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1004 transitions. [2022-11-25 16:48:12,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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-25 16:48:12,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 478.0) internal successors, (2390), 5 states have internal predecessors, (2390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:12,595 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 478.0) internal successors, (2390), 5 states have internal predecessors, (2390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:12,595 INFO L175 Difference]: Start difference. First operand has 90 places, 78 transitions, 401 flow. Second operand 4 states and 1004 transitions. [2022-11-25 16:48:12,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 94 transitions, 621 flow [2022-11-25 16:48:12,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 94 transitions, 598 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-11-25 16:48:12,602 INFO L231 Difference]: Finished difference. Result has 92 places, 79 transitions, 401 flow [2022-11-25 16:48:12,603 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=401, PETRI_PLACES=92, PETRI_TRANSITIONS=79} [2022-11-25 16:48:12,603 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 33 predicate places. [2022-11-25 16:48:12,604 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 79 transitions, 401 flow [2022-11-25 16:48:12,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 235.25) internal successors, (941), 4 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:12,604 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:48:12,604 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:48:12,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 16:48:12,605 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:48:12,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:48:12,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1146186173, now seen corresponding path program 1 times [2022-11-25 16:48:12,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:48:12,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475825665] [2022-11-25 16:48:12,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:48:12,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:48:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:48:13,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:48:13,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:48:13,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475825665] [2022-11-25 16:48:13,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475825665] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:48:13,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067035868] [2022-11-25 16:48:13,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:48:13,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:48:13,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:48:13,855 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:48:13,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 16:48:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:48:14,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-25 16:48:14,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:48:14,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:48:14,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:48:14,240 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 16:48:14,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 16:48:14,268 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 16:48:14,268 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-25 16:48:14,438 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 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 16:48:14,690 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 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-25 16:48:14,995 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 58 treesize of output 51 [2022-11-25 16:48:15,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:48:15,119 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 45 treesize of output 47 [2022-11-25 16:48:15,406 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 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-25 16:48:15,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:48:15,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:48:15,827 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_441) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) is different from false [2022-11-25 16:48:15,957 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_438 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_438)) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_441) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_438) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse0 (+ |c_~#queue~0.offset| 3204)))))))) is different from false [2022-11-25 16:48:16,147 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_438 Int) (v_ArrVal_435 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_435) .cse3 v_ArrVal_438)) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (< (+ 1 (select .cse0 .cse1)) v_ArrVal_435) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_441) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_438) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse2 (+ |c_~#queue~0.offset| 3204)))))))) is different from false [2022-11-25 16:48:16,230 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_433 Int) (v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_438 Int) (v_ArrVal_435 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_433)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |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_435) .cse3 v_ArrVal_438)) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_435) (< (+ (select .cse1 .cse3) 1) v_ArrVal_438) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_441) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-25 16:48:20,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-25 16:48:20,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067035868] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:48:20,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:48:20,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-25 16:48:20,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651466844] [2022-11-25 16:48:20,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:48:20,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-25 16:48:20,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:48:20,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-25 16:48:20,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=587, Unknown=11, NotChecked=220, Total=992 [2022-11-25 16:48:20,612 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 478 [2022-11-25 16:48:20,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 79 transitions, 401 flow. Second operand has 32 states, 32 states have (on average 181.5) internal successors, (5808), 32 states have internal predecessors, (5808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:20,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:48:20,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 478 [2022-11-25 16:48:20,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:48:27,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 16:48:29,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 16:48:31,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 16:48:32,592 INFO L130 PetriNetUnfolder]: 783/1491 cut-off events. [2022-11-25 16:48:32,592 INFO L131 PetriNetUnfolder]: For 945/945 co-relation queries the response was YES. [2022-11-25 16:48:32,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3964 conditions, 1491 events. 783/1491 cut-off events. For 945/945 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7437 event pairs, 632 based on Foata normal form. 2/1305 useless extension candidates. Maximal degree in co-relation 3396. Up to 1391 conditions per place. [2022-11-25 16:48:32,599 INFO L137 encePairwiseOnDemand]: 463/478 looper letters, 81 selfloop transitions, 41 changer transitions 0/127 dead transitions. [2022-11-25 16:48:32,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 127 transitions, 875 flow [2022-11-25 16:48:32,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 16:48:32,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-25 16:48:32,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3529 transitions. [2022-11-25 16:48:32,612 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3885707993833957 [2022-11-25 16:48:32,612 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3529 transitions. [2022-11-25 16:48:32,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3529 transitions. [2022-11-25 16:48:32,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:48:32,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3529 transitions. [2022-11-25 16:48:32,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 185.73684210526315) internal successors, (3529), 19 states have internal predecessors, (3529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:32,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 478.0) internal successors, (9560), 20 states have internal predecessors, (9560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:32,641 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 478.0) internal successors, (9560), 20 states have internal predecessors, (9560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:32,642 INFO L175 Difference]: Start difference. First operand has 92 places, 79 transitions, 401 flow. Second operand 19 states and 3529 transitions. [2022-11-25 16:48:32,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 127 transitions, 875 flow [2022-11-25 16:48:32,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 127 transitions, 871 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 16:48:32,650 INFO L231 Difference]: Finished difference. Result has 116 places, 110 transitions, 713 flow [2022-11-25 16:48:32,650 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=713, PETRI_PLACES=116, PETRI_TRANSITIONS=110} [2022-11-25 16:48:32,651 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 57 predicate places. [2022-11-25 16:48:32,651 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 110 transitions, 713 flow [2022-11-25 16:48:32,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 181.5) internal successors, (5808), 32 states have internal predecessors, (5808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:32,654 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:48:32,654 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:48:32,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 16:48:32,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-25 16:48:32,868 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:48:32,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:48:32,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1146186174, now seen corresponding path program 1 times [2022-11-25 16:48:32,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:48:32,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572036346] [2022-11-25 16:48:32,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:48:32,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:48:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:48:33,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:48:33,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:48:33,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572036346] [2022-11-25 16:48:33,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572036346] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:48:33,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972625533] [2022-11-25 16:48:33,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:48:33,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:48:33,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:48:33,394 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:48:33,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 16:48:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:48:33,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-25 16:48:33,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:48:33,703 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-25 16:48:33,786 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-25 16:48:33,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:48:33,834 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-25 16:48:33,948 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-25 16:48:33,948 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-25 16:48:34,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:48:34,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:48:34,428 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:48:34,428 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-25 16:48:34,443 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:48:34,444 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 55 treesize of output 59 [2022-11-25 16:48:34,457 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-25 16:48:34,485 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 9 treesize of output 5 [2022-11-25 16:48:34,503 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:48:34,503 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 47 treesize of output 47 [2022-11-25 16:48:34,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:48:34,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972625533] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:48:34,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:48:34,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-11-25 16:48:34,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329816723] [2022-11-25 16:48:34,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:48:34,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-25 16:48:34,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:48:34,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 16:48:34,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=395, Unknown=7, NotChecked=0, Total=506 [2022-11-25 16:48:37,553 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 478 [2022-11-25 16:48:37,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 110 transitions, 713 flow. Second operand has 23 states, 23 states have (on average 193.08695652173913) internal successors, (4441), 23 states have internal predecessors, (4441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:37,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:48:37,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 478 [2022-11-25 16:48:37,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:48:38,716 INFO L130 PetriNetUnfolder]: 1426/2727 cut-off events. [2022-11-25 16:48:38,716 INFO L131 PetriNetUnfolder]: For 1793/1801 co-relation queries the response was YES. [2022-11-25 16:48:38,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7472 conditions, 2727 events. 1426/2727 cut-off events. For 1793/1801 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 15956 event pairs, 517 based on Foata normal form. 12/2392 useless extension candidates. Maximal degree in co-relation 7209. Up to 1100 conditions per place. [2022-11-25 16:48:38,736 INFO L137 encePairwiseOnDemand]: 471/478 looper letters, 160 selfloop transitions, 29 changer transitions 0/194 dead transitions. [2022-11-25 16:48:38,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 194 transitions, 1424 flow [2022-11-25 16:48:38,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:48:38,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:48:38,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1469 transitions. [2022-11-25 16:48:38,742 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43903167961745365 [2022-11-25 16:48:38,742 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1469 transitions. [2022-11-25 16:48:38,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1469 transitions. [2022-11-25 16:48:38,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:48:38,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1469 transitions. [2022-11-25 16:48:38,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 209.85714285714286) internal successors, (1469), 7 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:38,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 478.0) internal successors, (3824), 8 states have internal predecessors, (3824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:38,753 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 478.0) internal successors, (3824), 8 states have internal predecessors, (3824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:38,754 INFO L175 Difference]: Start difference. First operand has 116 places, 110 transitions, 713 flow. Second operand 7 states and 1469 transitions. [2022-11-25 16:48:38,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 194 transitions, 1424 flow [2022-11-25 16:48:38,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 194 transitions, 1326 flow, removed 39 selfloop flow, removed 4 redundant places. [2022-11-25 16:48:38,774 INFO L231 Difference]: Finished difference. Result has 121 places, 113 transitions, 746 flow [2022-11-25 16:48:38,775 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=746, PETRI_PLACES=121, PETRI_TRANSITIONS=113} [2022-11-25 16:48:38,775 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 62 predicate places. [2022-11-25 16:48:38,776 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 113 transitions, 746 flow [2022-11-25 16:48:38,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 193.08695652173913) internal successors, (4441), 23 states have internal predecessors, (4441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:38,778 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:48:38,778 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:48:38,784 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-25 16:48:38,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 16:48:38,984 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:48:38,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:48:38,985 INFO L85 PathProgramCache]: Analyzing trace with hash 556427979, now seen corresponding path program 1 times [2022-11-25 16:48:38,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:48:38,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170617126] [2022-11-25 16:48:38,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:48:38,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:48:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:48:40,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:48:40,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:48:40,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170617126] [2022-11-25 16:48:40,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170617126] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:48:40,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637615035] [2022-11-25 16:48:40,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:48:40,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:48:40,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:48:40,753 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:48:40,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 16:48:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:48:40,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-25 16:48:40,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:48:40,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2022-11-25 16:48:41,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:48:41,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:48:41,031 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 16:48:41,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-11-25 16:48:41,058 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 16:48:41,059 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-25 16:48:41,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:48:41,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:48:41,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-25 16:48:41,328 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:48:41,356 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-25 16:48:41,356 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-25 16:48:41,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:48:41,507 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:48:41,511 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-25 16:48:41,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2022-11-25 16:48:41,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:48:41,792 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-25 16:48:41,948 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-25 16:48:41,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 39 [2022-11-25 16:48:41,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:48:41,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:48:42,127 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 Int)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_618) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4)) v_ArrVal_619)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-11-25 16:48:42,143 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 Int)) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_618) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_619)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-11-25 16:48:42,156 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 Int)) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_618) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 (+ |c_~#queue~0.offset| 3204))) |c_~#queue~0.offset|) v_ArrVal_619)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-11-25 16:48:42,186 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 Int) (v_ArrVal_614 Int)) (or (not (<= v_ArrVal_614 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_614) .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_618) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_619)) (+ 3208 |c_~#queue~0.offset|)) 2147483647))) is different from false [2022-11-25 16:48:42,213 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 Int) (v_ArrVal_614 Int)) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (< (+ 1 (select .cse0 .cse1)) v_ArrVal_614) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse0 .cse1 v_ArrVal_614) .cse3 (+ (select .cse0 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_618) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_619)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-25 16:48:42,241 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 Int) (v_ArrVal_614 Int) (v_ArrVal_612 Int)) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_612))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_614) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse0 .cse1 v_ArrVal_614) .cse3 (+ (select .cse0 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_618) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_619)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-25 16:48:50,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-25 16:48:50,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637615035] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:48:50,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:48:50,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-25 16:48:50,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013230360] [2022-11-25 16:48:50,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:48:50,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-25 16:48:50,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:48:50,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-25 16:48:50,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=633, Unknown=8, NotChecked=354, Total=1190 [2022-11-25 16:48:50,831 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 478 [2022-11-25 16:48:50,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 113 transitions, 746 flow. Second operand has 35 states, 35 states have (on average 177.45714285714286) internal successors, (6211), 35 states have internal predecessors, (6211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:50,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:48:50,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 478 [2022-11-25 16:48:50,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:48:55,308 WARN L837 $PredicateComparison]: unable to prove that (and (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 Int)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_618) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4)) v_ArrVal_619)) (+ 3208 |c_~#queue~0.offset|)) 2147483647))) is different from false [2022-11-25 16:48:57,169 INFO L130 PetriNetUnfolder]: 2555/4863 cut-off events. [2022-11-25 16:48:57,169 INFO L131 PetriNetUnfolder]: For 4239/4239 co-relation queries the response was YES. [2022-11-25 16:48:57,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13398 conditions, 4863 events. 2555/4863 cut-off events. For 4239/4239 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 31796 event pairs, 731 based on Foata normal form. 27/4275 useless extension candidates. Maximal degree in co-relation 12965. Up to 2204 conditions per place. [2022-11-25 16:48:57,197 INFO L137 encePairwiseOnDemand]: 457/478 looper letters, 172 selfloop transitions, 93 changer transitions 0/270 dead transitions. [2022-11-25 16:48:57,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 270 transitions, 1860 flow [2022-11-25 16:48:57,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 16:48:57,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-25 16:48:57,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3566 transitions. [2022-11-25 16:48:57,207 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3926447918960581 [2022-11-25 16:48:57,207 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3566 transitions. [2022-11-25 16:48:57,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3566 transitions. [2022-11-25 16:48:57,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:48:57,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3566 transitions. [2022-11-25 16:48:57,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 187.68421052631578) internal successors, (3566), 19 states have internal predecessors, (3566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:57,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 478.0) internal successors, (9560), 20 states have internal predecessors, (9560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:57,233 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 478.0) internal successors, (9560), 20 states have internal predecessors, (9560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:57,234 INFO L175 Difference]: Start difference. First operand has 121 places, 113 transitions, 746 flow. Second operand 19 states and 3566 transitions. [2022-11-25 16:48:57,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 270 transitions, 1860 flow [2022-11-25 16:48:57,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 270 transitions, 1812 flow, removed 17 selfloop flow, removed 5 redundant places. [2022-11-25 16:48:57,265 INFO L231 Difference]: Finished difference. Result has 146 places, 170 transitions, 1442 flow [2022-11-25 16:48:57,266 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1442, PETRI_PLACES=146, PETRI_TRANSITIONS=170} [2022-11-25 16:48:57,266 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 87 predicate places. [2022-11-25 16:48:57,267 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 170 transitions, 1442 flow [2022-11-25 16:48:57,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 177.45714285714286) internal successors, (6211), 35 states have internal predecessors, (6211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:57,269 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:48:57,269 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:48:57,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 16:48:57,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-25 16:48:57,476 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:48:57,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:48:57,476 INFO L85 PathProgramCache]: Analyzing trace with hash -397295570, now seen corresponding path program 1 times [2022-11-25 16:48:57,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:48:57,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36661635] [2022-11-25 16:48:57,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:48:57,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:48:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:00,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:00,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:00,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36661635] [2022-11-25 16:49:00,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36661635] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:49:00,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623635983] [2022-11-25 16:49:00,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:00,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:49:00,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:49:00,347 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:49:00,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 16:49:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:00,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-25 16:49:00,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:49:00,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:49:00,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:49:00,562 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 16:49:00,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 16:49:00,576 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 16:49:00,576 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-25 16:49:00,685 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 21 treesize of output 19 [2022-11-25 16:49:00,813 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-25 16:49:00,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:49:00,890 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-25 16:49:00,992 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-25 16:49:01,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:49:01,058 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-25 16:49:01,218 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-25 16:49:01,218 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-25 16:49:01,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:01,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:49:02,241 INFO L321 Elim1Store]: treesize reduction 36, result has 59.6 percent of original size [2022-11-25 16:49:02,241 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 3 case distinctions, treesize of input 87 treesize of output 74 [2022-11-25 16:49:02,273 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:49:02,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 86 treesize of output 104 [2022-11-25 16:49:02,288 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-25 16:49:02,386 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 9 treesize of output 5 [2022-11-25 16:49:02,401 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:49:02,401 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 53 treesize of output 53 [2022-11-25 16:49:02,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:02,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623635983] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:49:02,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:49:02,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 26 [2022-11-25 16:49:02,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87647392] [2022-11-25 16:49:02,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:49:02,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-25 16:49:02,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:02,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-25 16:49:02,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=602, Unknown=22, NotChecked=0, Total=756 [2022-11-25 16:49:03,127 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 478 [2022-11-25 16:49:03,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 170 transitions, 1442 flow. Second operand has 28 states, 28 states have (on average 183.82142857142858) internal successors, (5147), 28 states have internal predecessors, (5147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:03,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:49:03,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 478 [2022-11-25 16:49:03,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:49:08,766 INFO L130 PetriNetUnfolder]: 3212/6225 cut-off events. [2022-11-25 16:49:08,766 INFO L131 PetriNetUnfolder]: For 28235/28235 co-relation queries the response was YES. [2022-11-25 16:49:08,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27414 conditions, 6225 events. 3212/6225 cut-off events. For 28235/28235 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 43945 event pairs, 1082 based on Foata normal form. 18/5459 useless extension candidates. Maximal degree in co-relation 26925. Up to 2919 conditions per place. [2022-11-25 16:49:08,822 INFO L137 encePairwiseOnDemand]: 467/478 looper letters, 198 selfloop transitions, 40 changer transitions 0/243 dead transitions. [2022-11-25 16:49:08,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 243 transitions, 2454 flow [2022-11-25 16:49:08,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 16:49:08,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-25 16:49:08,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2503 transitions. [2022-11-25 16:49:08,831 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40280012874155136 [2022-11-25 16:49:08,831 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2503 transitions. [2022-11-25 16:49:08,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2503 transitions. [2022-11-25 16:49:08,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:49:08,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2503 transitions. [2022-11-25 16:49:08,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 192.53846153846155) internal successors, (2503), 13 states have internal predecessors, (2503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:08,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 478.0) internal successors, (6692), 14 states have internal predecessors, (6692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:08,855 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 478.0) internal successors, (6692), 14 states have internal predecessors, (6692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:08,855 INFO L175 Difference]: Start difference. First operand has 146 places, 170 transitions, 1442 flow. Second operand 13 states and 2503 transitions. [2022-11-25 16:49:08,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 243 transitions, 2454 flow [2022-11-25 16:49:08,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 243 transitions, 2278 flow, removed 43 selfloop flow, removed 8 redundant places. [2022-11-25 16:49:08,957 INFO L231 Difference]: Finished difference. Result has 151 places, 175 transitions, 1411 flow [2022-11-25 16:49:08,957 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=1246, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1411, PETRI_PLACES=151, PETRI_TRANSITIONS=175} [2022-11-25 16:49:08,958 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 92 predicate places. [2022-11-25 16:49:08,958 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 175 transitions, 1411 flow [2022-11-25 16:49:08,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 183.82142857142858) internal successors, (5147), 28 states have internal predecessors, (5147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:08,960 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:49:08,960 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:08,969 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-25 16:49:09,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:49:09,167 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:49:09,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:09,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1948192109, now seen corresponding path program 1 times [2022-11-25 16:49:09,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:09,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346696415] [2022-11-25 16:49:09,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:09,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:10,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:10,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:10,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346696415] [2022-11-25 16:49:10,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346696415] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:49:10,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182373979] [2022-11-25 16:49:10,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:10,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:49:10,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:49:10,463 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:49:10,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 16:49:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:10,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-25 16:49:10,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:49:10,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:49:10,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:49:10,735 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 16:49:10,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 16:49:10,769 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 16:49:10,769 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 20 treesize of output 22 [2022-11-25 16:49:10,976 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 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 16:49:11,091 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 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-25 16:49:11,355 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 58 treesize of output 51 [2022-11-25 16:49:11,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:49:11,456 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 45 treesize of output 47 [2022-11-25 16:49:11,711 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 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-25 16:49:11,922 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 52 treesize of output 54 [2022-11-25 16:49:12,162 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 59 treesize of output 54 [2022-11-25 16:49:12,915 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:12,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:49:13,206 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_824 (Array Int Int)) (v_ArrVal_827 (Array Int Int)) (v_ArrVal_825 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_824))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse0 .cse1))) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_825)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_827) |c_~#queue~0.base|) .cse1) 2147483647))))) is different from false [2022-11-25 16:49:13,232 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_824 (Array Int Int)) (v_ArrVal_827 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_822)) |c_~#stored_elements~0.base| v_ArrVal_824))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (not (<= v_ArrVal_822 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_825)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_827) |c_~#queue~0.base|) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse1 .cse2))))))) is different from false [2022-11-25 16:49:13,437 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_824 (Array Int Int)) (v_ArrVal_827 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int) (v_ArrVal_820 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_820) .cse4 v_ArrVal_822)) |c_~#stored_elements~0.base| v_ArrVal_824))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_825)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_827) |c_~#queue~0.base|) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse1 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_822)))))) is different from false [2022-11-25 16:49:13,496 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_819 Int) (v_ArrVal_824 (Array Int Int)) (v_ArrVal_827 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int) (v_ArrVal_820 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_819)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_820) .cse1 v_ArrVal_822)) |c_~#stored_elements~0.base| v_ArrVal_824))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_822) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse2 .cse3))) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_825)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_827) |c_~#queue~0.base|) .cse3) 2147483647)))))) is different from false [2022-11-25 16:49:17,746 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-25 16:49:17,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182373979] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:49:17,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:49:17,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2022-11-25 16:49:17,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574658920] [2022-11-25 16:49:17,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:49:17,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-25 16:49:17,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:17,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-25 16:49:17,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=548, Unknown=14, NotChecked=212, Total=930 [2022-11-25 16:49:18,325 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 478 [2022-11-25 16:49:18,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 175 transitions, 1411 flow. Second operand has 31 states, 31 states have (on average 183.93548387096774) internal successors, (5702), 31 states have internal predecessors, (5702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:18,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:49:18,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 478 [2022-11-25 16:49:18,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:49:38,698 WARN L233 SmtUtils]: Spent 8.06s on a formula simplification. DAG size of input: 127 DAG size of output: 96 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 16:49:40,017 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_827 (Array Int Int)) (v_ArrVal_825 Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (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_825)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_827) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) 2147483647)) (forall ((v_ArrVal_827 (Array Int Int)) (v_ArrVal_825 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse1 .cse2))) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_825)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_827) |c_~#queue~0.base|) .cse2) 2147483647)))) (forall ((v_ArrVal_827 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_827) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) 2147483647)))) is different from false [2022-11-25 16:49:42,119 INFO L130 PetriNetUnfolder]: 4340/8427 cut-off events. [2022-11-25 16:49:42,119 INFO L131 PetriNetUnfolder]: For 38950/38950 co-relation queries the response was YES. [2022-11-25 16:49:42,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37675 conditions, 8427 events. 4340/8427 cut-off events. For 38950/38950 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 61236 event pairs, 1210 based on Foata normal form. 141/7593 useless extension candidates. Maximal degree in co-relation 34128. Up to 3501 conditions per place. [2022-11-25 16:49:42,179 INFO L137 encePairwiseOnDemand]: 457/478 looper letters, 216 selfloop transitions, 121 changer transitions 0/342 dead transitions. [2022-11-25 16:49:42,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 342 transitions, 3690 flow [2022-11-25 16:49:42,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 16:49:42,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-11-25 16:49:42,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3870 transitions. [2022-11-25 16:49:42,187 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40481171548117156 [2022-11-25 16:49:42,187 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3870 transitions. [2022-11-25 16:49:42,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3870 transitions. [2022-11-25 16:49:42,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:49:42,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3870 transitions. [2022-11-25 16:49:42,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 193.5) internal successors, (3870), 20 states have internal predecessors, (3870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:42,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 478.0) internal successors, (10038), 21 states have internal predecessors, (10038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:42,210 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 478.0) internal successors, (10038), 21 states have internal predecessors, (10038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:42,210 INFO L175 Difference]: Start difference. First operand has 151 places, 175 transitions, 1411 flow. Second operand 20 states and 3870 transitions. [2022-11-25 16:49:42,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 342 transitions, 3690 flow [2022-11-25 16:49:42,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 342 transitions, 3609 flow, removed 24 selfloop flow, removed 9 redundant places. [2022-11-25 16:49:42,273 INFO L231 Difference]: Finished difference. Result has 172 places, 238 transitions, 2571 flow [2022-11-25 16:49:42,274 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=1313, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2571, PETRI_PLACES=172, PETRI_TRANSITIONS=238} [2022-11-25 16:49:42,274 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 113 predicate places. [2022-11-25 16:49:42,275 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 238 transitions, 2571 flow [2022-11-25 16:49:42,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 183.93548387096774) internal successors, (5702), 31 states have internal predecessors, (5702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:42,276 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:49:42,276 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:42,282 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 16:49:42,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 16:49:42,479 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:49:42,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:42,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1948192069, now seen corresponding path program 1 times [2022-11-25 16:49:42,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:42,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615908125] [2022-11-25 16:49:42,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:42,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:43,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:43,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:43,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615908125] [2022-11-25 16:49:43,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615908125] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:49:43,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097334368] [2022-11-25 16:49:43,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:43,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:49:43,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:49:43,666 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:49:43,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 16:49:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:43,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-25 16:49:43,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:49:43,929 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 16:49:43,930 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 20 treesize of output 22 [2022-11-25 16:49:44,274 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 43 treesize of output 21 [2022-11-25 16:49:44,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:49:44,349 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 28 treesize of output 28 [2022-11-25 16:49:44,494 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 16:49:44,495 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 43 treesize of output 33 [2022-11-25 16:49:44,588 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 28 treesize of output 28 [2022-11-25 16:49:44,654 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 35 treesize of output 28 [2022-11-25 16:49:44,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:44,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:49:45,255 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:49:45,255 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 63 [2022-11-25 16:49:45,268 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:49:45,269 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 113 treesize of output 113 [2022-11-25 16:49:45,289 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 88 treesize of output 80 [2022-11-25 16:49:45,299 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 55 treesize of output 43 [2022-11-25 16:49:45,312 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 18 treesize of output 10 [2022-11-25 16:49:45,358 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:49:45,359 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 79 treesize of output 67 [2022-11-25 16:49:45,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:45,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097334368] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:49:45,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:49:45,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-25 16:49:45,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28559935] [2022-11-25 16:49:45,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:49:45,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-25 16:49:45,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:45,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 16:49:45,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=661, Unknown=19, NotChecked=0, Total=812 [2022-11-25 16:49:47,884 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 478 [2022-11-25 16:49:47,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 238 transitions, 2571 flow. Second operand has 29 states, 29 states have (on average 184.06896551724137) internal successors, (5338), 29 states have internal predecessors, (5338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:47,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:49:47,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 478 [2022-11-25 16:49:47,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:49:52,352 INFO L130 PetriNetUnfolder]: 5118/10048 cut-off events. [2022-11-25 16:49:52,352 INFO L131 PetriNetUnfolder]: For 207107/207111 co-relation queries the response was YES. [2022-11-25 16:49:52,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66043 conditions, 10048 events. 5118/10048 cut-off events. For 207107/207111 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 72971 event pairs, 1626 based on Foata normal form. 243/9695 useless extension candidates. Maximal degree in co-relation 55343. Up to 3778 conditions per place. [2022-11-25 16:49:52,443 INFO L137 encePairwiseOnDemand]: 467/478 looper letters, 296 selfloop transitions, 70 changer transitions 0/371 dead transitions. [2022-11-25 16:49:52,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 371 transitions, 5155 flow [2022-11-25 16:49:52,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 16:49:52,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-25 16:49:52,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2924 transitions. [2022-11-25 16:49:52,450 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4078103207810321 [2022-11-25 16:49:52,450 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2924 transitions. [2022-11-25 16:49:52,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2924 transitions. [2022-11-25 16:49:52,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:49:52,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2924 transitions. [2022-11-25 16:49:52,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 194.93333333333334) internal successors, (2924), 15 states have internal predecessors, (2924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:52,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 478.0) internal successors, (7648), 16 states have internal predecessors, (7648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:52,466 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 478.0) internal successors, (7648), 16 states have internal predecessors, (7648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:52,466 INFO L175 Difference]: Start difference. First operand has 172 places, 238 transitions, 2571 flow. Second operand 15 states and 2924 transitions. [2022-11-25 16:49:52,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 371 transitions, 5155 flow [2022-11-25 16:49:52,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 371 transitions, 4801 flow, removed 162 selfloop flow, removed 6 redundant places. [2022-11-25 16:49:52,685 INFO L231 Difference]: Finished difference. Result has 182 places, 241 transitions, 2460 flow [2022-11-25 16:49:52,686 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=2158, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2460, PETRI_PLACES=182, PETRI_TRANSITIONS=241} [2022-11-25 16:49:52,686 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 123 predicate places. [2022-11-25 16:49:52,687 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 241 transitions, 2460 flow [2022-11-25 16:49:52,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 184.06896551724137) internal successors, (5338), 29 states have internal predecessors, (5338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:52,688 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:49:52,688 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:52,701 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 16:49:52,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 16:49:52,896 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:49:52,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:52,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1632239263, now seen corresponding path program 1 times [2022-11-25 16:49:52,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:52,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258584308] [2022-11-25 16:49:52,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:52,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:53,049 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 16:49:53,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:53,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258584308] [2022-11-25 16:49:53,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258584308] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:53,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:53,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:49:53,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736175017] [2022-11-25 16:49:53,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:53,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:49:53,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:53,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:49:53,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:49:53,092 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 478 [2022-11-25 16:49:53,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 241 transitions, 2460 flow. Second operand has 4 states, 4 states have (on average 236.75) internal successors, (947), 4 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:53,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:49:53,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 478 [2022-11-25 16:49:53,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:49:55,503 INFO L130 PetriNetUnfolder]: 5124/9964 cut-off events. [2022-11-25 16:49:55,503 INFO L131 PetriNetUnfolder]: For 206084/206084 co-relation queries the response was YES. [2022-11-25 16:49:55,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66398 conditions, 9964 events. 5124/9964 cut-off events. For 206084/206084 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 71808 event pairs, 2742 based on Foata normal form. 129/9368 useless extension candidates. Maximal degree in co-relation 55509. Up to 5499 conditions per place. [2022-11-25 16:49:55,588 INFO L137 encePairwiseOnDemand]: 472/478 looper letters, 223 selfloop transitions, 27 changer transitions 0/254 dead transitions. [2022-11-25 16:49:55,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 254 transitions, 3244 flow [2022-11-25 16:49:55,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:49:55,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 16:49:55,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 987 transitions. [2022-11-25 16:49:55,590 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.516213389121339 [2022-11-25 16:49:55,590 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 987 transitions. [2022-11-25 16:49:55,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 987 transitions. [2022-11-25 16:49:55,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:49:55,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 987 transitions. [2022-11-25 16:49:55,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 246.75) internal successors, (987), 4 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:55,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 478.0) internal successors, (2390), 5 states have internal predecessors, (2390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:55,595 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 478.0) internal successors, (2390), 5 states have internal predecessors, (2390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:55,595 INFO L175 Difference]: Start difference. First operand has 182 places, 241 transitions, 2460 flow. Second operand 4 states and 987 transitions. [2022-11-25 16:49:55,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 254 transitions, 3244 flow [2022-11-25 16:49:55,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 254 transitions, 3091 flow, removed 24 selfloop flow, removed 11 redundant places. [2022-11-25 16:49:55,730 INFO L231 Difference]: Finished difference. Result has 173 places, 239 transitions, 2347 flow [2022-11-25 16:49:55,730 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=2293, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2347, PETRI_PLACES=173, PETRI_TRANSITIONS=239} [2022-11-25 16:49:55,730 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 114 predicate places. [2022-11-25 16:49:55,731 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 239 transitions, 2347 flow [2022-11-25 16:49:55,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 236.75) internal successors, (947), 4 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:55,731 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:49:55,731 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:55,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 16:49:55,731 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:49:55,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:55,732 INFO L85 PathProgramCache]: Analyzing trace with hash -2130876182, now seen corresponding path program 1 times [2022-11-25 16:49:55,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:55,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881009385] [2022-11-25 16:49:55,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:55,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:55,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:55,841 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:55,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:55,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881009385] [2022-11-25 16:49:55,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881009385] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:49:55,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221211084] [2022-11-25 16:49:55,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:55,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:49:55,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:49:55,844 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:49:55,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 16:49:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:56,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 16:49:56,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:49:56,150 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:56,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:49:56,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221211084] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:56,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 16:49:56,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-25 16:49:56,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540189657] [2022-11-25 16:49:56,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:56,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:49:56,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:56,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:49:56,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:49:56,187 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 478 [2022-11-25 16:49:56,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 239 transitions, 2347 flow. Second operand has 6 states, 6 states have (on average 235.66666666666666) internal successors, (1414), 6 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:56,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:49:56,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 478 [2022-11-25 16:49:56,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:49:58,628 INFO L130 PetriNetUnfolder]: 4967/9660 cut-off events. [2022-11-25 16:49:58,629 INFO L131 PetriNetUnfolder]: For 197297/197297 co-relation queries the response was YES. [2022-11-25 16:49:58,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63408 conditions, 9660 events. 4967/9660 cut-off events. For 197297/197297 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 69097 event pairs, 2410 based on Foata normal form. 129/9193 useless extension candidates. Maximal degree in co-relation 52582. Up to 8276 conditions per place. [2022-11-25 16:49:58,861 INFO L137 encePairwiseOnDemand]: 473/478 looper letters, 245 selfloop transitions, 13 changer transitions 0/262 dead transitions. [2022-11-25 16:49:58,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 262 transitions, 3398 flow [2022-11-25 16:49:58,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:49:58,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:49:58,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1474 transitions. [2022-11-25 16:49:58,865 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5139470013947002 [2022-11-25 16:49:58,865 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1474 transitions. [2022-11-25 16:49:58,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1474 transitions. [2022-11-25 16:49:58,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:49:58,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1474 transitions. [2022-11-25 16:49:58,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 245.66666666666666) internal successors, (1474), 6 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:58,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 478.0) internal successors, (3346), 7 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:58,869 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 478.0) internal successors, (3346), 7 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:58,869 INFO L175 Difference]: Start difference. First operand has 173 places, 239 transitions, 2347 flow. Second operand 6 states and 1474 transitions. [2022-11-25 16:49:58,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 262 transitions, 3398 flow [2022-11-25 16:49:58,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 262 transitions, 3351 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-11-25 16:49:58,980 INFO L231 Difference]: Finished difference. Result has 174 places, 238 transitions, 2322 flow [2022-11-25 16:49:58,981 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=2296, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2322, PETRI_PLACES=174, PETRI_TRANSITIONS=238} [2022-11-25 16:49:58,981 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 115 predicate places. [2022-11-25 16:49:58,981 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 238 transitions, 2322 flow [2022-11-25 16:49:58,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 235.66666666666666) internal successors, (1414), 6 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:58,981 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:49:58,981 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] [2022-11-25 16:49:58,987 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 16:49:59,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:49:59,183 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:49:59,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:59,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1016719999, now seen corresponding path program 1 times [2022-11-25 16:49:59,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:59,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509866344] [2022-11-25 16:49:59,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:59,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:59,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 16:49:59,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:59,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509866344] [2022-11-25 16:49:59,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509866344] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:59,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:59,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:49:59,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004008419] [2022-11-25 16:49:59,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:59,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:49:59,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:59,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:49:59,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:49:59,305 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 478 [2022-11-25 16:49:59,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 238 transitions, 2322 flow. Second operand has 3 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:59,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:49:59,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 478 [2022-11-25 16:49:59,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:50:00,834 INFO L130 PetriNetUnfolder]: 3527/7202 cut-off events. [2022-11-25 16:50:00,834 INFO L131 PetriNetUnfolder]: For 154981/154981 co-relation queries the response was YES. [2022-11-25 16:50:00,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40709 conditions, 7202 events. 3527/7202 cut-off events. For 154981/154981 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 48245 event pairs, 398 based on Foata normal form. 794/7462 useless extension candidates. Maximal degree in co-relation 29883. Up to 6399 conditions per place. [2022-11-25 16:50:00,893 INFO L137 encePairwiseOnDemand]: 473/478 looper letters, 216 selfloop transitions, 5 changer transitions 0/223 dead transitions. [2022-11-25 16:50:00,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 223 transitions, 2687 flow [2022-11-25 16:50:00,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:50:00,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:50:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 762 transitions. [2022-11-25 16:50:00,895 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5313807531380753 [2022-11-25 16:50:00,895 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 762 transitions. [2022-11-25 16:50:00,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 762 transitions. [2022-11-25 16:50:00,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:50:00,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 762 transitions. [2022-11-25 16:50:00,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 254.0) internal successors, (762), 3 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:00,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:00,898 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:00,898 INFO L175 Difference]: Start difference. First operand has 174 places, 238 transitions, 2322 flow. Second operand 3 states and 762 transitions. [2022-11-25 16:50:00,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 223 transitions, 2687 flow [2022-11-25 16:50:00,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 223 transitions, 2660 flow, removed 1 selfloop flow, removed 6 redundant places. [2022-11-25 16:50:00,952 INFO L231 Difference]: Finished difference. Result has 170 places, 213 transitions, 2110 flow [2022-11-25 16:50:00,952 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=2100, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2110, PETRI_PLACES=170, PETRI_TRANSITIONS=213} [2022-11-25 16:50:00,953 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 111 predicate places. [2022-11-25 16:50:00,953 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 213 transitions, 2110 flow [2022-11-25 16:50:00,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:00,954 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:50:00,954 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] [2022-11-25 16:50:00,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 16:50:00,954 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:50:00,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:00,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1329132243, now seen corresponding path program 1 times [2022-11-25 16:50:00,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:00,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512421427] [2022-11-25 16:50:00,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:00,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:01,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:01,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512421427] [2022-11-25 16:50:01,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512421427] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:50:01,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554719336] [2022-11-25 16:50:01,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:01,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:50:01,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:01,071 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:50:01,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 16:50:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:01,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 16:50:01,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:50:01,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:01,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:50:01,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:01,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554719336] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:50:01,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:50:01,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-25 16:50:01,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401792958] [2022-11-25 16:50:01,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:50:01,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 16:50:01,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:01,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 16:50:01,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-25 16:50:01,440 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 478 [2022-11-25 16:50:01,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 213 transitions, 2110 flow. Second operand has 10 states, 10 states have (on average 235.4) internal successors, (2354), 10 states have internal predecessors, (2354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:01,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:50:01,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 478 [2022-11-25 16:50:01,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:50:02,740 INFO L130 PetriNetUnfolder]: 2311/4848 cut-off events. [2022-11-25 16:50:02,741 INFO L131 PetriNetUnfolder]: For 84520/84520 co-relation queries the response was YES. [2022-11-25 16:50:02,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29191 conditions, 4848 events. 2311/4848 cut-off events. For 84520/84520 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 28701 event pairs, 1488 based on Foata normal form. 43/4567 useless extension candidates. Maximal degree in co-relation 22730. Up to 3105 conditions per place. [2022-11-25 16:50:02,772 INFO L137 encePairwiseOnDemand]: 473/478 looper letters, 208 selfloop transitions, 18 changer transitions 0/230 dead transitions. [2022-11-25 16:50:02,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 230 transitions, 2919 flow [2022-11-25 16:50:02,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:50:02,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:50:02,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1706 transitions. [2022-11-25 16:50:02,774 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5098625224148237 [2022-11-25 16:50:02,775 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1706 transitions. [2022-11-25 16:50:02,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1706 transitions. [2022-11-25 16:50:02,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:50:02,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1706 transitions. [2022-11-25 16:50:02,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 243.71428571428572) internal successors, (1706), 7 states have internal predecessors, (1706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:02,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 478.0) internal successors, (3824), 8 states have internal predecessors, (3824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:02,780 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 478.0) internal successors, (3824), 8 states have internal predecessors, (3824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:02,780 INFO L175 Difference]: Start difference. First operand has 170 places, 213 transitions, 2110 flow. Second operand 7 states and 1706 transitions. [2022-11-25 16:50:02,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 230 transitions, 2919 flow [2022-11-25 16:50:02,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 230 transitions, 2889 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-11-25 16:50:02,826 INFO L231 Difference]: Finished difference. Result has 177 places, 210 transitions, 2084 flow [2022-11-25 16:50:02,826 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=1973, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2084, PETRI_PLACES=177, PETRI_TRANSITIONS=210} [2022-11-25 16:50:02,827 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 118 predicate places. [2022-11-25 16:50:02,827 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 210 transitions, 2084 flow [2022-11-25 16:50:02,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 235.4) internal successors, (2354), 10 states have internal predecessors, (2354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:02,828 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:50:02,828 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:02,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:03,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-25 16:50:03,031 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:50:03,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:03,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1853078494, now seen corresponding path program 2 times [2022-11-25 16:50:03,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:03,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139493122] [2022-11-25 16:50:03,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:03,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:05,677 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:05,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:05,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139493122] [2022-11-25 16:50:05,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139493122] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:50:05,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748867836] [2022-11-25 16:50:05,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 16:50:05,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:50:05,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:05,688 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:50:05,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 16:50:05,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 16:50:05,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:50:05,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 98 conjunts are in the unsatisfiable core [2022-11-25 16:50:05,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:50:06,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:50:06,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:50:06,029 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 16:50:06,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 16:50:06,062 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 16:50:06,063 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 20 treesize of output 22 [2022-11-25 16:50:06,286 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 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 16:50:06,503 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 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-25 16:50:06,813 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 58 treesize of output 51 [2022-11-25 16:50:06,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:50:06,943 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 45 treesize of output 47 [2022-11-25 16:50:07,238 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 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-25 16:50:07,705 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 0 case distinctions, treesize of input 70 treesize of output 63 [2022-11-25 16:50:10,342 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 75 treesize of output 68 [2022-11-25 16:50:14,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:50:14,609 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 62 treesize of output 64 [2022-11-25 16:50:16,103 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 71 [2022-11-25 16:50:16,413 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 71 treesize of output 66 [2022-11-25 16:50:26,269 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:26,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:50:26,369 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1298 Int) (v_ArrVal_1297 (Array Int Int))) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1298) (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647)) is different from false [2022-11-25 16:50:26,602 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1294 Int) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1294)) |c_~#stored_elements~0.base| v_ArrVal_1296))) (or (not (<= v_ArrVal_1294 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select (select .cse0 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)))) (< (select (store (select (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-25 16:50:27,224 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1293 Int) (v_ArrVal_1294 Int) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1293) .cse2 v_ArrVal_1294)) |c_~#stored_elements~0.base| v_ArrVal_1296))) (or (< (+ 1 (select .cse0 .cse1)) v_ArrVal_1293) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1294) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select (select .cse3 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)))) (< (select (store (select (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-25 16:50:38,268 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1293 Int) (v_ArrVal_1294 Int) (v_ArrVal_1287 Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1291 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1287)) |c_~#stored_elements~0.base| v_ArrVal_1289))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1291)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse2 v_ArrVal_1293) .cse1 v_ArrVal_1294)) |c_~#stored_elements~0.base| v_ArrVal_1296))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1294) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1293) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select (select .cse3 |c_~#queue~0.base|) .cse1))) (not (<= v_ArrVal_1287 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| (select .cse4 .cse1))) (< (select (store (select (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse2) 2147483647))))))) is different from false [2022-11-25 16:50:40,659 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1293 Int) (v_ArrVal_1294 Int) (v_ArrVal_1285 Int) (v_ArrVal_1287 Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1291 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1285) .cse6 v_ArrVal_1287)) |c_~#stored_elements~0.base| v_ArrVal_1289))) (let ((.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1291)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse4 v_ArrVal_1293) .cse1 v_ArrVal_1294)) |c_~#stored_elements~0.base| v_ArrVal_1296))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1294) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select (select .cse3 |c_~#queue~0.base|) .cse1))) (< (+ (select .cse2 .cse4) 1) v_ArrVal_1293) (< (select (store (select (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse4) 2147483647) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1287) (not (<= v_ArrVal_1285 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)))))))))) is different from false [2022-11-25 16:50:40,753 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1293 Int) (v_ArrVal_1294 Int) (v_ArrVal_1285 Int) (v_ArrVal_1287 Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1291 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse7 v_ArrVal_1285) .cse6 v_ArrVal_1287)) |c_~#stored_elements~0.base| v_ArrVal_1289))) (let ((.cse0 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1291)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse4 v_ArrVal_1293) .cse1 v_ArrVal_1294)) |c_~#stored_elements~0.base| v_ArrVal_1296))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1294) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select (select .cse3 |c_~#queue~0.base|) .cse1))) (< (+ (select .cse2 .cse4) 1) v_ArrVal_1293) (< (select (store (select (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse4) 2147483647) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1287) (< (+ 1 (select .cse5 .cse7)) v_ArrVal_1285)))))))) is different from false [2022-11-25 16:50:40,848 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1291 Int) (v_ArrVal_1293 Int) (v_ArrVal_1284 Int) (v_ArrVal_1294 Int) (v_ArrVal_1285 Int) (v_ArrVal_1287 Int) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 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_1284)) (.cse6 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse6 v_ArrVal_1285) .cse3 v_ArrVal_1287)) |c_~#stored_elements~0.base| v_ArrVal_1289))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1291)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1293) .cse1 v_ArrVal_1294)) |c_~#stored_elements~0.base| v_ArrVal_1296))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select (select .cse0 |c_~#queue~0.base|) .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1287) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1293) (< (select (store (select (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse5) 2147483647) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1294) (< (+ (select .cse2 .cse6) 1) v_ArrVal_1285) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| (select .cse7 .cse1)))))))))) is different from false [2022-11-25 16:50:54,437 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 3 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-25 16:50:54,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748867836] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:50:54,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:50:54,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 52 [2022-11-25 16:50:54,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568804989] [2022-11-25 16:50:54,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:50:54,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-25 16:50:54,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:54,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-25 16:50:54,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=517, Invalid=1600, Unknown=73, NotChecked=672, Total=2862 [2022-11-25 16:50:56,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:50:58,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:51:00,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:51:02,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:51:03,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:51:05,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:51:08,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:51:11,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:51:13,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:51:15,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:51:17,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:51:19,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:51:21,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:51:21,060 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 478 [2022-11-25 16:51:21,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 210 transitions, 2084 flow. Second operand has 54 states, 54 states have (on average 177.44444444444446) internal successors, (9582), 54 states have internal predecessors, (9582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:21,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:51:21,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 478 [2022-11-25 16:51:21,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:51:34,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:51:37,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:51:47,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:51:49,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:52:11,085 WARN L233 SmtUtils]: Spent 8.99s on a formula simplification. DAG size of input: 113 DAG size of output: 111 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 16:52:26,819 WARN L233 SmtUtils]: Spent 11.33s on a formula simplification. DAG size of input: 119 DAG size of output: 113 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 16:52:41,153 WARN L233 SmtUtils]: Spent 11.50s on a formula simplification. DAG size of input: 174 DAG size of output: 114 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 16:52:43,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:52:45,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:52:52,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:52:54,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:52:56,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:52:59,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:53:01,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:53:09,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:53:18,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:53:21,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:53:23,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:53:25,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:53:30,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:53:32,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:53:34,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:53:37,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:53:39,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:53:41,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:53:51,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 16:53:53,884 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse6 (+ 1 (select .cse8 .cse9))) (.cse5 (+ (select .cse8 .cse10) 1)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (forall ((v_ArrVal_1293 Int) (v_ArrVal_1294 Int) (v_ArrVal_1285 Int) (v_ArrVal_1287 Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1291 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1285) .cse10 v_ArrVal_1287)) |c_~#stored_elements~0.base| v_ArrVal_1289))) (let ((.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1291))) (let ((.cse3 (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse4 v_ArrVal_1293) .cse1 v_ArrVal_1294)) |c_~#stored_elements~0.base| v_ArrVal_1296))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1294) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select (select .cse3 |c_~#queue~0.base|) .cse1))) (< (+ (select .cse2 .cse4) 1) v_ArrVal_1293) (< (select (store (select (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse4) 2147483647) (< .cse5 v_ArrVal_1287) (< .cse6 v_ArrVal_1285))))))) (exists ((v_ArrVal_1293 Int) (v_ArrVal_1284 Int) (v_ArrVal_1294 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_103| Int) (v_ArrVal_1285 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1287 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_105| Int) (v_ArrVal_1298 Int) (v_ArrVal_1291 Int)) (let ((.cse12 (store (store (store (store ((as const (Array Int Int)) 0) (+ 3200 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) 0) .cse10 0) .cse9 0) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_103| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1284))) (let ((.cse11 (store (store (store .cse12 .cse9 v_ArrVal_1285) .cse10 v_ArrVal_1287) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1291))) (and (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| v_ArrVal_1287) (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_103| 0) (<= v_ArrVal_1294 (+ (select .cse11 .cse10) 1)) (<= v_ArrVal_1293 (+ (select .cse11 .cse9) 1)) (= .cse8 (store (store (store .cse11 .cse9 v_ArrVal_1293) .cse10 v_ArrVal_1294) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_105| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1298)) (<= v_ArrVal_1287 (+ (select .cse12 .cse10) 1)) (<= v_ArrVal_1285 (+ (select .cse12 .cse9) 1)) (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_105| v_ArrVal_1294))))) (forall ((v_ArrVal_1293 Int) (v_ArrVal_1294 Int) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1293) .cse10 v_ArrVal_1294)) |c_~#stored_elements~0.base| v_ArrVal_1296))) (or (< .cse6 v_ArrVal_1293) (< .cse5 v_ArrVal_1294) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select (select .cse13 |c_~#queue~0.base|) .cse1))) (< (select (store (select (store .cse13 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse4) 2147483647)))) (= 5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)))) is different from false [2022-11-25 16:54:00,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 16:54:18,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:54:18,408 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (+ (select .cse8 .cse10) 1)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse9 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1293 Int) (v_ArrVal_1294 Int) (v_ArrVal_1285 Int) (v_ArrVal_1287 Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1291 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1285) .cse10 v_ArrVal_1287)) |c_~#stored_elements~0.base| v_ArrVal_1289))) (let ((.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1291))) (let ((.cse3 (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse4 v_ArrVal_1293) .cse1 v_ArrVal_1294)) |c_~#stored_elements~0.base| v_ArrVal_1296))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1294) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select (select .cse3 |c_~#queue~0.base|) .cse1))) (< (+ (select .cse2 .cse4) 1) v_ArrVal_1293) (< (select (store (select (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse4) 2147483647) (< .cse5 v_ArrVal_1287) (not (<= v_ArrVal_1285 .cse6)))))))) (forall ((v_ArrVal_1293 Int) (v_ArrVal_1294 Int) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1293) .cse10 v_ArrVal_1294)) |c_~#stored_elements~0.base| v_ArrVal_1296))) (or (< .cse5 v_ArrVal_1294) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select (select .cse11 |c_~#queue~0.base|) .cse1))) (not (<= v_ArrVal_1293 .cse6)) (< (select (store (select (store .cse11 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse4) 2147483647))))))) is different from false [2022-11-25 16:54:20,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:54:22,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:54:24,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:54:26,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:54:28,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:54:30,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:54:32,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:54:34,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:54:36,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:54:36,485 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse11 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select .cse9 .cse10))) (let ((.cse7 (+ 1 .cse0)) (.cse6 (+ (select .cse9 .cse11) 1)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse5 (+ 3208 |c_~#queue~0.offset|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (<= .cse0 2) (forall ((v_ArrVal_1293 Int) (v_ArrVal_1294 Int) (v_ArrVal_1285 Int) (v_ArrVal_1287 Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1291 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 .cse10 v_ArrVal_1285) .cse11 v_ArrVal_1287)) |c_~#stored_elements~0.base| v_ArrVal_1289))) (let ((.cse1 (select .cse8 |c_~#queue~0.base|))) (let ((.cse3 (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1291))) (let ((.cse4 (store (store .cse8 |c_~#queue~0.base| (store (store .cse3 .cse5 v_ArrVal_1293) .cse2 v_ArrVal_1294)) |c_~#stored_elements~0.base| v_ArrVal_1296))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| (select .cse1 .cse2))) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1294) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select (select .cse4 |c_~#queue~0.base|) .cse2))) (< (+ (select .cse3 .cse5) 1) v_ArrVal_1293) (< (select (store (select (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse5) 2147483647) (< .cse6 v_ArrVal_1287) (< .cse7 v_ArrVal_1285))))))) (forall ((v_ArrVal_1293 Int) (v_ArrVal_1294 Int) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 .cse10 v_ArrVal_1293) .cse11 v_ArrVal_1294)) |c_~#stored_elements~0.base| v_ArrVal_1296))) (or (< .cse7 v_ArrVal_1293) (< .cse6 v_ArrVal_1294) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select (select .cse12 |c_~#queue~0.base|) .cse2))) (< (select (store (select (store .cse12 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse5) 2147483647)))))))) is different from false [2022-11-25 16:54:38,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 16:54:40,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:54:51,122 WARN L233 SmtUtils]: Spent 6.25s on a formula simplification. DAG size of input: 108 DAG size of output: 102 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 16:55:01,925 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (+ (select .cse4 .cse5) 1)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1294 Int) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1294)) |c_~#stored_elements~0.base| v_ArrVal_1296))) (or (< .cse0 v_ArrVal_1294) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select (select .cse1 |c_~#queue~0.base|) .cse2))) (< (select (store (select (store .cse1 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse3) 2147483647)))) (forall ((v_ArrVal_1293 Int) (v_ArrVal_1294 Int) (v_ArrVal_1287 Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1291 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1287)) |c_~#stored_elements~0.base| v_ArrVal_1289))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1291))) (let ((.cse7 (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse3 v_ArrVal_1293) .cse2 v_ArrVal_1294)) |c_~#stored_elements~0.base| v_ArrVal_1296))) (or (< (+ (select .cse6 .cse2) 1) v_ArrVal_1294) (< (+ (select .cse6 .cse3) 1) v_ArrVal_1293) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select (select .cse7 |c_~#queue~0.base|) .cse2))) (< .cse0 v_ArrVal_1287) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| (select .cse8 .cse2))) (< (select (store (select (store .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse3) 2147483647)))))))))) is different from false [2022-11-25 16:55:04,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 16:55:06,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 16:55:08,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 16:55:12,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 16:55:13,127 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1294 Int) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1294)) |c_~#stored_elements~0.base| v_ArrVal_1296))) (or (not (<= v_ArrVal_1294 .cse0)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select (select .cse1 |c_~#queue~0.base|) .cse2))) (< (select (store (select (store .cse1 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse3) 2147483647)))) (forall ((v_ArrVal_1293 Int) (v_ArrVal_1294 Int) (v_ArrVal_1287 Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1291 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1287)) |c_~#stored_elements~0.base| v_ArrVal_1289))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1291))) (let ((.cse7 (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse3 v_ArrVal_1293) .cse2 v_ArrVal_1294)) |c_~#stored_elements~0.base| v_ArrVal_1296))) (or (< (+ (select .cse6 .cse2) 1) v_ArrVal_1294) (< (+ (select .cse6 .cse3) 1) v_ArrVal_1293) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select (select .cse7 |c_~#queue~0.base|) .cse2))) (not (<= v_ArrVal_1287 .cse0)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| (select .cse8 .cse2))) (< (select (store (select (store .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse3) 2147483647))))))))) is different from false [2022-11-25 16:55:15,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:55:21,233 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse5 .cse4)) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1293 Int) (v_ArrVal_1294 Int) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1291 Int)) (let ((.cse1 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1291))) (let ((.cse3 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_1293) .cse4 v_ArrVal_1294)) |c_~#stored_elements~0.base| v_ArrVal_1296))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| .cse0)) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1293) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select (select .cse3 |c_~#queue~0.base|) .cse4))) (< (select (store (select (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse2) 2147483647) (< (+ (select .cse1 .cse4) 1) v_ArrVal_1294))))) (forall ((v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1297 (Array Int Int))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| .cse0)) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse2) 2147483647)))))) is different from false [2022-11-25 16:55:24,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:55:24,882 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1293 Int) (v_ArrVal_1294 Int) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1291 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse4 v_ArrVal_1291)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse3 v_ArrVal_1293) .cse2 v_ArrVal_1294)) |c_~#stored_elements~0.base| v_ArrVal_1296))) (or (< (select (store (select (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1294) (< (+ (select .cse1 .cse3) 1) v_ArrVal_1293) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select (select .cse0 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)))))))) (forall ((v_ArrVal_1298 Int) (v_ArrVal_1297 (Array Int Int))) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse4 v_ArrVal_1298) .cse3) 2147483647)))) is different from false [2022-11-25 16:55:25,100 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1298 Int) (v_ArrVal_1297 (Array Int Int))) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1298) (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647)) (forall ((v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1297 (Array Int Int))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)))) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-25 16:55:29,349 INFO L130 PetriNetUnfolder]: 2634/5623 cut-off events. [2022-11-25 16:55:29,349 INFO L131 PetriNetUnfolder]: For 99404/99450 co-relation queries the response was YES. [2022-11-25 16:55:29,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35571 conditions, 5623 events. 2634/5623 cut-off events. For 99404/99450 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 34854 event pairs, 1239 based on Foata normal form. 37/5334 useless extension candidates. Maximal degree in co-relation 29162. Up to 4011 conditions per place. [2022-11-25 16:55:29,404 INFO L137 encePairwiseOnDemand]: 460/478 looper letters, 223 selfloop transitions, 192 changer transitions 3/422 dead transitions. [2022-11-25 16:55:29,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 422 transitions, 6925 flow [2022-11-25 16:55:29,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-25 16:55:29,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2022-11-25 16:55:29,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 9266 transitions. [2022-11-25 16:55:29,423 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.38009680859791617 [2022-11-25 16:55:29,423 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 9266 transitions. [2022-11-25 16:55:29,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 9266 transitions. [2022-11-25 16:55:29,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:55:29,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 9266 transitions. [2022-11-25 16:55:29,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 181.68627450980392) internal successors, (9266), 51 states have internal predecessors, (9266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:55:29,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 478.0) internal successors, (24856), 52 states have internal predecessors, (24856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:55:29,477 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 478.0) internal successors, (24856), 52 states have internal predecessors, (24856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:55:29,478 INFO L175 Difference]: Start difference. First operand has 177 places, 210 transitions, 2084 flow. Second operand 51 states and 9266 transitions. [2022-11-25 16:55:29,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 422 transitions, 6925 flow [2022-11-25 16:55:29,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 422 transitions, 6909 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-11-25 16:55:29,564 INFO L231 Difference]: Finished difference. Result has 243 places, 322 transitions, 4500 flow [2022-11-25 16:55:29,564 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=2061, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=4500, PETRI_PLACES=243, PETRI_TRANSITIONS=322} [2022-11-25 16:55:29,565 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 184 predicate places. [2022-11-25 16:55:29,565 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 322 transitions, 4500 flow [2022-11-25 16:55:29,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 177.44444444444446) internal successors, (9582), 54 states have internal predecessors, (9582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:55:29,566 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:55:29,566 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:29,579 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 16:55:29,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-25 16:55:29,773 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:55:29,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:29,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1853171494, now seen corresponding path program 3 times [2022-11-25 16:55:29,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:29,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268433988] [2022-11-25 16:55:29,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:29,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:32,201 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:55:32,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:32,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268433988] [2022-11-25 16:55:32,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268433988] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:55:32,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944801502] [2022-11-25 16:55:32,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 16:55:32,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:55:32,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:55:32,203 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:55:32,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 16:55:32,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 16:55:32,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:55:32,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 96 conjunts are in the unsatisfiable core [2022-11-25 16:55:32,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:55:32,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:55:32,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:55:32,779 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 16:55:32,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 16:55:32,804 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 16:55:32,805 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 20 treesize of output 22 [2022-11-25 16:55:33,063 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 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 16:55:33,327 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 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-25 16:55:33,682 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 58 treesize of output 51 [2022-11-25 16:55:33,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:55:33,838 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 45 treesize of output 47 [2022-11-25 16:55:34,140 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 0 case distinctions, treesize of input 60 treesize of output 53 [2022-11-25 16:55:34,776 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 0 case distinctions, treesize of input 107 treesize of output 100 [2022-11-25 16:55:35,488 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 75 treesize of output 68 [2022-11-25 16:55:35,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:55:35,834 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 62 treesize of output 64 [2022-11-25 16:55:36,692 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 0 case distinctions, treesize of input 80 treesize of output 73 [2022-11-25 16:55:39,546 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 69 treesize of output 71 [2022-11-25 16:55:47,539 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:55:47,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:55:47,586 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1424 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647)) is different from false [2022-11-25 16:55:47,803 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int)) (let ((.cse1 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-25 16:55:47,831 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_1419 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))))) is different from false [2022-11-25 16:55:48,176 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1417 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1417) .cse3 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse1 (+ |c_~#queue~0.offset| 3204)))) (not (<= v_ArrVal_1417 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)))))))) is different from false [2022-11-25 16:55:50,412 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1415)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse4 v_ArrVal_1417) .cse1 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse2 (select .cse3 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse0 .cse4) 1) v_ArrVal_1417)))))) is different from false [2022-11-25 16:55:59,027 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1419 Int) (v_ArrVal_1414 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1413 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 Int)) (let ((.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1413)) |c_~#stored_elements~0.base| v_ArrVal_1414))) (let ((.cse3 (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1415))) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse0 (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_1417) .cse4 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1413 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse2) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse1 .cse4))) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1417))))))) is different from false [2022-11-25 16:55:59,095 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1419 Int) (v_ArrVal_1414 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1413 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_1413)) |c_~#stored_elements~0.base| v_ArrVal_1414))) (let ((.cse3 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1415))) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_1417) .cse4 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse2) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse1 .cse4))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1413) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1417)))))))) is different from false [2022-11-25 16:55:59,237 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1419 Int) (v_ArrVal_1414 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1410 Int) (v_ArrVal_1413 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1410) .cse6 v_ArrVal_1413)) |c_~#stored_elements~0.base| v_ArrVal_1414))) (let ((.cse0 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse1) 4)) v_ArrVal_1415))) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse3 (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_1417) .cse1 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse2 (select .cse3 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse2 .cse1))) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse4) 2147483647) (< (+ (select .cse0 .cse4) 1) v_ArrVal_1417) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1413) (not (<= v_ArrVal_1410 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)))))))))) is different from false [2022-11-25 16:55:59,334 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1419 Int) (v_ArrVal_1414 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1410 Int) (v_ArrVal_1413 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1410) .cse7 v_ArrVal_1413)) |c_~#stored_elements~0.base| v_ArrVal_1414))) (let ((.cse0 (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) v_ArrVal_1415))) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse3 (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_1417) .cse1 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse2 (select .cse3 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse2 .cse1))) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse4) 2147483647) (< (+ 1 (select .cse5 .cse6)) v_ArrVal_1410) (< (+ (select .cse0 .cse4) 1) v_ArrVal_1417) (< (+ (select .cse5 .cse7) 1) v_ArrVal_1413)))))))) is different from false [2022-11-25 16:55:59,434 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1408 Int) (v_ArrVal_1419 Int) (v_ArrVal_1414 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1410 Int) (v_ArrVal_1413 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 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_1408)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (+ |c_~#queue~0.offset| 3204)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_1410) .cse7 v_ArrVal_1413)) |c_~#stored_elements~0.base| v_ArrVal_1414))) (let ((.cse0 (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse5) 4)) v_ArrVal_1415))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1417) .cse5 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1417) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1410) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse4 .cse5))) (< (+ (select .cse0 .cse5) 1) v_ArrVal_1419) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse1) 2147483647) (< (+ (select .cse2 .cse7) 1) v_ArrVal_1413)))))))) is different from false [2022-11-25 16:56:10,545 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-25 16:56:10,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944801502] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:56:10,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:56:10,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 52 [2022-11-25 16:56:10,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480521021] [2022-11-25 16:56:10,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:56:10,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-25 16:56:10,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:56:10,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-25 16:56:10,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=504, Invalid=1382, Unknown=46, NotChecked=930, Total=2862 [2022-11-25 16:56:11,002 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 478 [2022-11-25 16:56:11,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 322 transitions, 4500 flow. Second operand has 54 states, 54 states have (on average 177.44444444444446) internal successors, (9582), 54 states have internal predecessors, (9582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:11,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:56:11,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 478 [2022-11-25 16:56:11,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:56:21,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 16:56:43,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:56:45,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:56:59,280 WARN L233 SmtUtils]: Spent 6.26s on a formula simplification. DAG size of input: 108 DAG size of output: 104 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 16:57:06,042 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (and (< (select .cse0 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647) (forall ((v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse2 .cse3))) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse5) 2147483647)))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1422 Int)) (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse5) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse6 .cse3)))))))) is different from false [2022-11-25 16:57:08,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:57:10,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:57:13,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:57:13,080 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse0 .cse1))) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse3) 2147483647) (not (<= v_ArrVal_1419 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))))) (forall ((v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (or (< (+ (select .cse4 .cse5) 1) v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse6 .cse1))) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse3) 2147483647))))))) is different from false [2022-11-25 16:57:16,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:57:18,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:57:47,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:57:49,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:57:56,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:57:58,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:58:13,487 WARN L233 SmtUtils]: Spent 8.31s on a formula simplification. DAG size of input: 146 DAG size of output: 138 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 16:58:13,670 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (exists ((v_ArrVal_1408 Int) (v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_112| Int) (v_ArrVal_1422 Int) (v_ArrVal_1410 Int) (v_ArrVal_1413 Int) (v_ArrVal_1415 Int) (v_ArrVal_1406 Int) (v_ArrVal_1417 Int)) (let ((.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (store (store (store (store ((as const (Array Int Int)) 0) (+ 3200 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) 0) .cse2 0) .cse1 v_ArrVal_1406) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1408))) (let ((.cse0 (store (store (store .cse3 .cse1 v_ArrVal_1410) .cse2 v_ArrVal_1413) (+ (* v_ArrVal_1413 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1415))) (and (<= v_ArrVal_1406 0) (<= v_ArrVal_1417 (+ 1 (select .cse0 .cse1))) (= (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (store (store (store .cse0 .cse1 v_ArrVal_1417) .cse2 v_ArrVal_1419) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_112| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1422)) (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_112| v_ArrVal_1419) (<= v_ArrVal_1413 (+ (select .cse3 .cse2) 1)) (<= v_ArrVal_1419 (+ (select .cse0 .cse2) 1)) (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| 0) (<= v_ArrVal_1410 (+ (select .cse3 .cse1) 1))))))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 5)) (= 5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1422 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse5) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse4 .cse6)))))) (forall ((v_ArrVal_1419 Int) (v_ArrVal_1414 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 Int)) (let ((.cse10 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1414))) (let ((.cse9 (let ((.cse11 (select .cse10 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_1415)))) (let ((.cse7 (store (store .cse10 |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_1417) .cse6 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse7 |c_~#queue~0.base| (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse5) 2147483647) (< (+ (select .cse9 .cse6) 1) v_ArrVal_1419) (< (+ (select .cse9 .cse5) 1) v_ArrVal_1417) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse8 .cse6))))))))))) is different from false [2022-11-25 16:58:16,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:58:18,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:58:31,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 16:58:33,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 16:58:35,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 16:58:37,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 16:58:39,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 16:58:39,857 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (+ (select .cse8 .cse9) 1)) (.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1419 Int) (v_ArrVal_1414 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1413 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse8 .cse9 v_ArrVal_1413)) |c_~#stored_elements~0.base| v_ArrVal_1414))) (let ((.cse3 (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1415)))) (let ((.cse0 (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_1417) .cse4 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse2) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse1 .cse4))) (< .cse5 v_ArrVal_1413) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1417))))))) (forall ((v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int)) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse8 .cse9 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse10 (select .cse11 |c_~#queue~0.base|))) (or (< .cse5 v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse10 .cse4))) (< (select (select (store (store .cse11 |c_~#queue~0.base| (store .cse10 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse2) 2147483647)))))))) is different from false [2022-11-25 16:58:53,724 WARN L233 SmtUtils]: Spent 6.30s on a formula simplification. DAG size of input: 111 DAG size of output: 103 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 16:58:55,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:58:57,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:58:59,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 16:59:01,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 16:59:01,901 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse0 .cse1))) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse3) 2147483647) (not (<= v_ArrVal_1419 .cse4)))))) (forall ((v_ArrVal_1419 Int) (v_ArrVal_1414 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1413 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 Int)) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_1413)) |c_~#stored_elements~0.base| v_ArrVal_1414))) (let ((.cse9 (let ((.cse11 (select .cse10 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1415)))) (let ((.cse7 (store (store .cse10 |c_~#queue~0.base| (store (store .cse9 .cse3 v_ArrVal_1417) .cse1 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1413 .cse4)) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse3) 2147483647) (< (+ (select .cse9 .cse1) 1) v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse8 .cse1))) (< (+ (select .cse9 .cse3) 1) v_ArrVal_1417))))))))) is different from false [2022-11-25 16:59:27,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:59:29,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:59:31,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:59:33,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:59:35,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:59:37,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:59:39,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:59:41,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:59:44,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:59:46,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:59:48,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:59:48,246 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse8 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse13 (select .cse12 .cse3))) (and (forall ((v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 Int)) (let ((.cse0 (store .cse7 .cse8 v_ArrVal_1415)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse6 v_ArrVal_1417) .cse1 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse2 .cse3))) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse5) 2147483647) (< (+ (select .cse0 .cse6) 1) v_ArrVal_1417)))))) (forall ((v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1422 Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse6) 2147483647)) (< (select .cse7 .cse6) 2147483647) (forall ((v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 Int)) (let ((.cse9 (store .cse12 (+ (* .cse13 4) |c_~#queue~0.offset|) v_ArrVal_1415))) (let ((.cse10 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_1417) .cse3 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse11 (select .cse10 |c_~#queue~0.base|))) (or (< (+ (select .cse9 .cse3) 1) v_ArrVal_1419) (< (select (select (store (store .cse10 |c_~#queue~0.base| (store .cse11 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse5) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse11 .cse3))) (< (+ (select .cse9 .cse5) 1) v_ArrVal_1417)))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1422 Int)) (or (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse12 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse5) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| .cse13))))))) is different from false [2022-11-25 16:59:50,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:59:52,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:59:54,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:59:56,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:59:58,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:00,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:02,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:04,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:04,514 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1417 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse4 v_ArrVal_1417) .cse3 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse1 (+ |c_~#queue~0.offset| 3204)))) (< (+ 1 (select .cse2 .cse4)) v_ArrVal_1417)))))) (forall ((v_ArrVal_1424 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse4) 2147483647)))) is different from false [2022-11-25 17:00:06,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:08,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:10,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:10,787 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1415)) (.cse6 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse6 v_ArrVal_1417) .cse1 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse2 .cse3))) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse5) 2147483647) (< (+ (select .cse0 .cse6) 1) v_ArrVal_1417)))))) (forall ((v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 Int)) (let ((.cse7 (let ((.cse10 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1415)))) (let ((.cse8 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse5 v_ArrVal_1417) .cse3 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (or (< (+ (select .cse7 .cse3) 1) v_ArrVal_1419) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse5) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse9 .cse3))) (< (+ (select .cse7 .cse5) 1) v_ArrVal_1417)))))))) is different from false [2022-11-25 17:00:12,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:14,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:17,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:19,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:21,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:23,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:25,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:27,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:29,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:29,516 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ (select .cse5 .cse7) 1)) (.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse6 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1417 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1417) .cse7 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse2) 2147483647) (< .cse3 v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse1 .cse4))) (< (+ 1 (select .cse5 .cse6)) v_ArrVal_1417))))) (forall ((v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1417 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1417) .cse7 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse8 |c_~#queue~0.base| (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse2) 2147483647) (< .cse3 v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse9 .cse4))) (not (<= v_ArrVal_1417 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)))))))))) is different from false [2022-11-25 17:00:30,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:32,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:34,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:36,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:38,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:40,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:42,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:45,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:47,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:49,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:51,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:53,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:55,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:57,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:59,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:01,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:04,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:06,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:09,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:11,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:13,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:15,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:17,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:19,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:21,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:23,607 INFO L130 PetriNetUnfolder]: 3562/7759 cut-off events. [2022-11-25 17:01:23,608 INFO L131 PetriNetUnfolder]: For 464658/464748 co-relation queries the response was YES. [2022-11-25 17:01:23,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73918 conditions, 7759 events. 3562/7759 cut-off events. For 464658/464748 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 53711 event pairs, 1307 based on Foata normal form. 28/7459 useless extension candidates. Maximal degree in co-relation 73124. Up to 4546 conditions per place. [2022-11-25 17:01:23,708 INFO L137 encePairwiseOnDemand]: 460/478 looper letters, 338 selfloop transitions, 340 changer transitions 6/688 dead transitions. [2022-11-25 17:01:23,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 688 transitions, 15247 flow [2022-11-25 17:01:23,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-25 17:01:23,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2022-11-25 17:01:23,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 9479 transitions. [2022-11-25 17:01:23,726 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3813566140971999 [2022-11-25 17:01:23,726 INFO L72 ComplementDD]: Start complementDD. Operand 52 states and 9479 transitions. [2022-11-25 17:01:23,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 9479 transitions. [2022-11-25 17:01:23,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:01:23,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 52 states and 9479 transitions. [2022-11-25 17:01:23,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 53 states, 52 states have (on average 182.28846153846155) internal successors, (9479), 52 states have internal predecessors, (9479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:23,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 53 states, 53 states have (on average 478.0) internal successors, (25334), 53 states have internal predecessors, (25334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:23,777 INFO L81 ComplementDD]: Finished complementDD. Result has 53 states, 53 states have (on average 478.0) internal successors, (25334), 53 states have internal predecessors, (25334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:23,777 INFO L175 Difference]: Start difference. First operand has 243 places, 322 transitions, 4500 flow. Second operand 52 states and 9479 transitions. [2022-11-25 17:01:23,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 688 transitions, 15247 flow [2022-11-25 17:01:24,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 688 transitions, 12967 flow, removed 1089 selfloop flow, removed 13 redundant places. [2022-11-25 17:01:24,239 INFO L231 Difference]: Finished difference. Result has 307 places, 548 transitions, 8605 flow [2022-11-25 17:01:24,240 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=3323, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=8605, PETRI_PLACES=307, PETRI_TRANSITIONS=548} [2022-11-25 17:01:24,240 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 248 predicate places. [2022-11-25 17:01:24,241 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 548 transitions, 8605 flow [2022-11-25 17:01:24,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 177.44444444444446) internal successors, (9582), 54 states have internal predecessors, (9582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:24,242 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:01:24,242 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:01:24,249 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 17:01:24,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-25 17:01:24,443 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 17:01:24,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:01:24,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1613745489, now seen corresponding path program 1 times [2022-11-25 17:01:24,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:01:24,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842695720] [2022-11-25 17:01:24,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:01:24,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:01:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:01:26,832 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:01:26,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:01:26,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842695720] [2022-11-25 17:01:26,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842695720] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:01:26,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169295588] [2022-11-25 17:01:26,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:01:26,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:01:26,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:01:26,839 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:01:26,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d0afaf4-e9e9-4d42-aa57-31853241b9eb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 17:01:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:01:27,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 98 conjunts are in the unsatisfiable core [2022-11-25 17:01:27,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:01:27,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:01:27,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:01:27,134 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 17:01:27,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 17:01:27,161 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 17:01:27,162 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 20 treesize of output 22 [2022-11-25 17:01:27,356 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 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 17:01:27,575 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 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-25 17:01:27,846 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 58 treesize of output 51 [2022-11-25 17:01:27,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:01:27,983 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 45 treesize of output 47 [2022-11-25 17:01:28,241 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 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-25 17:01:28,765 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 0 case distinctions, treesize of input 70 treesize of output 63 [2022-11-25 17:01:29,439 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 75 treesize of output 68 [2022-11-25 17:01:29,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:01:29,736 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 62 treesize of output 64 [2022-11-25 17:01:33,103 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 0 case distinctions, treesize of input 80 treesize of output 73 [2022-11-25 17:01:43,883 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 69 treesize of output 71 [2022-11-25 17:01:52,527 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:01:52,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:01:52,570 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1550 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1550) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647)) is different from false [2022-11-25 17:01:52,896 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_120| Int) (v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1550 (Array Int Int)) (v_ArrVal_1546 Int) (v_ArrVal_1549 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1546)) |c_~#stored_elements~0.base| v_ArrVal_1547))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_120| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_120| 4) |c_~#queue~0.offset|) v_ArrVal_1549)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1550) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_1546 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))))) is different from false [2022-11-25 17:01:53,108 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_120| Int) (v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1543 Int) (v_ArrVal_1550 (Array Int Int)) (v_ArrVal_1546 Int) (v_ArrVal_1549 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1543) .cse3 v_ArrVal_1546)) |c_~#stored_elements~0.base| v_ArrVal_1547))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_120| 4) |c_~#queue~0.offset|) v_ArrVal_1549)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1550) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_1543 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1546) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_120| (select .cse1 (+ |c_~#queue~0.offset| 3204))))))))) is different from false [2022-11-25 17:01:53,149 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_120| Int) (v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1543 Int) (v_ArrVal_1550 (Array Int Int)) (v_ArrVal_1546 Int) (v_ArrVal_1549 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_1543) .cse4 v_ArrVal_1546)) |c_~#stored_elements~0.base| v_ArrVal_1547))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_120| 4) |c_~#queue~0.offset|) v_ArrVal_1549)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1550) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ 1 (select .cse2 .cse3)) v_ArrVal_1543) (< (+ (select .cse2 .cse4) 1) v_ArrVal_1546) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_120| (select .cse1 (+ |c_~#queue~0.offset| 3204))))))))) is different from false [2022-11-25 17:01:53,194 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_120| Int) (v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1541 Int) (v_ArrVal_1543 Int) (v_ArrVal_1550 (Array Int Int)) (v_ArrVal_1546 Int) (v_ArrVal_1549 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1541)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1543) .cse4 v_ArrVal_1546)) |c_~#stored_elements~0.base| v_ArrVal_1547))) (let ((.cse2 (select .cse3 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1543) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_120| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_120| 4) |c_~#queue~0.offset|) v_ArrVal_1549)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1550) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse0 .cse4) 1) v_ArrVal_1546)))))) is different from false [2022-11-25 17:02:01,971 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_120| Int) (v_ArrVal_1539 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_121| Int) (v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1541 Int) (v_ArrVal_1543 Int) (v_ArrVal_1540 (Array Int Int)) (v_ArrVal_1550 (Array Int Int)) (v_ArrVal_1546 Int) (v_ArrVal_1549 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1539)) |c_~#stored_elements~0.base| v_ArrVal_1540))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) v_ArrVal_1541)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1543) .cse1 v_ArrVal_1546)) |c_~#stored_elements~0.base| v_ArrVal_1547))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1546) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_120| (select .cse2 .cse1))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1543) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_120| 4) |c_~#queue~0.offset|) v_ArrVal_1549)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1550) |c_~#queue~0.base|) .cse3) 2147483647) (not (<= v_ArrVal_1539 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_121| (select .cse5 .cse1)))))))))) is different from false [2022-11-25 17:02:02,037 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_120| Int) (v_ArrVal_1539 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_121| Int) (v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1541 Int) (v_ArrVal_1543 Int) (v_ArrVal_1540 (Array Int Int)) (v_ArrVal_1550 (Array Int Int)) (v_ArrVal_1546 Int) (v_ArrVal_1549 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1539)) |c_~#stored_elements~0.base| v_ArrVal_1540))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) v_ArrVal_1541)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_1543) .cse1 v_ArrVal_1546)) |c_~#stored_elements~0.base| v_ArrVal_1547))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1546) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_120| (select .cse2 .cse1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1539) (< (+ (select .cse0 .cse5) 1) v_ArrVal_1543) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_120| 4) |c_~#queue~0.offset|) v_ArrVal_1549)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1550) |c_~#queue~0.base|) .cse5) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_121| (select .cse7 .cse1))))))))))) is different from false [2022-11-25 17:02:02,205 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_120| Int) (v_ArrVal_1539 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_121| Int) (v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1541 Int) (v_ArrVal_1543 Int) (v_ArrVal_1540 (Array Int Int)) (v_ArrVal_1550 (Array Int Int)) (v_ArrVal_1546 Int) (v_ArrVal_1549 Int) (v_ArrVal_1537 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1537) .cse4 v_ArrVal_1539)) |c_~#stored_elements~0.base| v_ArrVal_1540))) (let ((.cse0 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) v_ArrVal_1541)) (.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_1543) .cse1 v_ArrVal_1546)) |c_~#stored_elements~0.base| v_ArrVal_1547))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_121| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_120| (select .cse2 .cse1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1539) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1543) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_120| 4) |c_~#queue~0.offset|) v_ArrVal_1549)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1550) |c_~#queue~0.base|) .cse6) 2147483647) (not (<= v_ArrVal_1537 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1546))))))))) is different from false