./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 2329fc70 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_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longest.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8 --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-2329fc7 [2022-12-13 20:32:16,297 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 20:32:16,299 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 20:32:16,318 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 20:32:16,318 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 20:32:16,319 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 20:32:16,320 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 20:32:16,322 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 20:32:16,324 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 20:32:16,325 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 20:32:16,326 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 20:32:16,327 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 20:32:16,327 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 20:32:16,328 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 20:32:16,329 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 20:32:16,330 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 20:32:16,331 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 20:32:16,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 20:32:16,334 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 20:32:16,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 20:32:16,337 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 20:32:16,338 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 20:32:16,340 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 20:32:16,340 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 20:32:16,345 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 20:32:16,345 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 20:32:16,346 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 20:32:16,347 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 20:32:16,347 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 20:32:16,348 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 20:32:16,348 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 20:32:16,348 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 20:32:16,349 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 20:32:16,349 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 20:32:16,350 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 20:32:16,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 20:32:16,351 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 20:32:16,351 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 20:32:16,352 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 20:32:16,352 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 20:32:16,353 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 20:32:16,353 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-12-13 20:32:16,373 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 20:32:16,374 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 20:32:16,374 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 20:32:16,374 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 20:32:16,375 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 20:32:16,375 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 20:32:16,376 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 20:32:16,376 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 20:32:16,376 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 20:32:16,376 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 20:32:16,376 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 20:32:16,377 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 20:32:16,377 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 20:32:16,377 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 20:32:16,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 20:32:16,377 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 20:32:16,378 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 20:32:16,378 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 20:32:16,378 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 20:32:16,378 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 20:32:16,378 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 20:32:16,378 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 20:32:16,379 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 20:32:16,379 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 20:32:16,379 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 20:32:16,379 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 20:32:16,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:32:16,380 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 20:32:16,380 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 20:32:16,380 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 20:32:16,380 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 20:32:16,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 20:32:16,380 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 20:32:16,381 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 20:32:16,381 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 20:32:16,381 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 20:32:16,381 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 20:32:16,381 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_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/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_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8 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-12-13 20:32:16,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 20:32:16,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 20:32:16,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 20:32:16,565 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 20:32:16,565 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 20:32:16,567 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread/queue_ok_longest.i [2022-12-13 20:32:19,193 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 20:32:19,377 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 20:32:19,378 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/sv-benchmarks/c/pthread/queue_ok_longest.i [2022-12-13 20:32:19,391 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/data/4c4a0886b/f0d8396347534f06bf068d3eb5407dbb/FLAG47d9197d3 [2022-12-13 20:32:19,402 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/data/4c4a0886b/f0d8396347534f06bf068d3eb5407dbb [2022-12-13 20:32:19,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 20:32:19,405 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 20:32:19,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 20:32:19,406 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 20:32:19,409 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 20:32:19,410 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:32:19" (1/1) ... [2022-12-13 20:32:19,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f58d218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:19, skipping insertion in model container [2022-12-13 20:32:19,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:32:19" (1/1) ... [2022-12-13 20:32:19,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 20:32:19,453 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 20:32:19,786 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_f88f85f9-e6dd-4529-8a81-151f23b0b107/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-12-13 20:32:19,789 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_f88f85f9-e6dd-4529-8a81-151f23b0b107/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-12-13 20:32:19,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:32:19,805 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 20:32:19,851 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_f88f85f9-e6dd-4529-8a81-151f23b0b107/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-12-13 20:32:19,854 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_f88f85f9-e6dd-4529-8a81-151f23b0b107/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-12-13 20:32:19,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:32:19,916 INFO L208 MainTranslator]: Completed translation [2022-12-13 20:32:19,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:19 WrapperNode [2022-12-13 20:32:19,917 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 20:32:19,918 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 20:32:19,918 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 20:32:19,918 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 20:32:19,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:19" (1/1) ... [2022-12-13 20:32:19,937 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:19" (1/1) ... [2022-12-13 20:32:19,956 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 214 [2022-12-13 20:32:19,956 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 20:32:19,957 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 20:32:19,957 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 20:32:19,957 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 20:32:19,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:19" (1/1) ... [2022-12-13 20:32:19,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:19" (1/1) ... [2022-12-13 20:32:19,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:19" (1/1) ... [2022-12-13 20:32:19,971 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:19" (1/1) ... [2022-12-13 20:32:19,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:19" (1/1) ... [2022-12-13 20:32:19,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:19" (1/1) ... [2022-12-13 20:32:19,987 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:19" (1/1) ... [2022-12-13 20:32:19,989 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:19" (1/1) ... [2022-12-13 20:32:19,992 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 20:32:19,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 20:32:19,993 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 20:32:19,993 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 20:32:19,994 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:19" (1/1) ... [2022-12-13 20:32:19,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:32:20,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:32:20,017 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 20:32:20,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 20:32:20,045 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-13 20:32:20,045 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-13 20:32:20,045 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-13 20:32:20,046 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-13 20:32:20,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 20:32:20,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 20:32:20,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 20:32:20,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 20:32:20,046 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 20:32:20,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 20:32:20,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 20:32:20,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 20:32:20,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 20:32:20,047 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 20:32:20,164 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 20:32:20,166 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 20:32:20,404 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 20:32:20,411 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 20:32:20,411 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 20:32:20,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:32:20 BoogieIcfgContainer [2022-12-13 20:32:20,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 20:32:20,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 20:32:20,414 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 20:32:20,416 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 20:32:20,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:32:19" (1/3) ... [2022-12-13 20:32:20,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1b325d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:32:20, skipping insertion in model container [2022-12-13 20:32:20,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:19" (2/3) ... [2022-12-13 20:32:20,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1b325d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:32:20, skipping insertion in model container [2022-12-13 20:32:20,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:32:20" (3/3) ... [2022-12-13 20:32:20,418 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2022-12-13 20:32:20,424 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 20:32:20,432 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 20:32:20,432 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-12-13 20:32:20,432 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 20:32:20,498 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 20:32:20,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 251 transitions, 518 flow [2022-12-13 20:32:20,612 INFO L130 PetriNetUnfolder]: 13/249 cut-off events. [2022-12-13 20:32:20,612 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 20:32:20,619 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 462 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-12-13 20:32:20,619 INFO L82 GeneralOperation]: Start removeDead. Operand has 245 places, 251 transitions, 518 flow [2022-12-13 20:32:20,625 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 239 transitions, 487 flow [2022-12-13 20:32:20,628 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 20:32:20,636 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 233 places, 239 transitions, 487 flow [2022-12-13 20:32:20,638 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 233 places, 239 transitions, 487 flow [2022-12-13 20:32:20,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 239 transitions, 487 flow [2022-12-13 20:32:20,689 INFO L130 PetriNetUnfolder]: 13/239 cut-off events. [2022-12-13 20:32:20,689 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 20:32:20,691 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 377 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-12-13 20:32:20,698 INFO L119 LiptonReduction]: Number of co-enabled transitions 14376 [2022-12-13 20:32:28,931 INFO L134 LiptonReduction]: Checked pairs total: 29129 [2022-12-13 20:32:28,931 INFO L136 LiptonReduction]: Total number of compositions: 226 [2022-12-13 20:32:28,941 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 20:32:28,945 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;@6ca00a71, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 20:32:28,946 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-12-13 20:32:28,949 INFO L130 PetriNetUnfolder]: 1/18 cut-off events. [2022-12-13 20:32:28,949 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 20:32:28,949 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:32:28,949 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:32:28,950 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 20:32:28,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:28,953 INFO L85 PathProgramCache]: Analyzing trace with hash 336045671, now seen corresponding path program 1 times [2022-12-13 20:32:28,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:28,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39482236] [2022-12-13 20:32:28,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:28,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:29,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:29,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:29,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39482236] [2022-12-13 20:32:29,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39482236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:32:29,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:32:29,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:32:29,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642445471] [2022-12-13 20:32:29,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:32:29,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:32:29,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:29,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:32:29,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:32:29,818 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 477 [2022-12-13 20:32:29,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 123 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-12-13 20:32:29,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:32:29,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 477 [2022-12-13 20:32:29,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:32:30,159 INFO L130 PetriNetUnfolder]: 1558/2568 cut-off events. [2022-12-13 20:32:30,159 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2022-12-13 20:32:30,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5148 conditions, 2568 events. 1558/2568 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12807 event pairs, 1122 based on Foata normal form. 0/1773 useless extension candidates. Maximal degree in co-relation 4932. Up to 2503 conditions per place. [2022-12-13 20:32:30,170 INFO L137 encePairwiseOnDemand]: 470/477 looper letters, 57 selfloop transitions, 7 changer transitions 0/69 dead transitions. [2022-12-13 20:32:30,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 69 transitions, 275 flow [2022-12-13 20:32:30,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:32:30,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:32:30,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1191 transitions. [2022-12-13 20:32:30,184 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49937106918238994 [2022-12-13 20:32:30,184 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1191 transitions. [2022-12-13 20:32:30,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1191 transitions. [2022-12-13 20:32:30,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:32:30,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1191 transitions. [2022-12-13 20:32:30,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 238.2) internal successors, (1191), 5 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:30,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 477.0) internal successors, (2862), 6 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:30,201 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 477.0) internal successors, (2862), 6 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:30,203 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 123 flow. Second operand 5 states and 1191 transitions. [2022-12-13 20:32:30,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 69 transitions, 275 flow [2022-12-13 20:32:30,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 69 transitions, 270 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 20:32:30,208 INFO L231 Difference]: Finished difference. Result has 61 places, 63 transitions, 165 flow [2022-12-13 20:32:30,209 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=165, PETRI_PLACES=61, PETRI_TRANSITIONS=63} [2022-12-13 20:32:30,211 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 4 predicate places. [2022-12-13 20:32:30,212 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 165 flow [2022-12-13 20:32:30,212 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-12-13 20:32:30,212 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:32:30,212 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:32:30,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 20:32:30,213 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 20:32:30,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:30,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1827228268, now seen corresponding path program 1 times [2022-12-13 20:32:30,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:30,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246173893] [2022-12-13 20:32:30,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:30,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:30,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:30,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:30,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246173893] [2022-12-13 20:32:30,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246173893] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:32:30,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:32:30,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:32:30,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617681972] [2022-12-13 20:32:30,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:32:30,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:32:30,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:30,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:32:30,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:32:31,548 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 477 [2022-12-13 20:32:31,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 63 transitions, 165 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-12-13 20:32:31,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:32:31,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 477 [2022-12-13 20:32:31,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:32:32,339 INFO L130 PetriNetUnfolder]: 2031/3408 cut-off events. [2022-12-13 20:32:32,339 INFO L131 PetriNetUnfolder]: For 161/161 co-relation queries the response was YES. [2022-12-13 20:32:32,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7146 conditions, 3408 events. 2031/3408 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 18777 event pairs, 417 based on Foata normal form. 31/2595 useless extension candidates. Maximal degree in co-relation 6048. Up to 2497 conditions per place. [2022-12-13 20:32:32,350 INFO L137 encePairwiseOnDemand]: 469/477 looper letters, 111 selfloop transitions, 13 changer transitions 0/129 dead transitions. [2022-12-13 20:32:32,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 129 transitions, 560 flow [2022-12-13 20:32:32,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:32:32,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:32:32,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1233 transitions. [2022-12-13 20:32:32,353 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5169811320754717 [2022-12-13 20:32:32,353 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1233 transitions. [2022-12-13 20:32:32,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1233 transitions. [2022-12-13 20:32:32,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:32:32,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1233 transitions. [2022-12-13 20:32:32,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 246.6) internal successors, (1233), 5 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:32,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 477.0) internal successors, (2862), 6 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:32,359 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 477.0) internal successors, (2862), 6 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:32,359 INFO L175 Difference]: Start difference. First operand has 61 places, 63 transitions, 165 flow. Second operand 5 states and 1233 transitions. [2022-12-13 20:32:32,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 129 transitions, 560 flow [2022-12-13 20:32:32,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 129 transitions, 560 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 20:32:32,365 INFO L231 Difference]: Finished difference. Result has 67 places, 70 transitions, 237 flow [2022-12-13 20:32:32,365 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=67, PETRI_TRANSITIONS=70} [2022-12-13 20:32:32,365 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places. [2022-12-13 20:32:32,365 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 237 flow [2022-12-13 20:32:32,366 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-12-13 20:32:32,366 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:32:32,366 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:32:32,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 20:32:32,366 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 20:32:32,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:32,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1827483088, now seen corresponding path program 2 times [2022-12-13 20:32:32,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:32,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958439493] [2022-12-13 20:32:32,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:32,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:32,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:32,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:32,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958439493] [2022-12-13 20:32:32,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958439493] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:32:32,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:32:32,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:32:32,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067196626] [2022-12-13 20:32:32,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:32:32,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:32:32,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:32,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:32:32,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:32:33,485 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 477 [2022-12-13 20:32:33,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 70 transitions, 237 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-12-13 20:32:33,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:32:33,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 477 [2022-12-13 20:32:33,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:32:34,146 INFO L130 PetriNetUnfolder]: 2127/3566 cut-off events. [2022-12-13 20:32:34,146 INFO L131 PetriNetUnfolder]: For 671/671 co-relation queries the response was YES. [2022-12-13 20:32:34,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8075 conditions, 3566 events. 2127/3566 cut-off events. For 671/671 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 19804 event pairs, 417 based on Foata normal form. 31/2729 useless extension candidates. Maximal degree in co-relation 7239. Up to 2499 conditions per place. [2022-12-13 20:32:34,159 INFO L137 encePairwiseOnDemand]: 470/477 looper letters, 113 selfloop transitions, 14 changer transitions 0/132 dead transitions. [2022-12-13 20:32:34,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 132 transitions, 631 flow [2022-12-13 20:32:34,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:32:34,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:32:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1237 transitions. [2022-12-13 20:32:34,162 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5186582809224318 [2022-12-13 20:32:34,162 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1237 transitions. [2022-12-13 20:32:34,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1237 transitions. [2022-12-13 20:32:34,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:32:34,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1237 transitions. [2022-12-13 20:32:34,164 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-12-13 20:32:34,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 477.0) internal successors, (2862), 6 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:34,168 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 477.0) internal successors, (2862), 6 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:34,168 INFO L175 Difference]: Start difference. First operand has 67 places, 70 transitions, 237 flow. Second operand 5 states and 1237 transitions. [2022-12-13 20:32:34,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 132 transitions, 631 flow [2022-12-13 20:32:34,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 132 transitions, 617 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-12-13 20:32:34,175 INFO L231 Difference]: Finished difference. Result has 72 places, 73 transitions, 282 flow [2022-12-13 20:32:34,175 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=72, PETRI_TRANSITIONS=73} [2022-12-13 20:32:34,175 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 15 predicate places. [2022-12-13 20:32:34,176 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 73 transitions, 282 flow [2022-12-13 20:32:34,176 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-12-13 20:32:34,176 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:32:34,176 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:32:34,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 20:32:34,176 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 20:32:34,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:34,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1139052889, now seen corresponding path program 1 times [2022-12-13 20:32:34,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:34,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798669762] [2022-12-13 20:32:34,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:34,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:34,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:34,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:34,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798669762] [2022-12-13 20:32:34,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798669762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:32:34,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:32:34,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:32:34,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520702299] [2022-12-13 20:32:34,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:32:34,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:32:34,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:34,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:32:34,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:32:34,225 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 477 [2022-12-13 20:32:34,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 73 transitions, 282 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-12-13 20:32:34,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:32:34,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 477 [2022-12-13 20:32:34,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:32:34,768 INFO L130 PetriNetUnfolder]: 3672/5997 cut-off events. [2022-12-13 20:32:34,768 INFO L131 PetriNetUnfolder]: For 2387/2387 co-relation queries the response was YES. [2022-12-13 20:32:34,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13895 conditions, 5997 events. 3672/5997 cut-off events. For 2387/2387 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 35446 event pairs, 1819 based on Foata normal form. 0/4497 useless extension candidates. Maximal degree in co-relation 12559. Up to 3645 conditions per place. [2022-12-13 20:32:34,792 INFO L137 encePairwiseOnDemand]: 470/477 looper letters, 146 selfloop transitions, 4 changer transitions 0/154 dead transitions. [2022-12-13 20:32:34,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 154 transitions, 875 flow [2022-12-13 20:32:34,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:32:34,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 20:32:34,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1050 transitions. [2022-12-13 20:32:34,797 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.550314465408805 [2022-12-13 20:32:34,797 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1050 transitions. [2022-12-13 20:32:34,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1050 transitions. [2022-12-13 20:32:34,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:32:34,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1050 transitions. [2022-12-13 20:32:34,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 262.5) internal successors, (1050), 4 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:34,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 477.0) internal successors, (2385), 5 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:34,803 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 477.0) internal successors, (2385), 5 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:34,803 INFO L175 Difference]: Start difference. First operand has 72 places, 73 transitions, 282 flow. Second operand 4 states and 1050 transitions. [2022-12-13 20:32:34,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 154 transitions, 875 flow [2022-12-13 20:32:34,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 154 transitions, 839 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-13 20:32:34,809 INFO L231 Difference]: Finished difference. Result has 76 places, 76 transitions, 299 flow [2022-12-13 20:32:34,810 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=299, PETRI_PLACES=76, PETRI_TRANSITIONS=76} [2022-12-13 20:32:34,810 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places. [2022-12-13 20:32:34,810 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 76 transitions, 299 flow [2022-12-13 20:32:34,811 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-12-13 20:32:34,811 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:32:34,811 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:32:34,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 20:32:34,811 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 20:32:34,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:34,812 INFO L85 PathProgramCache]: Analyzing trace with hash -435859728, now seen corresponding path program 1 times [2022-12-13 20:32:34,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:34,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414077749] [2022-12-13 20:32:34,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:34,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:35,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:35,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:35,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414077749] [2022-12-13 20:32:35,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414077749] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:32:35,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:32:35,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:32:35,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237519882] [2022-12-13 20:32:35,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:32:35,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:32:35,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:35,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:32:35,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:32:35,170 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 477 [2022-12-13 20:32:35,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 76 transitions, 299 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-12-13 20:32:35,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:32:35,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 477 [2022-12-13 20:32:35,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:32:35,636 INFO L130 PetriNetUnfolder]: 3559/5901 cut-off events. [2022-12-13 20:32:35,636 INFO L131 PetriNetUnfolder]: For 2479/2489 co-relation queries the response was YES. [2022-12-13 20:32:35,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13973 conditions, 5901 events. 3559/5901 cut-off events. For 2479/2489 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 35146 event pairs, 2417 based on Foata normal form. 0/4747 useless extension candidates. Maximal degree in co-relation 9416. Up to 5718 conditions per place. [2022-12-13 20:32:35,657 INFO L137 encePairwiseOnDemand]: 469/477 looper letters, 73 selfloop transitions, 8 changer transitions 0/86 dead transitions. [2022-12-13 20:32:35,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 86 transitions, 483 flow [2022-12-13 20:32:35,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:32:35,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:32:35,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1195 transitions. [2022-12-13 20:32:35,663 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5010482180293501 [2022-12-13 20:32:35,663 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1195 transitions. [2022-12-13 20:32:35,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1195 transitions. [2022-12-13 20:32:35,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:32:35,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1195 transitions. [2022-12-13 20:32:35,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:35,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 477.0) internal successors, (2862), 6 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:35,669 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 477.0) internal successors, (2862), 6 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:35,669 INFO L175 Difference]: Start difference. First operand has 76 places, 76 transitions, 299 flow. Second operand 5 states and 1195 transitions. [2022-12-13 20:32:35,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 86 transitions, 483 flow [2022-12-13 20:32:35,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 86 transitions, 481 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 20:32:35,675 INFO L231 Difference]: Finished difference. Result has 80 places, 78 transitions, 333 flow [2022-12-13 20:32:35,675 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=333, PETRI_PLACES=80, PETRI_TRANSITIONS=78} [2022-12-13 20:32:35,675 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 23 predicate places. [2022-12-13 20:32:35,675 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 78 transitions, 333 flow [2022-12-13 20:32:35,676 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-12-13 20:32:35,676 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:32:35,676 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:32:35,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 20:32:35,676 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 20:32:35,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:35,677 INFO L85 PathProgramCache]: Analyzing trace with hash 538174762, now seen corresponding path program 1 times [2022-12-13 20:32:35,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:35,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672473394] [2022-12-13 20:32:35,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:35,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:35,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:35,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:35,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672473394] [2022-12-13 20:32:35,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672473394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:32:35,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:32:35,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:32:35,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484311192] [2022-12-13 20:32:35,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:32:35,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:32:35,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:35,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:32:35,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:32:36,070 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 477 [2022-12-13 20:32:36,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 78 transitions, 333 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-12-13 20:32:36,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:32:36,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 477 [2022-12-13 20:32:36,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:32:36,639 INFO L130 PetriNetUnfolder]: 3787/6262 cut-off events. [2022-12-13 20:32:36,639 INFO L131 PetriNetUnfolder]: For 2024/2054 co-relation queries the response was YES. [2022-12-13 20:32:36,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15111 conditions, 6262 events. 3787/6262 cut-off events. For 2024/2054 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 37887 event pairs, 692 based on Foata normal form. 98/5332 useless extension candidates. Maximal degree in co-relation 12067. Up to 4505 conditions per place. [2022-12-13 20:32:36,667 INFO L137 encePairwiseOnDemand]: 468/477 looper letters, 126 selfloop transitions, 16 changer transitions 0/147 dead transitions. [2022-12-13 20:32:36,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 147 transitions, 816 flow [2022-12-13 20:32:36,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:32:36,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:32:36,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1237 transitions. [2022-12-13 20:32:36,671 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5186582809224318 [2022-12-13 20:32:36,671 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1237 transitions. [2022-12-13 20:32:36,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1237 transitions. [2022-12-13 20:32:36,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:32:36,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1237 transitions. [2022-12-13 20:32:36,676 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-12-13 20:32:36,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 477.0) internal successors, (2862), 6 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:36,681 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 477.0) internal successors, (2862), 6 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:36,681 INFO L175 Difference]: Start difference. First operand has 80 places, 78 transitions, 333 flow. Second operand 5 states and 1237 transitions. [2022-12-13 20:32:36,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 147 transitions, 816 flow [2022-12-13 20:32:36,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 147 transitions, 804 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 20:32:36,709 INFO L231 Difference]: Finished difference. Result has 82 places, 80 transitions, 381 flow [2022-12-13 20:32:36,709 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=381, PETRI_PLACES=82, PETRI_TRANSITIONS=80} [2022-12-13 20:32:36,710 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 25 predicate places. [2022-12-13 20:32:36,710 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 80 transitions, 381 flow [2022-12-13 20:32:36,711 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-12-13 20:32:36,711 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:32:36,711 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:32:36,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 20:32:36,711 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 20:32:36,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:36,712 INFO L85 PathProgramCache]: Analyzing trace with hash -586638581, now seen corresponding path program 1 times [2022-12-13 20:32:36,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:36,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291126579] [2022-12-13 20:32:36,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:36,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:36,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:36,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:36,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291126579] [2022-12-13 20:32:36,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291126579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:32:36,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:32:36,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:32:36,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412459586] [2022-12-13 20:32:36,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:32:36,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:32:36,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:36,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:32:36,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:32:36,778 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 477 [2022-12-13 20:32:36,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 80 transitions, 381 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-12-13 20:32:36,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:32:36,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 477 [2022-12-13 20:32:36,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:32:36,997 INFO L130 PetriNetUnfolder]: 826/1584 cut-off events. [2022-12-13 20:32:36,997 INFO L131 PetriNetUnfolder]: For 702/702 co-relation queries the response was YES. [2022-12-13 20:32:36,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3828 conditions, 1584 events. 826/1584 cut-off events. For 702/702 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 8573 event pairs, 547 based on Foata normal form. 64/1495 useless extension candidates. Maximal degree in co-relation 2805. Up to 789 conditions per place. [2022-12-13 20:32:37,003 INFO L137 encePairwiseOnDemand]: 473/477 looper letters, 72 selfloop transitions, 2 changer transitions 8/85 dead transitions. [2022-12-13 20:32:37,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 85 transitions, 533 flow [2022-12-13 20:32:37,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:32:37,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:32:37,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 768 transitions. [2022-12-13 20:32:37,005 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5366876310272537 [2022-12-13 20:32:37,005 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 768 transitions. [2022-12-13 20:32:37,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 768 transitions. [2022-12-13 20:32:37,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:32:37,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 768 transitions. [2022-12-13 20:32:37,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:37,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 477.0) internal successors, (1908), 4 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:37,010 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 477.0) internal successors, (1908), 4 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:37,010 INFO L175 Difference]: Start difference. First operand has 82 places, 80 transitions, 381 flow. Second operand 3 states and 768 transitions. [2022-12-13 20:32:37,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 85 transitions, 533 flow [2022-12-13 20:32:37,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 85 transitions, 511 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 20:32:37,015 INFO L231 Difference]: Finished difference. Result has 82 places, 72 transitions, 319 flow [2022-12-13 20:32:37,015 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=319, PETRI_PLACES=82, PETRI_TRANSITIONS=72} [2022-12-13 20:32:37,015 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 25 predicate places. [2022-12-13 20:32:37,016 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 72 transitions, 319 flow [2022-12-13 20:32:37,016 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-12-13 20:32:37,016 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:32:37,016 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:32:37,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 20:32:37,016 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 20:32:37,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:37,017 INFO L85 PathProgramCache]: Analyzing trace with hash -460417210, now seen corresponding path program 2 times [2022-12-13 20:32:37,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:37,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683513460] [2022-12-13 20:32:37,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:37,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:37,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:37,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:37,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683513460] [2022-12-13 20:32:37,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683513460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:32:37,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:32:37,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:32:37,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476940804] [2022-12-13 20:32:37,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:32:37,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:32:37,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:37,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:32:37,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:32:38,104 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 477 [2022-12-13 20:32:38,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 72 transitions, 319 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-12-13 20:32:38,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:32:38,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 477 [2022-12-13 20:32:38,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:32:38,565 INFO L130 PetriNetUnfolder]: 785/1498 cut-off events. [2022-12-13 20:32:38,565 INFO L131 PetriNetUnfolder]: For 474/476 co-relation queries the response was YES. [2022-12-13 20:32:38,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3628 conditions, 1498 events. 785/1498 cut-off events. For 474/476 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 8086 event pairs, 206 based on Foata normal form. 18/1376 useless extension candidates. Maximal degree in co-relation 3021. Up to 856 conditions per place. [2022-12-13 20:32:38,568 INFO L137 encePairwiseOnDemand]: 469/477 looper letters, 94 selfloop transitions, 10 changer transitions 0/108 dead transitions. [2022-12-13 20:32:38,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 108 transitions, 626 flow [2022-12-13 20:32:38,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:32:38,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:32:38,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1209 transitions. [2022-12-13 20:32:38,571 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5069182389937107 [2022-12-13 20:32:38,571 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1209 transitions. [2022-12-13 20:32:38,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1209 transitions. [2022-12-13 20:32:38,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:32:38,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1209 transitions. [2022-12-13 20:32:38,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 241.8) internal successors, (1209), 5 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:38,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 477.0) internal successors, (2862), 6 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:38,575 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 477.0) internal successors, (2862), 6 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:38,575 INFO L175 Difference]: Start difference. First operand has 82 places, 72 transitions, 319 flow. Second operand 5 states and 1209 transitions. [2022-12-13 20:32:38,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 108 transitions, 626 flow [2022-12-13 20:32:38,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 108 transitions, 622 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 20:32:38,578 INFO L231 Difference]: Finished difference. Result has 84 places, 73 transitions, 355 flow [2022-12-13 20:32:38,578 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=355, PETRI_PLACES=84, PETRI_TRANSITIONS=73} [2022-12-13 20:32:38,578 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 27 predicate places. [2022-12-13 20:32:38,578 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 73 transitions, 355 flow [2022-12-13 20:32:38,579 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-12-13 20:32:38,579 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:32:38,579 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:32:38,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 20:32:38,580 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 20:32:38,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:38,580 INFO L85 PathProgramCache]: Analyzing trace with hash 2045579967, now seen corresponding path program 1 times [2022-12-13 20:32:38,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:38,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997770406] [2022-12-13 20:32:38,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:38,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:38,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:38,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:38,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997770406] [2022-12-13 20:32:38,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997770406] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:32:38,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:32:38,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:32:38,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124835963] [2022-12-13 20:32:38,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:32:38,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:32:38,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:38,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:32:38,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:32:38,625 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 477 [2022-12-13 20:32:38,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 73 transitions, 355 flow. Second operand has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:38,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:32:38,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 477 [2022-12-13 20:32:38,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:32:38,788 INFO L130 PetriNetUnfolder]: 635/1204 cut-off events. [2022-12-13 20:32:38,788 INFO L131 PetriNetUnfolder]: For 642/642 co-relation queries the response was YES. [2022-12-13 20:32:38,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3062 conditions, 1204 events. 635/1204 cut-off events. For 642/642 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5657 event pairs, 464 based on Foata normal form. 10/1108 useless extension candidates. Maximal degree in co-relation 2493. Up to 871 conditions per place. [2022-12-13 20:32:38,791 INFO L137 encePairwiseOnDemand]: 472/477 looper letters, 77 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2022-12-13 20:32:38,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 83 transitions, 536 flow [2022-12-13 20:32:38,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:32:38,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:32:38,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 775 transitions. [2022-12-13 20:32:38,793 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5415793151642209 [2022-12-13 20:32:38,793 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 775 transitions. [2022-12-13 20:32:38,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 775 transitions. [2022-12-13 20:32:38,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:32:38,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 775 transitions. [2022-12-13 20:32:38,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 258.3333333333333) internal successors, (775), 3 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:38,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 477.0) internal successors, (1908), 4 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:38,796 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 477.0) internal successors, (1908), 4 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:38,796 INFO L175 Difference]: Start difference. First operand has 84 places, 73 transitions, 355 flow. Second operand 3 states and 775 transitions. [2022-12-13 20:32:38,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 83 transitions, 536 flow [2022-12-13 20:32:38,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 83 transitions, 514 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-13 20:32:38,799 INFO L231 Difference]: Finished difference. Result has 84 places, 73 transitions, 341 flow [2022-12-13 20:32:38,799 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=341, PETRI_PLACES=84, PETRI_TRANSITIONS=73} [2022-12-13 20:32:38,800 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 27 predicate places. [2022-12-13 20:32:38,800 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 73 transitions, 341 flow [2022-12-13 20:32:38,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:38,800 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:32:38,801 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:32:38,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 20:32:38,801 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 20:32:38,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:38,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1415516148, now seen corresponding path program 1 times [2022-12-13 20:32:38,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:38,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747155366] [2022-12-13 20:32:38,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:38,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:39,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:39,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:39,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747155366] [2022-12-13 20:32:39,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747155366] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:32:39,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444682025] [2022-12-13 20:32:39,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:39,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:32:39,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:32:39,453 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:32:39,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 20:32:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:39,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-13 20:32:39,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:32:39,670 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-12-13 20:32:39,744 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-12-13 20:32:39,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:32:39,776 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-12-13 20:32:39,849 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-13 20:32:39,850 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-12-13 20:32:39,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:39,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:32:40,192 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:32:40,193 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-12-13 20:32:40,203 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:32:40,203 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-12-13 20:32:40,210 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-12-13 20:32:40,227 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-12-13 20:32:40,238 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:32:40,238 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-12-13 20:32:40,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-12-13 20:32:40,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444682025] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:32:40,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:32:40,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 24 [2022-12-13 20:32:40,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135108257] [2022-12-13 20:32:40,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:32:40,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 20:32:40,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:40,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 20:32:40,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=524, Unknown=2, NotChecked=0, Total=650 [2022-12-13 20:32:40,735 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 477 [2022-12-13 20:32:40,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 73 transitions, 341 flow. Second operand has 26 states, 26 states have (on average 180.73076923076923) internal successors, (4699), 26 states have internal predecessors, (4699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:40,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:32:40,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 477 [2022-12-13 20:32:40,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:32:42,033 INFO L130 PetriNetUnfolder]: 1289/2470 cut-off events. [2022-12-13 20:32:42,033 INFO L131 PetriNetUnfolder]: For 768/768 co-relation queries the response was YES. [2022-12-13 20:32:42,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6030 conditions, 2470 events. 1289/2470 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 14399 event pairs, 465 based on Foata normal form. 0/2251 useless extension candidates. Maximal degree in co-relation 4794. Up to 1015 conditions per place. [2022-12-13 20:32:42,041 INFO L137 encePairwiseOnDemand]: 465/477 looper letters, 146 selfloop transitions, 31 changer transitions 0/181 dead transitions. [2022-12-13 20:32:42,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 181 transitions, 1072 flow [2022-12-13 20:32:42,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 20:32:42,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 20:32:42,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3206 transitions. [2022-12-13 20:32:42,045 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.39536317671722776 [2022-12-13 20:32:42,045 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3206 transitions. [2022-12-13 20:32:42,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3206 transitions. [2022-12-13 20:32:42,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:32:42,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3206 transitions. [2022-12-13 20:32:42,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 188.58823529411765) internal successors, (3206), 17 states have internal predecessors, (3206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:42,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 477.0) internal successors, (8586), 18 states have internal predecessors, (8586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:42,057 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 477.0) internal successors, (8586), 18 states have internal predecessors, (8586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:42,057 INFO L175 Difference]: Start difference. First operand has 84 places, 73 transitions, 341 flow. Second operand 17 states and 3206 transitions. [2022-12-13 20:32:42,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 181 transitions, 1072 flow [2022-12-13 20:32:42,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 181 transitions, 1067 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 20:32:42,061 INFO L231 Difference]: Finished difference. Result has 107 places, 91 transitions, 536 flow [2022-12-13 20:32:42,061 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=536, PETRI_PLACES=107, PETRI_TRANSITIONS=91} [2022-12-13 20:32:42,061 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 50 predicate places. [2022-12-13 20:32:42,062 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 91 transitions, 536 flow [2022-12-13 20:32:42,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 180.73076923076923) internal successors, (4699), 26 states have internal predecessors, (4699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:42,063 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:32:42,063 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:32:42,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 20:32:42,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 20:32:42,264 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 20:32:42,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:42,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1415516147, now seen corresponding path program 1 times [2022-12-13 20:32:42,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:42,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070113556] [2022-12-13 20:32:42,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:42,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:42,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:42,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:42,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070113556] [2022-12-13 20:32:42,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070113556] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:32:42,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072914221] [2022-12-13 20:32:42,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:42,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:32:42,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:32:42,816 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:32:42,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 20:32:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:42,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-13 20:32:42,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:32:42,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:32:42,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:32:42,937 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 20:32:42,938 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-12-13 20:32:42,945 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:32:42,945 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-12-13 20:32:43,017 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-12-13 20:32:43,101 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-12-13 20:32:43,240 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-12-13 20:32:43,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:32:43,297 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-12-13 20:32:43,419 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-12-13 20:32:43,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:43,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:32:43,616 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_31| Int) (v_ArrVal_456 (Array Int Int)) (v_ArrVal_458 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_456) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_31| 4) |c_~#queue~0.offset|) v_ArrVal_458) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_31| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) is different from false [2022-12-13 20:32:43,703 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_454 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_31| Int) (v_ArrVal_456 (Array Int Int)) (v_ArrVal_458 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_454)) |c_~#stored_elements~0.base| v_ArrVal_456) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_31| 4) |c_~#queue~0.offset|) v_ArrVal_458) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_454) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_31| (select .cse0 (+ |c_~#queue~0.offset| 3204)))))))) is different from false [2022-12-13 20:32:43,742 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_454 Int) (v_ArrVal_452 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_31| Int) (v_ArrVal_456 (Array Int Int)) (v_ArrVal_458 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 (store .cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_452) .cse2 v_ArrVal_454)) |c_~#stored_elements~0.base| v_ArrVal_456) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_31| 4) |c_~#queue~0.offset|) v_ArrVal_458) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_31| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_454) (not (<= v_ArrVal_452 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))))))) is different from false [2022-12-13 20:32:50,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:50,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072914221] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:32:50,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:32:50,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-12-13 20:32:50,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185373105] [2022-12-13 20:32:50,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:32:50,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 20:32:50,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:50,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 20:32:50,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=605, Unknown=15, NotChecked=168, Total=992 [2022-12-13 20:32:52,249 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-12-13 20:32:54,255 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-12-13 20:32:56,263 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-12-13 20:32:58,270 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-12-13 20:33:00,353 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-12-13 20:33:02,465 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-12-13 20:33:04,531 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-12-13 20:33:05,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:33:07,591 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-12-13 20:33:09,601 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-12-13 20:33:11,606 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-12-13 20:33:13,614 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-12-13 20:33:13,614 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 477 [2022-12-13 20:33:13,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 91 transitions, 536 flow. Second operand has 32 states, 32 states have (on average 181.40625) internal successors, (5805), 32 states have internal predecessors, (5805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:33:13,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:33:13,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 477 [2022-12-13 20:33:13,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:33:17,137 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-12-13 20:33:17,304 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_31| Int) (v_ArrVal_458 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_31| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_31| 4) |c_~#queue~0.offset|) v_ArrVal_458) .cse2) 2147483647)))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_31| Int) (v_ArrVal_456 (Array Int Int)) (v_ArrVal_458 Int)) (let ((.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_456) |c_~#queue~0.base|))) (or (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_31| 4) |c_~#queue~0.offset|) v_ArrVal_458) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_31| (select .cse3 .cse1)))))))) is different from false [2022-12-13 20:33:17,747 INFO L130 PetriNetUnfolder]: 1303/2494 cut-off events. [2022-12-13 20:33:17,747 INFO L131 PetriNetUnfolder]: For 1365/1365 co-relation queries the response was YES. [2022-12-13 20:33:17,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6580 conditions, 2494 events. 1303/2494 cut-off events. For 1365/1365 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 14541 event pairs, 1074 based on Foata normal form. 2/2281 useless extension candidates. Maximal degree in co-relation 5573. Up to 2344 conditions per place. [2022-12-13 20:33:17,755 INFO L137 encePairwiseOnDemand]: 460/477 looper letters, 79 selfloop transitions, 41 changer transitions 0/124 dead transitions. [2022-12-13 20:33:17,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 124 transitions, 948 flow [2022-12-13 20:33:17,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 20:33:17,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 20:33:17,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3525 transitions. [2022-12-13 20:33:17,760 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3889440582588547 [2022-12-13 20:33:17,760 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3525 transitions. [2022-12-13 20:33:17,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3525 transitions. [2022-12-13 20:33:17,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:33:17,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3525 transitions. [2022-12-13 20:33:17,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 185.52631578947367) internal successors, (3525), 19 states have internal predecessors, (3525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:33:17,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 477.0) internal successors, (9540), 20 states have internal predecessors, (9540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:33:17,772 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 477.0) internal successors, (9540), 20 states have internal predecessors, (9540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:33:17,772 INFO L175 Difference]: Start difference. First operand has 107 places, 91 transitions, 536 flow. Second operand 19 states and 3525 transitions. [2022-12-13 20:33:17,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 124 transitions, 948 flow [2022-12-13 20:33:17,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 124 transitions, 856 flow, removed 29 selfloop flow, removed 9 redundant places. [2022-12-13 20:33:17,778 INFO L231 Difference]: Finished difference. Result has 123 places, 110 transitions, 713 flow [2022-12-13 20:33:17,778 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=713, PETRI_PLACES=123, PETRI_TRANSITIONS=110} [2022-12-13 20:33:17,778 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 66 predicate places. [2022-12-13 20:33:17,778 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 110 transitions, 713 flow [2022-12-13 20:33:17,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 181.40625) internal successors, (5805), 32 states have internal predecessors, (5805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:33:17,780 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:33:17,780 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:33:17,785 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 20:33:17,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:33:17,982 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 20:33:17,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:33:17,983 INFO L85 PathProgramCache]: Analyzing trace with hash -466014701, now seen corresponding path program 1 times [2022-12-13 20:33:17,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:33:17,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657202468] [2022-12-13 20:33:17,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:33:17,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:33:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:18,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:33:18,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:33:18,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657202468] [2022-12-13 20:33:18,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657202468] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:33:18,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67884724] [2022-12-13 20:33:18,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:33:18,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:33:18,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:33:18,638 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:33:18,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 20:33:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:18,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-13 20:33:18,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:33:18,741 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-12-13 20:33:18,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:33:18,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:33:18,757 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 20:33:18,758 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-12-13 20:33:18,772 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 20:33:18,773 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-12-13 20:33:18,844 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-12-13 20:33:18,913 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 20:33:18,928 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-12-13 20:33:18,928 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-12-13 20:33:18,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:33:18,997 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 20:33:18,998 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-12-13 20:33:19,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-12-13 20:33:19,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:33:19,142 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-12-13 20:33:19,225 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-12-13 20:33:19,225 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-12-13 20:33:19,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:33:19,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:33:19,334 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| Int) (v_ArrVal_554 (Array Int Int)) (v_ArrVal_556 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_554) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| 4)) v_ArrVal_556) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) is different from false [2022-12-13 20:33:19,407 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| Int) (v_ArrVal_554 (Array Int Int)) (v_ArrVal_556 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_552)) |c_~#stored_elements~0.base| v_ArrVal_554) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_552) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| 4)) v_ArrVal_556) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-12-13 20:33:19,701 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| Int) (v_ArrVal_550 Int) (v_ArrVal_549 Int) (v_ArrVal_554 (Array Int Int)) (v_ArrVal_556 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_549)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_550) .cse4 v_ArrVal_552)) |c_~#stored_elements~0.base| v_ArrVal_554) |c_~#queue~0.base|)) (.cse0 (select .cse2 .cse4))) (or (< (+ .cse0 1) v_ArrVal_552) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| (select .cse1 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| 4)) v_ArrVal_556) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (= .cse0 800) (< (+ (select .cse2 .cse3) 1) v_ArrVal_550))))) is different from false [2022-12-13 20:33:26,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 20:33:26,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67884724] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:33:26,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:33:26,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 34 [2022-12-13 20:33:26,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964776519] [2022-12-13 20:33:26,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:33:26,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-13 20:33:26,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:33:26,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-13 20:33:26,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=812, Unknown=24, NotChecked=192, Total=1260 [2022-12-13 20:33:26,798 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 477 [2022-12-13 20:33:26,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 110 transitions, 713 flow. Second operand has 36 states, 36 states have (on average 177.33333333333334) internal successors, (6384), 36 states have internal predecessors, (6384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:33:26,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:33:26,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 477 [2022-12-13 20:33:26,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:33:39,625 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-12-13 20:33:41,628 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-12-13 20:33:43,632 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-12-13 20:33:45,635 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-12-13 20:33:47,648 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-12-13 20:33:50,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 [1] [2022-12-13 20:33:59,096 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-12-13 20:34:01,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 [1] [2022-12-13 20:34:03,112 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-12-13 20:34:05,123 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-12-13 20:34:07,127 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-12-13 20:34:09,139 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-12-13 20:34:11,152 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-12-13 20:34:13,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-12-13 20:34:15,159 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-12-13 20:34:17,169 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-12-13 20:34:19,282 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-12-13 20:34:21,286 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-12-13 20:34:23,379 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-12-13 20:34:25,392 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-12-13 20:34:27,396 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-12-13 20:34:29,398 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-12-13 20:34:31,402 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-12-13 20:34:33,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-12-13 20:34:35,482 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-12-13 20:34:37,485 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-12-13 20:34:39,497 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-12-13 20:34:41,511 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-12-13 20:34:43,880 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-12-13 20:34:45,886 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-12-13 20:34:47,899 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-12-13 20:34:49,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 [1] [2022-12-13 20:34:51,915 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-12-13 20:34:54,030 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-12-13 20:34:56,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:34:58,219 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-12-13 20:35:00,224 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-12-13 20:35:02,232 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-12-13 20:35:04,271 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-12-13 20:35:05,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:35:07,600 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-12-13 20:35:09,604 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-12-13 20:35:11,621 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-12-13 20:35:13,805 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-12-13 20:35:15,817 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-12-13 20:35:15,833 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 ((.cse8 (select .cse4 .cse5))) (let ((.cse0 (+ .cse8 1)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (= .cse8 800))) (and (or (forall ((v_ArrVal_552 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| Int) (v_ArrVal_550 Int) (v_ArrVal_554 (Array Int Int)) (v_ArrVal_556 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_550) .cse5 v_ArrVal_552)) |c_~#stored_elements~0.base| v_ArrVal_554) |c_~#queue~0.base|))) (or (< .cse0 v_ArrVal_552) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| (select .cse1 .cse2))) (not (<= v_ArrVal_550 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| 4)) v_ArrVal_556) .cse3) 2147483647)))) .cse6) (or (forall ((v_ArrVal_552 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| Int) (v_ArrVal_554 (Array Int Int)) (v_ArrVal_556 Int)) (let ((.cse7 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_552)) |c_~#stored_elements~0.base| v_ArrVal_554) |c_~#queue~0.base|))) (or (< .cse0 v_ArrVal_552) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| (select .cse7 .cse2))) (< (select (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| 4)) v_ArrVal_556) .cse3) 2147483647)))) .cse6))))) is different from false [2022-12-13 20:35:16,053 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| Int) (v_ArrVal_556 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| (select .cse0 .cse1))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| 4)) v_ArrVal_556) .cse2) 2147483647)))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| Int) (v_ArrVal_554 (Array Int Int)) (v_ArrVal_556 Int)) (let ((.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_554) |c_~#queue~0.base|))) (or (< (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| 4)) v_ArrVal_556) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| (select .cse3 .cse1)))))))) is different from false [2022-12-13 20:35:17,186 INFO L130 PetriNetUnfolder]: 1864/3563 cut-off events. [2022-12-13 20:35:17,186 INFO L131 PetriNetUnfolder]: For 2231/2231 co-relation queries the response was YES. [2022-12-13 20:35:17,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9680 conditions, 3563 events. 1864/3563 cut-off events. For 2231/2231 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 22121 event pairs, 512 based on Foata normal form. 18/3282 useless extension candidates. Maximal degree in co-relation 8537. Up to 2084 conditions per place. [2022-12-13 20:35:17,197 INFO L137 encePairwiseOnDemand]: 454/477 looper letters, 185 selfloop transitions, 91 changer transitions 0/280 dead transitions. [2022-12-13 20:35:17,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 280 transitions, 1821 flow [2022-12-13 20:35:17,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 20:35:17,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-13 20:35:17,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4286 transitions. [2022-12-13 20:35:17,202 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.39066630206909125 [2022-12-13 20:35:17,202 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4286 transitions. [2022-12-13 20:35:17,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4286 transitions. [2022-12-13 20:35:17,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:35:17,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4286 transitions. [2022-12-13 20:35:17,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 186.34782608695653) internal successors, (4286), 23 states have internal predecessors, (4286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:35:17,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 477.0) internal successors, (11448), 24 states have internal predecessors, (11448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:35:17,215 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 477.0) internal successors, (11448), 24 states have internal predecessors, (11448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:35:17,215 INFO L175 Difference]: Start difference. First operand has 123 places, 110 transitions, 713 flow. Second operand 23 states and 4286 transitions. [2022-12-13 20:35:17,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 280 transitions, 1821 flow [2022-12-13 20:35:17,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 280 transitions, 1744 flow, removed 25 selfloop flow, removed 9 redundant places. [2022-12-13 20:35:17,225 INFO L231 Difference]: Finished difference. Result has 148 places, 157 transitions, 1228 flow [2022-12-13 20:35:17,226 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1228, PETRI_PLACES=148, PETRI_TRANSITIONS=157} [2022-12-13 20:35:17,226 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 91 predicate places. [2022-12-13 20:35:17,226 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 157 transitions, 1228 flow [2022-12-13 20:35:17,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 177.33333333333334) internal successors, (6384), 36 states have internal predecessors, (6384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:35:17,227 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:35:17,227 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:35:17,232 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 20:35:17,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:35:17,428 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 20:35:17,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:35:17,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1376034969, now seen corresponding path program 2 times [2022-12-13 20:35:17,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:35:17,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951042065] [2022-12-13 20:35:17,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:35:17,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:35:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:18,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:35:18,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:35:18,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951042065] [2022-12-13 20:35:18,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951042065] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:35:18,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136092686] [2022-12-13 20:35:18,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 20:35:18,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:35:18,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:35:18,030 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:35:18,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 20:35:18,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 20:35:18,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:35:18,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-13 20:35:18,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:35:18,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:35:18,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:35:18,167 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 20:35:18,168 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-12-13 20:35:18,185 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 20:35:18,186 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-12-13 20:35:18,280 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-12-13 20:35:18,382 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-12-13 20:35:18,447 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 40 treesize of output 42 [2022-12-13 20:35:18,605 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-12-13 20:35:18,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:35:18,681 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-12-13 20:35:18,812 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-12-13 20:35:18,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:35:18,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:35:21,171 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_657 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| Int) (v_ArrVal_659 Int) (v_ArrVal_655 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_655)) |c_~#stored_elements~0.base| v_ArrVal_657) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_655) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| 4) |c_~#queue~0.offset|) v_ArrVal_659) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-12-13 20:35:21,203 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_657 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| Int) (v_ArrVal_659 Int) (v_ArrVal_654 (Array Int Int)) (v_ArrVal_655 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_654))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_655)) |c_~#stored_elements~0.base| v_ArrVal_657) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| 4) |c_~#queue~0.offset|) v_ArrVal_659) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_655)))))) is different from false [2022-12-13 20:35:21,228 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_653 Int) (v_ArrVal_657 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| Int) (v_ArrVal_659 Int) (v_ArrVal_654 (Array Int Int)) (v_ArrVal_655 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_653)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_654))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_655)) |c_~#stored_elements~0.base| v_ArrVal_657) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| 4) |c_~#queue~0.offset|) v_ArrVal_659) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_655) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (not (<= v_ArrVal_653 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)))))))) is different from false [2022-12-13 20:35:21,258 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_653 Int) (v_ArrVal_657 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| Int) (v_ArrVal_659 Int) (v_ArrVal_654 (Array Int Int)) (v_ArrVal_655 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_653)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_654))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_655)) |c_~#stored_elements~0.base| v_ArrVal_657) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| 4) |c_~#queue~0.offset|) v_ArrVal_659) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ 1 (select .cse1 .cse2)) v_ArrVal_653) (< (+ (select .cse3 .cse4) 1) v_ArrVal_655) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| (select .cse0 (+ |c_~#queue~0.offset| 3204)))))))))) is different from false [2022-12-13 20:35:21,288 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_653 Int) (v_ArrVal_651 Int) (v_ArrVal_657 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| Int) (v_ArrVal_659 Int) (v_ArrVal_654 (Array Int Int)) (v_ArrVal_655 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_651)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_653)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_654))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_655)) |c_~#stored_elements~0.base| v_ArrVal_657) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_653) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| 4) |c_~#queue~0.offset|) v_ArrVal_659) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_655))))))) is different from false [2022-12-13 20:35:21,317 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_653 Int) (v_ArrVal_651 Int) (v_ArrVal_657 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (v_ArrVal_659 Int) (v_ArrVal_654 (Array Int Int)) (v_ArrVal_655 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) v_ArrVal_651)) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse5 .cse4 v_ArrVal_653)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_654))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_655)) |c_~#stored_elements~0.base| v_ArrVal_657) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_655) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| (select .cse3 .cse1))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| 4) |c_~#queue~0.offset|) v_ArrVal_659) .cse4) 2147483647) (< (+ (select .cse5 .cse4) 1) v_ArrVal_653)))))))) is different from false [2022-12-13 20:35:21,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-13 20:35:21,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136092686] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:35:21,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:35:21,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-13 20:35:21,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493013049] [2022-12-13 20:35:21,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:35:21,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-13 20:35:21,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:35:21,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-13 20:35:21,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=605, Unknown=10, NotChecked=354, Total=1190 [2022-12-13 20:35:21,477 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 477 [2022-12-13 20:35:21,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 157 transitions, 1228 flow. Second operand has 35 states, 35 states have (on average 177.37142857142857) internal successors, (6208), 35 states have internal predecessors, (6208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:35:21,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:35:21,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 477 [2022-12-13 20:35:21,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:35:23,861 INFO L130 PetriNetUnfolder]: 2129/4055 cut-off events. [2022-12-13 20:35:23,861 INFO L131 PetriNetUnfolder]: For 14729/14729 co-relation queries the response was YES. [2022-12-13 20:35:23,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17705 conditions, 4055 events. 2129/4055 cut-off events. For 14729/14729 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 25794 event pairs, 742 based on Foata normal form. 9/3743 useless extension candidates. Maximal degree in co-relation 15725. Up to 2512 conditions per place. [2022-12-13 20:35:23,879 INFO L137 encePairwiseOnDemand]: 460/477 looper letters, 194 selfloop transitions, 57 changer transitions 0/255 dead transitions. [2022-12-13 20:35:23,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 255 transitions, 2597 flow [2022-12-13 20:35:23,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 20:35:23,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 20:35:23,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2797 transitions. [2022-12-13 20:35:23,883 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3909154437456324 [2022-12-13 20:35:23,883 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2797 transitions. [2022-12-13 20:35:23,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2797 transitions. [2022-12-13 20:35:23,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:35:23,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2797 transitions. [2022-12-13 20:35:23,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 186.46666666666667) internal successors, (2797), 15 states have internal predecessors, (2797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:35:23,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 477.0) internal successors, (7632), 16 states have internal predecessors, (7632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:35:23,890 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 477.0) internal successors, (7632), 16 states have internal predecessors, (7632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:35:23,891 INFO L175 Difference]: Start difference. First operand has 148 places, 157 transitions, 1228 flow. Second operand 15 states and 2797 transitions. [2022-12-13 20:35:23,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 255 transitions, 2597 flow [2022-12-13 20:35:23,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 255 transitions, 2483 flow, removed 43 selfloop flow, removed 5 redundant places. [2022-12-13 20:35:23,914 INFO L231 Difference]: Finished difference. Result has 164 places, 181 transitions, 1565 flow [2022-12-13 20:35:23,915 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1565, PETRI_PLACES=164, PETRI_TRANSITIONS=181} [2022-12-13 20:35:23,915 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 107 predicate places. [2022-12-13 20:35:23,915 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 181 transitions, 1565 flow [2022-12-13 20:35:23,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 177.37142857142857) internal successors, (6208), 35 states have internal predecessors, (6208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:35:23,916 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:35:23,916 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:35:23,920 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 20:35:24,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 20:35:24,117 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 20:35:24,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:35:24,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1376034970, now seen corresponding path program 1 times [2022-12-13 20:35:24,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:35:24,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118656140] [2022-12-13 20:35:24,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:35:24,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:35:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:24,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:35:24,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:35:24,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118656140] [2022-12-13 20:35:24,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118656140] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:35:24,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343166437] [2022-12-13 20:35:24,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:35:24,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:35:24,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:35:24,454 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:35:24,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 20:35:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:24,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-13 20:35:24,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:35:24,582 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 20:35:24,582 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-12-13 20:35:24,675 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-12-13 20:35:24,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:35:24,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 20:35:24,766 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-12-13 20:35:24,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:35:24,793 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-12-13 20:35:24,859 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-13 20:35:24,859 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-12-13 20:35:24,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:35:24,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:35:24,990 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_745 (Array Int Int)) (v_ArrVal_747 Int)) (or (< 0 (+ (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_745) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_747) (+ 3208 |c_~#queue~0.offset|)) 2147483650)) (< (+ v_ArrVal_747 2147483648) 0))) is different from false [2022-12-13 20:35:25,125 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:35:25,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 48 [2022-12-13 20:35:25,138 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:35:25,138 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 889 treesize of output 879 [2022-12-13 20:35:25,149 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 1410 treesize of output 1362 [2022-12-13 20:35:25,163 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 1554 treesize of output 1490 [2022-12-13 20:35:26,596 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 28 treesize of output 24 [2022-12-13 20:35:26,613 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:35:26,613 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 490 treesize of output 462 [2022-12-13 20:35:26,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:35:26,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343166437] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:35:26,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:35:26,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-13 20:35:26,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949184752] [2022-12-13 20:35:26,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:35:26,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 20:35:26,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:35:26,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 20:35:26,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=472, Unknown=6, NotChecked=46, Total=650 [2022-12-13 20:35:26,885 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 477 [2022-12-13 20:35:26,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 181 transitions, 1565 flow. Second operand has 26 states, 26 states have (on average 188.84615384615384) internal successors, (4910), 26 states have internal predecessors, (4910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:35:26,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:35:26,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 477 [2022-12-13 20:35:26,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:35:27,718 INFO L130 PetriNetUnfolder]: 2179/4175 cut-off events. [2022-12-13 20:35:27,718 INFO L131 PetriNetUnfolder]: For 26905/26905 co-relation queries the response was YES. [2022-12-13 20:35:27,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20551 conditions, 4175 events. 2179/4175 cut-off events. For 26905/26905 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 26887 event pairs, 1061 based on Foata normal form. 18/3855 useless extension candidates. Maximal degree in co-relation 20131. Up to 3531 conditions per place. [2022-12-13 20:35:27,736 INFO L137 encePairwiseOnDemand]: 473/477 looper letters, 187 selfloop transitions, 9 changer transitions 0/200 dead transitions. [2022-12-13 20:35:27,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 200 transitions, 2053 flow [2022-12-13 20:35:27,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:35:27,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:35:27,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1007 transitions. [2022-12-13 20:35:27,738 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2022-12-13 20:35:27,738 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1007 transitions. [2022-12-13 20:35:27,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1007 transitions. [2022-12-13 20:35:27,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:35:27,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1007 transitions. [2022-12-13 20:35:27,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 201.4) internal successors, (1007), 5 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:35:27,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 477.0) internal successors, (2862), 6 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:35:27,741 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 477.0) internal successors, (2862), 6 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:35:27,741 INFO L175 Difference]: Start difference. First operand has 164 places, 181 transitions, 1565 flow. Second operand 5 states and 1007 transitions. [2022-12-13 20:35:27,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 200 transitions, 2053 flow [2022-12-13 20:35:27,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 200 transitions, 1897 flow, removed 54 selfloop flow, removed 7 redundant places. [2022-12-13 20:35:27,766 INFO L231 Difference]: Finished difference. Result has 160 places, 180 transitions, 1410 flow [2022-12-13 20:35:27,766 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=1376, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1410, PETRI_PLACES=160, PETRI_TRANSITIONS=180} [2022-12-13 20:35:27,766 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 103 predicate places. [2022-12-13 20:35:27,766 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 180 transitions, 1410 flow [2022-12-13 20:35:27,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 188.84615384615384) internal successors, (4910), 26 states have internal predecessors, (4910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:35:27,767 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:35:27,767 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:35:27,772 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 20:35:27,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:35:27,969 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 20:35:27,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:35:27,970 INFO L85 PathProgramCache]: Analyzing trace with hash -931580537, now seen corresponding path program 3 times [2022-12-13 20:35:27,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:35:27,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312641644] [2022-12-13 20:35:27,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:35:27,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:35:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:28,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:35:28,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:35:28,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312641644] [2022-12-13 20:35:28,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312641644] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:35:28,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197453592] [2022-12-13 20:35:28,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 20:35:28,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:35:28,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:35:28,616 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:35:28,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 20:35:28,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 20:35:28,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:35:28,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-13 20:35:28,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:35:28,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:35:28,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:35:28,757 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 20:35:28,758 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-12-13 20:35:28,772 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 20:35:28,772 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-12-13 20:35:28,874 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-12-13 20:35:28,979 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-12-13 20:35:29,119 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-12-13 20:35:29,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:35:29,188 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-12-13 20:35:29,253 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-12-13 20:35:29,382 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-12-13 20:35:29,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:35:29,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:35:29,615 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_849 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_846) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_847) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| 4) |c_~#queue~0.offset|) v_ArrVal_849) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-12-13 20:35:29,660 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_849 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| Int) (v_ArrVal_844 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_844)) |c_~#stored_elements~0.base| v_ArrVal_846) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_847) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| 4) |c_~#queue~0.offset|) v_ArrVal_849) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_844 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1)))))) is different from false [2022-12-13 20:35:29,677 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_849 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| Int) (v_ArrVal_844 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 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_844)) |c_~#stored_elements~0.base| v_ArrVal_846) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_847) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| 4) |c_~#queue~0.offset|) v_ArrVal_849) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_844))))) is different from false [2022-12-13 20:35:43,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:35:43,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197453592] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:35:43,785 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:35:43,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-13 20:35:43,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171212552] [2022-12-13 20:35:43,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:35:43,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-13 20:35:43,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:35:43,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-13 20:35:43,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=737, Unknown=20, NotChecked=186, Total=1190 [2022-12-13 20:35:44,402 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 477 [2022-12-13 20:35:44,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 180 transitions, 1410 flow. Second operand has 35 states, 35 states have (on average 177.37142857142857) internal successors, (6208), 35 states have internal predecessors, (6208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:35:44,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:35:44,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 477 [2022-12-13 20:35:44,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:35:53,122 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-12-13 20:35:55,129 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-12-13 20:35:59,510 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-12-13 20:36:01,538 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-12-13 20:36:05,935 INFO L130 PetriNetUnfolder]: 3388/6453 cut-off events. [2022-12-13 20:36:05,936 INFO L131 PetriNetUnfolder]: For 37813/37813 co-relation queries the response was YES. [2022-12-13 20:36:05,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30121 conditions, 6453 events. 3388/6453 cut-off events. For 37813/37813 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 45627 event pairs, 1066 based on Foata normal form. 9/5931 useless extension candidates. Maximal degree in co-relation 29693. Up to 2894 conditions per place. [2022-12-13 20:36:05,966 INFO L137 encePairwiseOnDemand]: 455/477 looper letters, 262 selfloop transitions, 131 changer transitions 0/397 dead transitions. [2022-12-13 20:36:05,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 397 transitions, 4316 flow [2022-12-13 20:36:05,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 20:36:05,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-13 20:36:05,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4830 transitions. [2022-12-13 20:36:05,971 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.38945331398161587 [2022-12-13 20:36:05,971 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 4830 transitions. [2022-12-13 20:36:05,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 4830 transitions. [2022-12-13 20:36:05,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:36:05,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 4830 transitions. [2022-12-13 20:36:05,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 185.76923076923077) internal successors, (4830), 26 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:36:05,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 477.0) internal successors, (12879), 27 states have internal predecessors, (12879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:36:05,982 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 477.0) internal successors, (12879), 27 states have internal predecessors, (12879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:36:05,982 INFO L175 Difference]: Start difference. First operand has 160 places, 180 transitions, 1410 flow. Second operand 26 states and 4830 transitions. [2022-12-13 20:36:05,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 397 transitions, 4316 flow [2022-12-13 20:36:06,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 397 transitions, 4310 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 20:36:06,012 INFO L231 Difference]: Finished difference. Result has 192 places, 257 transitions, 2621 flow [2022-12-13 20:36:06,012 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=1404, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2621, PETRI_PLACES=192, PETRI_TRANSITIONS=257} [2022-12-13 20:36:06,012 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 135 predicate places. [2022-12-13 20:36:06,012 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 257 transitions, 2621 flow [2022-12-13 20:36:06,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 177.37142857142857) internal successors, (6208), 35 states have internal predecessors, (6208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:36:06,013 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:36:06,013 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:36:06,018 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 20:36:06,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 20:36:06,215 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 20:36:06,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:36:06,216 INFO L85 PathProgramCache]: Analyzing trace with hash -931325717, now seen corresponding path program 4 times [2022-12-13 20:36:06,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:36:06,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804927928] [2022-12-13 20:36:06,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:36:06,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:36:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:06,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:36:06,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:36:06,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804927928] [2022-12-13 20:36:06,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804927928] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:36:06,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290201555] [2022-12-13 20:36:06,865 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 20:36:06,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:36:06,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:36:06,866 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:36:06,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 20:36:06,948 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 20:36:06,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:36:06,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-13 20:36:06,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:36:06,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:36:06,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:36:06,973 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 20:36:06,974 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-12-13 20:36:06,989 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 20:36:06,989 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-12-13 20:36:07,083 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-12-13 20:36:07,182 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-12-13 20:36:07,347 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-12-13 20:36:07,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:36:07,423 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-12-13 20:36:07,570 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-12-13 20:36:07,698 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-12-13 20:36:07,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:36:07,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:36:07,817 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_952 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_952) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647)) is different from false [2022-12-13 20:36:07,987 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 Int) (v_ArrVal_952 (Array Int Int)) (v_ArrVal_948 Int) (v_ArrVal_949 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| 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_948)) |c_~#stored_elements~0.base| v_ArrVal_949))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (not (<= v_ArrVal_948 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| 4) |c_~#queue~0.offset|) v_ArrVal_951)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_952) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-12-13 20:36:08,003 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 Int) (v_ArrVal_952 (Array Int Int)) (v_ArrVal_948 Int) (v_ArrVal_949 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_949))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_948) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| 4) |c_~#queue~0.offset|) v_ArrVal_951)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_952) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-12-13 20:36:08,035 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 Int) (v_ArrVal_952 (Array Int Int)) (v_ArrVal_948 Int) (v_ArrVal_949 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| Int) (v_ArrVal_945 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_945) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_949))) (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_948) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| 4) |c_~#queue~0.offset|) v_ArrVal_951)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_952) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_945 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| (select .cse3 (+ |c_~#queue~0.offset| 3204))))))))) is different from false [2022-12-13 20:36:08,176 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 Int) (v_ArrVal_952 (Array Int Int)) (v_ArrVal_948 Int) (v_ArrVal_949 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| Int) (v_ArrVal_945 Int) (v_ArrVal_943 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_943)) (.cse2 (+ 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 .cse1 .cse2 v_ArrVal_945) .cse4 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_949))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_945) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| 4) |c_~#queue~0.offset|) v_ArrVal_951)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_952) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse4) 1) v_ArrVal_948)))))) is different from false [2022-12-13 20:36:14,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 20:36:14,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290201555] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:36:14,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:36:14,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-13 20:36:14,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654859764] [2022-12-13 20:36:14,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:36:14,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-13 20:36:14,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:36:14,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-13 20:36:14,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=649, Unknown=23, NotChecked=300, Total=1190 [2022-12-13 20:36:14,482 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 477 [2022-12-13 20:36:14,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 257 transitions, 2621 flow. Second operand has 35 states, 35 states have (on average 177.37142857142857) internal successors, (6208), 35 states have internal predecessors, (6208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:36:14,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:36:14,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 477 [2022-12-13 20:36:14,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:36:19,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:36:33,593 WARN L233 SmtUtils]: Spent 8.19s on a formula simplification. DAG size of input: 152 DAG size of output: 98 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:36:52,553 WARN L233 SmtUtils]: Spent 6.20s on a formula simplification. DAG size of input: 156 DAG size of output: 95 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:36:54,568 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-12-13 20:36:56,579 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-12-13 20:36:58,626 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-12-13 20:37:06,954 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-12-13 20:37:08,962 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-12-13 20:37:10,968 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-12-13 20:37:21,376 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-12-13 20:37:23,389 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-12-13 20:37:25,395 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-12-13 20:37:51,462 WARN L233 SmtUtils]: Spent 6.48s on a formula simplification. DAG size of input: 162 DAG size of output: 97 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:37:53,555 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-12-13 20:37:55,561 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-12-13 20:37:57,571 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-12-13 20:37:59,579 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-12-13 20:38:01,585 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-12-13 20:38:03,592 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-12-13 20:38:05,615 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-12-13 20:38:07,623 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-12-13 20:38:09,630 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-12-13 20:38:11,644 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-12-13 20:38:13,651 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-12-13 20:38:15,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-12-13 20:38:17,837 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-12-13 20:38:19,847 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-12-13 20:38:21,877 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-12-13 20:38:23,922 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-12-13 20:38:25,929 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-12-13 20:38:27,937 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-12-13 20:38:29,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 20:38:31,962 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-12-13 20:38:33,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 20:38:35,998 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-12-13 20:38:38,005 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-12-13 20:38:40,010 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-12-13 20:38:42,177 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-12-13 20:38:44,186 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-12-13 20:38:46,198 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-12-13 20:38:48,370 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-12-13 20:38:50,376 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-12-13 20:38:52,382 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-12-13 20:38:54,534 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-12-13 20:38:56,543 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-12-13 20:38:58,554 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-12-13 20:38:58,756 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_951 Int) (v_ArrVal_952 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_951)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_952) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1) 2147483647)) (< (select .cse0 .cse1) 2147483647) (forall ((v_ArrVal_951 Int) (v_ArrVal_952 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_55| 4) |c_~#queue~0.offset|) v_ArrVal_951)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_952) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-12-13 20:39:00,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:39:02,813 INFO L130 PetriNetUnfolder]: 5825/11055 cut-off events. [2022-12-13 20:39:02,813 INFO L131 PetriNetUnfolder]: For 175193/175195 co-relation queries the response was YES. [2022-12-13 20:39:02,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69099 conditions, 11055 events. 5825/11055 cut-off events. For 175193/175195 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 85505 event pairs, 2195 based on Foata normal form. 35/10201 useless extension candidates. Maximal degree in co-relation 67992. Up to 5039 conditions per place. [2022-12-13 20:39:02,884 INFO L137 encePairwiseOnDemand]: 455/477 looper letters, 327 selfloop transitions, 255 changer transitions 0/586 dead transitions. [2022-12-13 20:39:02,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 586 transitions, 8660 flow [2022-12-13 20:39:02,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-13 20:39:02,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-13 20:39:02,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5555 transitions. [2022-12-13 20:39:02,889 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.38819007686932216 [2022-12-13 20:39:02,889 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 5555 transitions. [2022-12-13 20:39:02,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 5555 transitions. [2022-12-13 20:39:02,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:39:02,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 5555 transitions. [2022-12-13 20:39:02,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 185.16666666666666) internal successors, (5555), 30 states have internal predecessors, (5555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:39:02,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 477.0) internal successors, (14787), 31 states have internal predecessors, (14787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:39:02,902 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 477.0) internal successors, (14787), 31 states have internal predecessors, (14787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:39:02,902 INFO L175 Difference]: Start difference. First operand has 192 places, 257 transitions, 2621 flow. Second operand 30 states and 5555 transitions. [2022-12-13 20:39:02,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 586 transitions, 8660 flow [2022-12-13 20:39:03,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 586 transitions, 7915 flow, removed 321 selfloop flow, removed 8 redundant places. [2022-12-13 20:39:03,006 INFO L231 Difference]: Finished difference. Result has 235 places, 450 transitions, 5976 flow [2022-12-13 20:39:03,006 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=2230, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=5976, PETRI_PLACES=235, PETRI_TRANSITIONS=450} [2022-12-13 20:39:03,006 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 178 predicate places. [2022-12-13 20:39:03,006 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 450 transitions, 5976 flow [2022-12-13 20:39:03,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 177.37142857142857) internal successors, (6208), 35 states have internal predecessors, (6208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:39:03,007 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:39:03,007 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:39:03,011 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 20:39:03,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 20:39:03,208 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 20:39:03,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:39:03,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1656300709, now seen corresponding path program 1 times [2022-12-13 20:39:03,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:39:03,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323028996] [2022-12-13 20:39:03,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:39:03,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:39:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:03,564 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:39:03,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:39:03,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323028996] [2022-12-13 20:39:03,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323028996] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:39:03,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936772301] [2022-12-13 20:39:03,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:39:03,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:39:03,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:39:03,565 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:39:03,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 20:39:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:03,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-13 20:39:03,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:39:03,817 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-12-13 20:39:03,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:39:03,847 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-12-13 20:39:03,919 INFO L321 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2022-12-13 20:39:03,920 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 36 [2022-12-13 20:39:03,954 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 35 treesize of output 28 [2022-12-13 20:39:03,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:39:03,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:39:04,183 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:39:04,184 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 88 treesize of output 52 [2022-12-13 20:39:04,193 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:39:04,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 75 [2022-12-13 20:39:04,198 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 40 treesize of output 28 [2022-12-13 20:39:04,207 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-12-13 20:39:04,228 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:39:04,228 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 64 treesize of output 52 [2022-12-13 20:39:04,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:39:04,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936772301] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:39:04,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:39:04,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-13 20:39:04,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978491738] [2022-12-13 20:39:04,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:39:04,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 20:39:04,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:39:04,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 20:39:04,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=542, Unknown=14, NotChecked=0, Total=650 [2022-12-13 20:39:05,786 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 477 [2022-12-13 20:39:05,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 450 transitions, 5976 flow. Second operand has 26 states, 26 states have (on average 187.07692307692307) internal successors, (4864), 26 states have internal predecessors, (4864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:39:05,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:39:05,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 477 [2022-12-13 20:39:05,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:39:11,648 INFO L130 PetriNetUnfolder]: 8446/16128 cut-off events. [2022-12-13 20:39:11,648 INFO L131 PetriNetUnfolder]: For 926824/926832 co-relation queries the response was YES. [2022-12-13 20:39:11,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149216 conditions, 16128 events. 8446/16128 cut-off events. For 926824/926832 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 135098 event pairs, 2713 based on Foata normal form. 23/14878 useless extension candidates. Maximal degree in co-relation 147403. Up to 5159 conditions per place. [2022-12-13 20:39:11,800 INFO L137 encePairwiseOnDemand]: 464/477 looper letters, 634 selfloop transitions, 194 changer transitions 0/832 dead transitions. [2022-12-13 20:39:11,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 832 transitions, 15152 flow [2022-12-13 20:39:11,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 20:39:11,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-13 20:39:11,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4346 transitions. [2022-12-13 20:39:11,805 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2022-12-13 20:39:11,805 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 4346 transitions. [2022-12-13 20:39:11,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 4346 transitions. [2022-12-13 20:39:11,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:39:11,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 4346 transitions. [2022-12-13 20:39:11,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 197.54545454545453) internal successors, (4346), 22 states have internal predecessors, (4346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:39:11,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 477.0) internal successors, (10971), 23 states have internal predecessors, (10971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:39:11,815 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 477.0) internal successors, (10971), 23 states have internal predecessors, (10971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:39:11,815 INFO L175 Difference]: Start difference. First operand has 235 places, 450 transitions, 5976 flow. Second operand 22 states and 4346 transitions. [2022-12-13 20:39:11,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 832 transitions, 15152 flow [2022-12-13 20:39:12,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 832 transitions, 12460 flow, removed 1311 selfloop flow, removed 6 redundant places. [2022-12-13 20:39:12,224 INFO L231 Difference]: Finished difference. Result has 257 places, 514 transitions, 6041 flow [2022-12-13 20:39:12,224 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=4615, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=6041, PETRI_PLACES=257, PETRI_TRANSITIONS=514} [2022-12-13 20:39:12,225 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 200 predicate places. [2022-12-13 20:39:12,225 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 514 transitions, 6041 flow [2022-12-13 20:39:12,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 187.07692307692307) internal successors, (4864), 26 states have internal predecessors, (4864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:39:12,225 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:39:12,225 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:39:12,231 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 20:39:12,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 20:39:12,426 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 20:39:12,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:39:12,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1656300662, now seen corresponding path program 1 times [2022-12-13 20:39:12,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:39:12,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956306145] [2022-12-13 20:39:12,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:39:12,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:39:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:12,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:39:12,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:39:12,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956306145] [2022-12-13 20:39:12,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956306145] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:39:12,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237732308] [2022-12-13 20:39:12,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:39:12,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:39:12,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:39:12,850 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:39:12,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 20:39:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:12,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 71 conjunts are in the unsatisfiable core [2022-12-13 20:39:12,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:39:12,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:39:12,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:39:12,968 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 20:39:12,969 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-12-13 20:39:12,978 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:39:12,978 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-12-13 20:39:13,050 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-12-13 20:39:13,100 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-12-13 20:39:13,257 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-12-13 20:39:13,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:39:13,312 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-12-13 20:39:13,421 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-12-13 20:39:13,556 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-12-13 20:39:13,929 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:39:13,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:39:15,181 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1130 Int) (v_ArrVal_1132 Int) (v_ArrVal_1134 Int) (v_ArrVal_1135 (Array Int Int)) (v_ArrVal_1136 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_64| Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1130)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select .cse3 .cse4)) (.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1132) .cse4 v_ArrVal_1134)) |c_~#stored_elements~0.base| v_ArrVal_1135) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_64| (select .cse0 .cse1))) (< (+ .cse2 1) v_ArrVal_1134) (= .cse2 800) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_64| 4) |c_~#queue~0.offset|) v_ArrVal_1136) .cse1) 2147483647))))) is different from false [2022-12-13 20:39:18,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 20:39:18,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237732308] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:39:18,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:39:18,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 27 [2022-12-13 20:39:18,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832362327] [2022-12-13 20:39:18,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:39:18,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-13 20:39:18,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:39:18,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-13 20:39:18,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=540, Unknown=24, NotChecked=52, Total=812 [2022-12-13 20:39:18,387 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 477 [2022-12-13 20:39:18,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 514 transitions, 6041 flow. Second operand has 29 states, 29 states have (on average 187.86206896551724) internal successors, (5448), 29 states have internal predecessors, (5448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:39:18,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:39:18,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 477 [2022-12-13 20:39:18,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:39:21,695 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse12 (select .cse3 .cse4))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse0 (+ .cse12 1)) (.cse5 (= .cse12 800))) (and (or (forall ((v_ArrVal_1134 Int) (v_ArrVal_1135 (Array Int Int)) (v_ArrVal_1136 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_64| Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1134)) |c_~#stored_elements~0.base| v_ArrVal_1135) |c_~#queue~0.base|))) (or (< .cse0 v_ArrVal_1134) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_64| (select .cse1 .cse2))) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_64| 4) |c_~#queue~0.offset|) v_ArrVal_1136) .cse2) 2147483647)))) .cse5) (forall ((v_ArrVal_1135 (Array Int Int)) (v_ArrVal_1136 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_64| Int)) (let ((.cse6 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1135) |c_~#queue~0.base|))) (or (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_64| 4) |c_~#queue~0.offset|) v_ArrVal_1136) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_64| (select .cse6 .cse2)))))) (forall ((v_ArrVal_1130 Int) (v_ArrVal_1132 Int) (v_ArrVal_1134 Int) (v_ArrVal_1135 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_65| Int) (v_ArrVal_1136 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_64| Int)) (let ((.cse9 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse10 (store .cse9 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_65| 4) |c_~#queue~0.offset|) v_ArrVal_1130))) (let ((.cse7 (select .cse10 .cse2)) (.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse10 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1132) .cse2 v_ArrVal_1134)) |c_~#stored_elements~0.base| v_ArrVal_1135) |c_~#queue~0.base|))) (or (= 800 .cse7) (< (+ .cse7 1) v_ArrVal_1134) (< (select (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_64| 4) |c_~#queue~0.offset|) v_ArrVal_1136) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_64| (select .cse8 .cse2))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_65| (select .cse9 .cse2)))))))) (or (forall ((v_ArrVal_1132 Int) (v_ArrVal_1134 Int) (v_ArrVal_1135 (Array Int Int)) (v_ArrVal_1136 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_64| Int)) (let ((.cse11 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1132) .cse4 v_ArrVal_1134)) |c_~#stored_elements~0.base| v_ArrVal_1135) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_64| (select .cse11 .cse2))) (< (select (store .cse11 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_64| 4) |c_~#queue~0.offset|) v_ArrVal_1136) .cse2) 2147483647) (< .cse0 v_ArrVal_1134)))) .cse5))))) is different from false [2022-12-13 20:39:26,488 INFO L130 PetriNetUnfolder]: 9954/19032 cut-off events. [2022-12-13 20:39:26,488 INFO L131 PetriNetUnfolder]: For 1100635/1100643 co-relation queries the response was YES. [2022-12-13 20:39:26,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169717 conditions, 19032 events. 9954/19032 cut-off events. For 1100635/1100643 co-relation queries the response was YES. Maximal size of possible extension queue 679. Compared 164056 event pairs, 5741 based on Foata normal form. 83/17671 useless extension candidates. Maximal degree in co-relation 167578. Up to 15074 conditions per place. [2022-12-13 20:39:26,677 INFO L137 encePairwiseOnDemand]: 457/477 looper letters, 615 selfloop transitions, 114 changer transitions 0/733 dead transitions. [2022-12-13 20:39:26,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 733 transitions, 11095 flow [2022-12-13 20:39:26,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 20:39:26,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-13 20:39:26,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4100 transitions. [2022-12-13 20:39:26,681 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40930418288908854 [2022-12-13 20:39:26,681 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4100 transitions. [2022-12-13 20:39:26,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4100 transitions. [2022-12-13 20:39:26,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:39:26,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4100 transitions. [2022-12-13 20:39:26,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 195.23809523809524) internal successors, (4100), 21 states have internal predecessors, (4100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:39:26,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 477.0) internal successors, (10494), 22 states have internal predecessors, (10494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:39:26,691 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 477.0) internal successors, (10494), 22 states have internal predecessors, (10494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:39:26,691 INFO L175 Difference]: Start difference. First operand has 257 places, 514 transitions, 6041 flow. Second operand 21 states and 4100 transitions. [2022-12-13 20:39:26,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 733 transitions, 11095 flow [2022-12-13 20:39:27,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 733 transitions, 10937 flow, removed 70 selfloop flow, removed 7 redundant places. [2022-12-13 20:39:27,095 INFO L231 Difference]: Finished difference. Result has 278 places, 568 transitions, 7169 flow [2022-12-13 20:39:27,096 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=5860, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=7169, PETRI_PLACES=278, PETRI_TRANSITIONS=568} [2022-12-13 20:39:27,096 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 221 predicate places. [2022-12-13 20:39:27,096 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 568 transitions, 7169 flow [2022-12-13 20:39:27,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 187.86206896551724) internal successors, (5448), 29 states have internal predecessors, (5448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:39:27,096 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:39:27,097 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:39:27,101 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 20:39:27,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 20:39:27,298 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 20:39:27,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:39:27,299 INFO L85 PathProgramCache]: Analyzing trace with hash 285568480, now seen corresponding path program 1 times [2022-12-13 20:39:27,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:39:27,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36322351] [2022-12-13 20:39:27,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:39:27,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:39:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:27,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:39:27,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:39:27,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36322351] [2022-12-13 20:39:27,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36322351] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:39:27,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129294386] [2022-12-13 20:39:27,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:39:27,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:39:27,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:39:27,833 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:39:27,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 20:39:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:27,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 72 conjunts are in the unsatisfiable core [2022-12-13 20:39:27,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:39:27,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:39:27,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:39:27,960 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 20:39:27,961 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-12-13 20:39:27,972 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 20:39:27,972 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-12-13 20:39:28,062 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-12-13 20:39:28,104 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 37 [2022-12-13 20:39:28,156 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-12-13 20:39:28,277 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-12-13 20:39:28,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:39:28,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-12-13 20:39:28,443 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-12-13 20:39:28,640 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-12-13 20:39:28,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:39:28,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:39:28,862 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1242 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_69| Int) (v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1245 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1242)) |c_~#stored_elements~0.base| v_ArrVal_1243) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_69| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_69| 4) |c_~#queue~0.offset|) v_ArrVal_1245) .cse1) 2147483647) (not (<= v_ArrVal_1242 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1)))))) is different from false [2022-12-13 20:39:29,186 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1240 Int) (v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1242 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_69| Int) (v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1245 Int) (v_ArrVal_1236 Int)) (let ((.cse4 (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_1236)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1238))) (let ((.cse2 (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1240) .cse3 v_ArrVal_1242)) |c_~#stored_elements~0.base| v_ArrVal_1243) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_69| 4) |c_~#queue~0.offset|) v_ArrVal_1245) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1242) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_69| (select .cse0 .cse1)))))))) is different from false [2022-12-13 20:39:32,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 20:39:32,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129294386] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:39:32,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:39:32,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2022-12-13 20:39:32,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635515346] [2022-12-13 20:39:32,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:39:32,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-13 20:39:32,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:39:32,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 20:39:32,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=583, Unknown=24, NotChecked=110, Total=930 [2022-12-13 20:39:32,238 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 477 [2022-12-13 20:39:32,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 568 transitions, 7169 flow. Second operand has 31 states, 31 states have (on average 183.83870967741936) internal successors, (5699), 31 states have internal predecessors, (5699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:39:32,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:39:32,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 477 [2022-12-13 20:39:32,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:39:39,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-12-13 20:39:42,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:39:44,533 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-12-13 20:39:46,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:39:46,883 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1242 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_69| Int) (v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1245 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1242)) |c_~#stored_elements~0.base| v_ArrVal_1243) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_69| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_69| 4) |c_~#queue~0.offset|) v_ArrVal_1245) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1242)))) (forall ((v_ArrVal_1242 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_69| Int) (v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1245 Int)) (let ((.cse4 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1242)) |c_~#stored_elements~0.base| v_ArrVal_1243) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_69| (select .cse4 .cse1))) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_69| 4) |c_~#queue~0.offset|) v_ArrVal_1245) .cse1) 2147483647) (not (<= v_ArrVal_1242 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1)))))))) is different from false [2022-12-13 20:39:46,989 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_69| Int) (v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1245 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1243) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_69| 4) |c_~#queue~0.offset|) v_ArrVal_1245) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_69| (select .cse0 .cse1)))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_69| Int) (v_ArrVal_1245 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_69| (select .cse2 .cse1))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_69| 4) |c_~#queue~0.offset|) v_ArrVal_1245) .cse1) 2147483647)))))) is different from false [2022-12-13 20:39:49,739 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-12-13 20:39:52,485 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-12-13 20:39:58,912 INFO L130 PetriNetUnfolder]: 12875/24747 cut-off events. [2022-12-13 20:39:58,912 INFO L131 PetriNetUnfolder]: For 1568957/1568965 co-relation queries the response was YES. [2022-12-13 20:39:59,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235370 conditions, 24747 events. 12875/24747 cut-off events. For 1568957/1568965 co-relation queries the response was YES. Maximal size of possible extension queue 777. Compared 221207 event pairs, 4511 based on Foata normal form. 511/23509 useless extension candidates. Maximal degree in co-relation 233788. Up to 8484 conditions per place. [2022-12-13 20:39:59,192 INFO L137 encePairwiseOnDemand]: 457/477 looper letters, 596 selfloop transitions, 383 changer transitions 0/983 dead transitions. [2022-12-13 20:39:59,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 983 transitions, 17766 flow [2022-12-13 20:39:59,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 20:39:59,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-13 20:39:59,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 4818 transitions. [2022-12-13 20:39:59,197 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4040251572327044 [2022-12-13 20:39:59,197 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 4818 transitions. [2022-12-13 20:39:59,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 4818 transitions. [2022-12-13 20:39:59,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:39:59,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 4818 transitions. [2022-12-13 20:39:59,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 192.72) internal successors, (4818), 25 states have internal predecessors, (4818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:39:59,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 477.0) internal successors, (12402), 26 states have internal predecessors, (12402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:39:59,209 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 477.0) internal successors, (12402), 26 states have internal predecessors, (12402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:39:59,209 INFO L175 Difference]: Start difference. First operand has 278 places, 568 transitions, 7169 flow. Second operand 25 states and 4818 transitions. [2022-12-13 20:39:59,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 983 transitions, 17766 flow [2022-12-13 20:40:00,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 983 transitions, 17244 flow, removed 239 selfloop flow, removed 10 redundant places. [2022-12-13 20:40:00,257 INFO L231 Difference]: Finished difference. Result has 306 places, 729 transitions, 11476 flow [2022-12-13 20:40:00,257 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=6569, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=211, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=11476, PETRI_PLACES=306, PETRI_TRANSITIONS=729} [2022-12-13 20:40:00,258 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 249 predicate places. [2022-12-13 20:40:00,258 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 729 transitions, 11476 flow [2022-12-13 20:40:00,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 183.83870967741936) internal successors, (5699), 31 states have internal predecessors, (5699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:40:00,258 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:40:00,258 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:40:00,263 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 20:40:00,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:40:00,460 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 20:40:00,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:40:00,461 INFO L85 PathProgramCache]: Analyzing trace with hash 194328060, now seen corresponding path program 2 times [2022-12-13 20:40:00,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:40:00,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556514393] [2022-12-13 20:40:00,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:40:00,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:40:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:00,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:40:00,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:40:00,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556514393] [2022-12-13 20:40:00,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556514393] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:40:00,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978784665] [2022-12-13 20:40:00,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 20:40:00,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:40:00,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:40:00,999 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:40:00,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 20:40:01,175 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 20:40:01,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:40:01,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-13 20:40:01,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:40:01,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:40:01,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:40:01,205 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 20:40:01,205 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-12-13 20:40:01,222 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 20:40:01,223 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-12-13 20:40:01,324 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-12-13 20:40:01,398 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-12-13 20:40:01,561 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-12-13 20:40:01,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:40:01,626 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-12-13 20:40:01,749 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-12-13 20:40:01,899 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-12-13 20:40:02,000 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-12-13 20:40:02,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:40:02,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:40:02,190 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1355 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|) (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1355)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1356) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647)) is different from false [2022-12-13 20:40:02,352 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1353 Int) (v_ArrVal_1355 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1351 (Array Int Int)) (v_ArrVal_1349 Int)) (let ((.cse2 (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_1349)) |c_~#stored_elements~0.base| v_ArrVal_1351))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse0 .cse1))) (not (<= v_ArrVal_1349 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4)) v_ArrVal_1353) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1355)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1356) |c_~#queue~0.base|) .cse1) 2147483647))))) is different from false [2022-12-13 20:40:02,784 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1353 Int) (v_ArrVal_1355 Int) (v_ArrVal_1347 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1351 (Array Int Int)) (v_ArrVal_1349 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_1347) .cse4 v_ArrVal_1349)) |c_~#stored_elements~0.base| v_ArrVal_1351))) (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 (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4)) v_ArrVal_1353) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1355)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1356) |c_~#queue~0.base|) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse1 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1349)))))) is different from false [2022-12-13 20:40:02,819 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1353 Int) (v_ArrVal_1355 Int) (v_ArrVal_1347 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1346 Int) (v_ArrVal_1351 (Array Int Int)) (v_ArrVal_1349 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_1346)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1347) .cse1 v_ArrVal_1349)) |c_~#stored_elements~0.base| v_ArrVal_1351))) (let ((.cse3 (select .cse2 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1349) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4)) v_ArrVal_1353) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1355)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1356) |c_~#queue~0.base|) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse3 .cse4)))))))) is different from false [2022-12-13 20:40:08,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-13 20:40:08,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978784665] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:40:08,978 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:40:08,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 30 [2022-12-13 20:40:08,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210221840] [2022-12-13 20:40:08,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:40:08,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 20:40:08,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:40:08,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 20:40:08,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=535, Unknown=22, NotChecked=220, Total=992 [2022-12-13 20:40:09,459 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 477 [2022-12-13 20:40:09,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 729 transitions, 11476 flow. Second operand has 32 states, 32 states have (on average 183.78125) internal successors, (5881), 32 states have internal predecessors, (5881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:40:09,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:40:09,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 477 [2022-12-13 20:40:09,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:40:25,723 INFO L130 PetriNetUnfolder]: 15017/28609 cut-off events. [2022-12-13 20:40:25,723 INFO L131 PetriNetUnfolder]: For 2736336/2736348 co-relation queries the response was YES. [2022-12-13 20:40:25,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325864 conditions, 28609 events. 15017/28609 cut-off events. For 2736336/2736348 co-relation queries the response was YES. Maximal size of possible extension queue 962. Compared 257758 event pairs, 4586 based on Foata normal form. 156/26727 useless extension candidates. Maximal degree in co-relation 324005. Up to 9082 conditions per place. [2022-12-13 20:40:26,097 INFO L137 encePairwiseOnDemand]: 456/477 looper letters, 539 selfloop transitions, 390 changer transitions 0/933 dead transitions. [2022-12-13 20:40:26,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 933 transitions, 19450 flow [2022-12-13 20:40:26,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 20:40:26,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 20:40:26,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3506 transitions. [2022-12-13 20:40:26,101 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40833915676682975 [2022-12-13 20:40:26,101 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3506 transitions. [2022-12-13 20:40:26,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3506 transitions. [2022-12-13 20:40:26,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:40:26,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3506 transitions. [2022-12-13 20:40:26,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 194.77777777777777) internal successors, (3506), 18 states have internal predecessors, (3506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:40:26,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 477.0) internal successors, (9063), 19 states have internal predecessors, (9063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:40:26,111 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 477.0) internal successors, (9063), 19 states have internal predecessors, (9063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:40:26,112 INFO L175 Difference]: Start difference. First operand has 306 places, 729 transitions, 11476 flow. Second operand 18 states and 3506 transitions. [2022-12-13 20:40:26,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 933 transitions, 19450 flow [2022-12-13 20:40:27,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 933 transitions, 18058 flow, removed 648 selfloop flow, removed 7 redundant places. [2022-12-13 20:40:28,001 INFO L231 Difference]: Finished difference. Result has 326 places, 797 transitions, 13440 flow [2022-12-13 20:40:28,002 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=10242, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=328, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=13440, PETRI_PLACES=326, PETRI_TRANSITIONS=797} [2022-12-13 20:40:28,003 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 269 predicate places. [2022-12-13 20:40:28,003 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 797 transitions, 13440 flow [2022-12-13 20:40:28,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 183.78125) internal successors, (5881), 32 states have internal predecessors, (5881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:40:28,003 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:40:28,004 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:40:28,008 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 20:40:28,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:40:28,204 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 20:40:28,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:40:28,206 INFO L85 PathProgramCache]: Analyzing trace with hash 194328013, now seen corresponding path program 1 times [2022-12-13 20:40:28,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:40:28,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925206916] [2022-12-13 20:40:28,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:40:28,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:40:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:28,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:40:28,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:40:28,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925206916] [2022-12-13 20:40:28,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925206916] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:40:28,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346490587] [2022-12-13 20:40:28,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:40:28,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:40:28,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:40:28,741 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:40:28,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 20:40:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:28,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-13 20:40:28,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:40:28,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:40:28,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:40:28,861 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 20:40:28,861 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-12-13 20:40:28,879 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 20:40:28,879 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-12-13 20:40:29,002 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-12-13 20:40:29,076 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-12-13 20:40:29,246 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 55 treesize of output 48 [2022-12-13 20:40:29,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:40:29,303 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 74 treesize of output 76 [2022-12-13 20:40:29,404 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 92 treesize of output 85 [2022-12-13 20:40:29,498 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 88 treesize of output 83 [2022-12-13 20:40:29,570 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 81 treesize of output 83 [2022-12-13 20:40:29,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:40:29,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:40:29,717 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1463 Int) (v_ArrVal_1464 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1463)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1464) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))) is different from false [2022-12-13 20:40:29,897 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1459 (Array Int Int)) (v_ArrVal_1461 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1463 Int) (v_ArrVal_1464 (Array Int Int))) (let ((.cse2 (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_1459))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (< 0 (+ 2147483650 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1461) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1463)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1464) |c_~#queue~0.base|) .cse1))))))) is different from false [2022-12-13 20:40:29,912 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1459 (Array Int Int)) (v_ArrVal_1461 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1463 Int) (v_ArrVal_1464 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1459))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (< 0 (+ 2147483650 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1461) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1463)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1464) |c_~#queue~0.base|) .cse2))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse1 .cse2))))))) is different from false [2022-12-13 20:40:29,941 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1459 (Array Int Int)) (v_ArrVal_1461 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1463 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1456 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1456) .cse4 (+ (select .cse3 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1459))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (< 0 (+ 2147483650 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1461) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1463)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1464) |c_~#queue~0.base|) .cse2))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse1 .cse2))))))) is different from false [2022-12-13 20:40:29,972 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1459 (Array Int Int)) (v_ArrVal_1461 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1463 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1454 Int) (v_ArrVal_1456 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1454)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1456) .cse4 (+ (select .cse3 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1459))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (< 0 (+ 2147483650 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1461) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1463)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1464) |c_~#queue~0.base|) .cse2))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse1 .cse2))))))) is different from false [2022-12-13 20:40:30,125 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-12-13 20:40:30,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346490587] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:40:30,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:40:30,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 30 [2022-12-13 20:40:30,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535926035] [2022-12-13 20:40:30,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:40:30,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 20:40:30,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:40:30,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 20:40:30,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=549, Unknown=16, NotChecked=270, Total=992 [2022-12-13 20:40:30,291 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 477 [2022-12-13 20:40:30,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 797 transitions, 13440 flow. Second operand has 32 states, 32 states have (on average 183.78125) internal successors, (5881), 32 states have internal predecessors, (5881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:40:30,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:40:30,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 477 [2022-12-13 20:40:30,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:40:37,036 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1459 (Array Int Int)) (v_ArrVal_1461 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1463 Int) (v_ArrVal_1464 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1459))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (< 0 (+ 2147483650 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1461) .cse3 v_ArrVal_1463)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1464) |c_~#queue~0.base|) .cse1))))))) (forall ((v_ArrVal_1461 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1463 Int) (v_ArrVal_1464 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse4 .cse1))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|) v_ArrVal_1461) .cse3 v_ArrVal_1463)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1464) |c_~#queue~0.base|) .cse1) 2147483650))))) (forall ((v_ArrVal_1464 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1464) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse5)))) (< 0 (+ (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse5) 2147483650)))) is different from false [2022-12-13 20:40:47,473 INFO L130 PetriNetUnfolder]: 16246/30896 cut-off events. [2022-12-13 20:40:47,473 INFO L131 PetriNetUnfolder]: For 3618131/3618147 co-relation queries the response was YES. [2022-12-13 20:40:47,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378091 conditions, 30896 events. 16246/30896 cut-off events. For 3618131/3618147 co-relation queries the response was YES. Maximal size of possible extension queue 1081. Compared 281655 event pairs, 4890 based on Foata normal form. 124/29145 useless extension candidates. Maximal degree in co-relation 376120. Up to 11436 conditions per place. [2022-12-13 20:40:47,989 INFO L137 encePairwiseOnDemand]: 456/477 looper letters, 517 selfloop transitions, 469 changer transitions 0/990 dead transitions. [2022-12-13 20:40:47,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 990 transitions, 21379 flow [2022-12-13 20:40:47,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 20:40:47,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 20:40:47,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3687 transitions. [2022-12-13 20:40:47,993 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40681893412777226 [2022-12-13 20:40:47,993 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3687 transitions. [2022-12-13 20:40:47,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3687 transitions. [2022-12-13 20:40:47,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:40:47,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3687 transitions. [2022-12-13 20:40:47,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 194.05263157894737) internal successors, (3687), 19 states have internal predecessors, (3687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:40:48,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 477.0) internal successors, (9540), 20 states have internal predecessors, (9540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:40:48,001 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 477.0) internal successors, (9540), 20 states have internal predecessors, (9540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:40:48,002 INFO L175 Difference]: Start difference. First operand has 326 places, 797 transitions, 13440 flow. Second operand 19 states and 3687 transitions. [2022-12-13 20:40:48,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 990 transitions, 21379 flow [2022-12-13 20:40:51,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 990 transitions, 20148 flow, removed 550 selfloop flow, removed 7 redundant places. [2022-12-13 20:40:51,615 INFO L231 Difference]: Finished difference. Result has 344 places, 875 transitions, 15656 flow [2022-12-13 20:40:51,616 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=12344, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=791, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=386, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=15656, PETRI_PLACES=344, PETRI_TRANSITIONS=875} [2022-12-13 20:40:51,616 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 287 predicate places. [2022-12-13 20:40:51,616 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 875 transitions, 15656 flow [2022-12-13 20:40:51,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 183.78125) internal successors, (5881), 32 states have internal predecessors, (5881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:40:51,617 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:40:51,617 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:40:51,621 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 20:40:51,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:40:51,819 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 20:40:51,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:40:51,820 INFO L85 PathProgramCache]: Analyzing trace with hash -446614098, now seen corresponding path program 1 times [2022-12-13 20:40:51,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:40:51,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920899662] [2022-12-13 20:40:51,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:40:51,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:40:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:51,876 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:40:51,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:40:51,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920899662] [2022-12-13 20:40:51,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920899662] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:40:51,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757331435] [2022-12-13 20:40:51,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:40:51,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:40:51,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:40:51,877 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:40:51,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 20:40:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:52,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 20:40:52,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:40:52,037 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:40:52,037 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:40:52,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757331435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:40:52,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:40:52,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-13 20:40:52,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400883917] [2022-12-13 20:40:52,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:40:52,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:40:52,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:40:52,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:40:52,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:40:52,048 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 477 [2022-12-13 20:40:52,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 875 transitions, 15656 flow. Second operand has 4 states, 4 states have (on average 241.25) internal successors, (965), 4 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:40:52,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:40:52,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 477 [2022-12-13 20:40:52,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:41:03,003 INFO L130 PetriNetUnfolder]: 15823/30366 cut-off events. [2022-12-13 20:41:03,004 INFO L131 PetriNetUnfolder]: For 4037740/4037748 co-relation queries the response was YES. [2022-12-13 20:41:03,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384712 conditions, 30366 events. 15823/30366 cut-off events. For 4037740/4037748 co-relation queries the response was YES. Maximal size of possible extension queue 1079. Compared 279920 event pairs, 6199 based on Foata normal form. 240/28904 useless extension candidates. Maximal degree in co-relation 382633. Up to 27773 conditions per place. [2022-12-13 20:41:03,427 INFO L137 encePairwiseOnDemand]: 474/477 looper letters, 840 selfloop transitions, 10 changer transitions 0/854 dead transitions. [2022-12-13 20:41:03,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 854 transitions, 17384 flow [2022-12-13 20:41:03,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:41:03,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 20:41:03,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1013 transitions. [2022-12-13 20:41:03,429 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5309224318658281 [2022-12-13 20:41:03,429 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1013 transitions. [2022-12-13 20:41:03,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1013 transitions. [2022-12-13 20:41:03,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:41:03,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1013 transitions. [2022-12-13 20:41:03,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 253.25) internal successors, (1013), 4 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:41:03,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 477.0) internal successors, (2385), 5 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:41:03,432 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 477.0) internal successors, (2385), 5 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:41:03,432 INFO L175 Difference]: Start difference. First operand has 344 places, 875 transitions, 15656 flow. Second operand 4 states and 1013 transitions. [2022-12-13 20:41:03,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 854 transitions, 17384 flow [2022-12-13 20:41:06,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 854 transitions, 16226 flow, removed 388 selfloop flow, removed 8 redundant places. [2022-12-13 20:41:06,907 INFO L231 Difference]: Finished difference. Result has 338 places, 843 transitions, 13928 flow [2022-12-13 20:41:06,907 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=13908, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=843, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=833, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=13928, PETRI_PLACES=338, PETRI_TRANSITIONS=843} [2022-12-13 20:41:06,907 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 281 predicate places. [2022-12-13 20:41:06,907 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 843 transitions, 13928 flow [2022-12-13 20:41:06,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 241.25) internal successors, (965), 4 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:41:06,908 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:41:06,908 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:41:06,912 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 20:41:07,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-13 20:41:07,109 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 20:41:07,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:41:07,110 INFO L85 PathProgramCache]: Analyzing trace with hash -446614097, now seen corresponding path program 1 times [2022-12-13 20:41:07,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:41:07,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004678486] [2022-12-13 20:41:07,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:41:07,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:41:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:41:07,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 20:41:07,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:41:07,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004678486] [2022-12-13 20:41:07,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004678486] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:41:07,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:41:07,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:41:07,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845093576] [2022-12-13 20:41:07,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:41:07,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:41:07,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:41:07,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:41:07,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:41:07,188 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 477 [2022-12-13 20:41:07,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 843 transitions, 13928 flow. Second operand has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:41:07,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:41:07,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 477 [2022-12-13 20:41:07,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:41:16,241 INFO L130 PetriNetUnfolder]: 15390/29840 cut-off events. [2022-12-13 20:41:16,241 INFO L131 PetriNetUnfolder]: For 3226932/3226940 co-relation queries the response was YES. [2022-12-13 20:41:16,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348752 conditions, 29840 events. 15390/29840 cut-off events. For 3226932/3226940 co-relation queries the response was YES. Maximal size of possible extension queue 1072. Compared 277617 event pairs, 7596 based on Foata normal form. 320/28544 useless extension candidates. Maximal degree in co-relation 346767. Up to 16881 conditions per place. [2022-12-13 20:41:16,848 INFO L137 encePairwiseOnDemand]: 473/477 looper letters, 731 selfloop transitions, 87 changer transitions 0/822 dead transitions. [2022-12-13 20:41:16,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 822 transitions, 15396 flow [2022-12-13 20:41:16,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:41:16,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:41:16,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 760 transitions. [2022-12-13 20:41:16,850 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5310971348707197 [2022-12-13 20:41:16,850 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 760 transitions. [2022-12-13 20:41:16,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 760 transitions. [2022-12-13 20:41:16,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:41:16,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 760 transitions. [2022-12-13 20:41:16,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:41:16,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 477.0) internal successors, (1908), 4 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:41:16,852 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 477.0) internal successors, (1908), 4 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:41:16,852 INFO L175 Difference]: Start difference. First operand has 338 places, 843 transitions, 13928 flow. Second operand 3 states and 760 transitions. [2022-12-13 20:41:16,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 822 transitions, 15396 flow [2022-12-13 20:41:19,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 822 transitions, 15339 flow, removed 23 selfloop flow, removed 2 redundant places. [2022-12-13 20:41:19,303 INFO L231 Difference]: Finished difference. Result has 337 places, 814 transitions, 13555 flow [2022-12-13 20:41:19,304 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=13381, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=814, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=727, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=13555, PETRI_PLACES=337, PETRI_TRANSITIONS=814} [2022-12-13 20:41:19,304 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 280 predicate places. [2022-12-13 20:41:19,304 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 814 transitions, 13555 flow [2022-12-13 20:41:19,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:41:19,304 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:41:19,304 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] [2022-12-13 20:41:19,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 20:41:19,305 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 20:41:19,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:41:19,305 INFO L85 PathProgramCache]: Analyzing trace with hash 685200213, now seen corresponding path program 1 times [2022-12-13 20:41:19,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:41:19,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172244280] [2022-12-13 20:41:19,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:41:19,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:41:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:41:19,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:41:19,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:41:19,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172244280] [2022-12-13 20:41:19,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172244280] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:41:19,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220921784] [2022-12-13 20:41:19,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:41:19,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:41:19,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:41:19,339 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:41:19,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 20:41:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:41:19,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 20:41:19,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:41:19,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:41:19,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:41:19,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:41:19,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220921784] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:41:19,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:41:19,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 20:41:19,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776562083] [2022-12-13 20:41:19,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:41:19,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 20:41:19,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:41:19,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 20:41:19,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:41:19,523 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 477 [2022-12-13 20:41:19,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 814 transitions, 13555 flow. Second operand has 7 states, 7 states have (on average 241.14285714285714) internal successors, (1688), 7 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:41:19,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:41:19,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 477 [2022-12-13 20:41:19,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:41:25,427 INFO L130 PetriNetUnfolder]: 9465/17696 cut-off events. [2022-12-13 20:41:25,427 INFO L131 PetriNetUnfolder]: For 1992538/1992546 co-relation queries the response was YES. [2022-12-13 20:41:25,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249911 conditions, 17696 events. 9465/17696 cut-off events. For 1992538/1992546 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 133782 event pairs, 2262 based on Foata normal form. 493/17835 useless extension candidates. Maximal degree in co-relation 247998. Up to 6965 conditions per place. [2022-12-13 20:41:25,657 INFO L137 encePairwiseOnDemand]: 473/477 looper letters, 787 selfloop transitions, 52 changer transitions 0/843 dead transitions. [2022-12-13 20:41:25,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 843 transitions, 16147 flow [2022-12-13 20:41:25,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:41:25,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 20:41:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1514 transitions. [2022-12-13 20:41:25,660 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5290006988120196 [2022-12-13 20:41:25,660 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1514 transitions. [2022-12-13 20:41:25,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1514 transitions. [2022-12-13 20:41:25,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:41:25,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1514 transitions. [2022-12-13 20:41:25,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 252.33333333333334) internal successors, (1514), 6 states have internal predecessors, (1514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:41:25,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 477.0) internal successors, (3339), 7 states have internal predecessors, (3339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:41:25,662 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 477.0) internal successors, (3339), 7 states have internal predecessors, (3339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:41:25,662 INFO L175 Difference]: Start difference. First operand has 337 places, 814 transitions, 13555 flow. Second operand 6 states and 1514 transitions. [2022-12-13 20:41:25,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 843 transitions, 16147 flow [2022-12-13 20:41:27,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 843 transitions, 15989 flow, removed 26 selfloop flow, removed 1 redundant places. [2022-12-13 20:41:27,613 INFO L231 Difference]: Finished difference. Result has 345 places, 785 transitions, 12779 flow [2022-12-13 20:41:27,613 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=12353, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=772, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=723, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12779, PETRI_PLACES=345, PETRI_TRANSITIONS=785} [2022-12-13 20:41:27,613 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 288 predicate places. [2022-12-13 20:41:27,613 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 785 transitions, 12779 flow [2022-12-13 20:41:27,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 241.14285714285714) internal successors, (1688), 7 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:41:27,614 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:41:27,614 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 20:41:27,618 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 20:41:27,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-13 20:41:27,815 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 20:41:27,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:41:27,815 INFO L85 PathProgramCache]: Analyzing trace with hash 70523137, now seen corresponding path program 5 times [2022-12-13 20:41:27,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:41:27,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314552188] [2022-12-13 20:41:27,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:41:27,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:41:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:41:29,021 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:41:29,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:41:29,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314552188] [2022-12-13 20:41:29,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314552188] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:41:29,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820799843] [2022-12-13 20:41:29,022 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 20:41:29,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:41:29,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:41:29,022 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:41:29,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f88f85f9-e6dd-4529-8a81-151f23b0b107/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 20:41:29,166 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 20:41:29,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:41:29,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 104 conjunts are in the unsatisfiable core [2022-12-13 20:41:29,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:41:29,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:41:29,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:41:29,194 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 20:41:29,194 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-12-13 20:41:29,209 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 20:41:29,210 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-12-13 20:41:29,362 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-12-13 20:41:29,494 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-12-13 20:41:29,669 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-12-13 20:41:29,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:41:29,753 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-12-13 20:41:29,936 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-12-13 20:41:30,345 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 61 treesize of output 61 [2022-12-13 20:41:30,496 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-12-13 20:41:31,131 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-12-13 20:41:32,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:41:32,614 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-12-13 20:41:35,825 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-12-13 20:41:40,022 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:41:40,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:41:40,132 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1801 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| Int) (v_ArrVal_1802 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1801) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| 4) |c_~#queue~0.offset|) v_ArrVal_1802) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-12-13 20:41:40,152 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1801 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| Int) (v_ArrVal_1800 Int) (v_ArrVal_1802 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1800)) |c_~#stored_elements~0.base| v_ArrVal_1801) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| 4) |c_~#queue~0.offset|) v_ArrVal_1802) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_1800 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1)))))) is different from false [2022-12-13 20:41:40,169 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1801 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| Int) (v_ArrVal_1800 Int) (v_ArrVal_1802 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_1800)) |c_~#stored_elements~0.base| v_ArrVal_1801) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| 4) |c_~#queue~0.offset|) v_ArrVal_1802) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1800))))) is different from false [2022-12-13 20:41:40,205 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1801 (Array Int Int)) (v_ArrVal_1798 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| Int) (v_ArrVal_1800 Int) (v_ArrVal_1802 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 (store .cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1798) .cse2 v_ArrVal_1800)) |c_~#stored_elements~0.base| v_ArrVal_1801) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| 4) |c_~#queue~0.offset|) v_ArrVal_1802) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (not (<= v_ArrVal_1798 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1800))))) is different from false [2022-12-13 20:41:40,234 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1801 (Array Int Int)) (v_ArrVal_1796 (Array Int Int)) (v_ArrVal_1798 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| Int) (v_ArrVal_1800 Int) (v_ArrVal_1802 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1796))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1798) .cse1 v_ArrVal_1800)) |c_~#stored_elements~0.base| v_ArrVal_1801) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1800) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| 4) |c_~#queue~0.offset|) v_ArrVal_1802) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_1798 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| (select .cse2 (+ |c_~#queue~0.offset| 3204))))))))) is different from false [2022-12-13 20:41:40,264 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1801 (Array Int Int)) (v_ArrVal_1796 (Array Int Int)) (v_ArrVal_1798 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| Int) (v_ArrVal_1800 Int) (v_ArrVal_1802 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1796))) (let ((.cse0 (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse3 v_ArrVal_1798) .cse1 v_ArrVal_1800)) |c_~#stored_elements~0.base| v_ArrVal_1801) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1800) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| 4) |c_~#queue~0.offset|) v_ArrVal_1802) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ 1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse3)) v_ArrVal_1798) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| (select .cse2 (+ |c_~#queue~0.offset| 3204))))))))) is different from false [2022-12-13 20:41:40,303 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1801 (Array Int Int)) (v_ArrVal_1794 Int) (v_ArrVal_1796 (Array Int Int)) (v_ArrVal_1798 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| Int) (v_ArrVal_1800 Int) (v_ArrVal_1802 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1794))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| .cse3) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1796))) (let ((.cse1 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse4 v_ArrVal_1798) .cse2 v_ArrVal_1800)) |c_~#stored_elements~0.base| v_ArrVal_1801) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| 4) |c_~#queue~0.offset|) v_ArrVal_1802) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1800) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1798) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| (select .cse0 (+ |c_~#queue~0.offset| 3204)))))))))) is different from false [2022-12-13 20:41:40,335 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1801 (Array Int Int)) (v_ArrVal_1794 Int) (v_ArrVal_1796 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| Int) (v_ArrVal_1798 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| Int) (v_ArrVal_1800 Int) (v_ArrVal_1802 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| 4) |c_~#queue~0.offset|) v_ArrVal_1794))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| .cse0) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1796))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1798) .cse3 v_ArrVal_1800)) |c_~#stored_elements~0.base| v_ArrVal_1801) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1798) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| (select .cse4 .cse3))) (< (+ (select .cse5 .cse3) 1) v_ArrVal_1800) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| 4) |c_~#queue~0.offset|) v_ArrVal_1802) .cse1) 2147483647)))))))) is different from false [2022-12-13 20:41:40,367 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1801 (Array Int Int)) (v_ArrVal_1794 Int) (v_ArrVal_1796 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| Int) (v_ArrVal_1793 (Array Int Int)) (v_ArrVal_1798 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| Int) (v_ArrVal_1800 Int) (v_ArrVal_1802 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1793))) (let ((.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| 4) |c_~#queue~0.offset|) v_ArrVal_1794))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| .cse5) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1796))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_1798) .cse1 v_ArrVal_1800)) |c_~#stored_elements~0.base| v_ArrVal_1801) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| (select .cse2 .cse1))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| 4) |c_~#queue~0.offset|) v_ArrVal_1802) .cse3) 2147483647) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1800) (< (+ (select .cse5 .cse3) 1) v_ArrVal_1798))))))))) is different from false [2022-12-13 20:41:40,408 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1801 (Array Int Int)) (v_ArrVal_1792 Int) (v_ArrVal_1794 Int) (v_ArrVal_1796 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| Int) (v_ArrVal_1793 (Array Int Int)) (v_ArrVal_1798 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| Int) (v_ArrVal_1800 Int) (v_ArrVal_1802 Int)) (let ((.cse7 (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_1792)) |c_~#stored_elements~0.base| v_ArrVal_1793))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| 4) |c_~#queue~0.offset|) v_ArrVal_1794))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| .cse4) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1796))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1798) .cse2 v_ArrVal_1800)) |c_~#stored_elements~0.base| v_ArrVal_1801) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| 4) |c_~#queue~0.offset|) v_ArrVal_1802) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| (select .cse0 .cse2))) (not (<= v_ArrVal_1792 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| (select .cse3 .cse2))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1798) (< (+ (select .cse5 .cse2) 1) v_ArrVal_1800))))))))) is different from false [2022-12-13 20:41:40,454 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1801 (Array Int Int)) (v_ArrVal_1792 Int) (v_ArrVal_1794 Int) (v_ArrVal_1796 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| Int) (v_ArrVal_1793 (Array Int Int)) (v_ArrVal_1798 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| Int) (v_ArrVal_1800 Int) (v_ArrVal_1802 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1792)) |c_~#stored_elements~0.base| v_ArrVal_1793))) (let ((.cse5 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| 4) |c_~#queue~0.offset|) v_ArrVal_1794))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| .cse6) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1796))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse3 v_ArrVal_1798) .cse4 v_ArrVal_1800)) |c_~#stored_elements~0.base| v_ArrVal_1801) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1792) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| 4) |c_~#queue~0.offset|) v_ArrVal_1802) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| (select .cse2 .cse4))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| (select .cse5 .cse4))) (< (+ (select .cse6 .cse3) 1) v_ArrVal_1798) (< (+ (select .cse7 .cse4) 1) v_ArrVal_1800)))))))))) is different from false [2022-12-13 20:41:40,545 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1801 (Array Int Int)) (v_ArrVal_1790 Int) (v_ArrVal_1792 Int) (v_ArrVal_1794 Int) (v_ArrVal_1796 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| Int) (v_ArrVal_1793 (Array Int Int)) (v_ArrVal_1798 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| Int) (v_ArrVal_1800 Int) (v_ArrVal_1802 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1790) .cse1 v_ArrVal_1792)) |c_~#stored_elements~0.base| v_ArrVal_1793))) (let ((.cse5 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| 4) |c_~#queue~0.offset|) v_ArrVal_1794))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| .cse6) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1796))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse3 v_ArrVal_1798) .cse4 v_ArrVal_1800)) |c_~#stored_elements~0.base| v_ArrVal_1801) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1792) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| 4) |c_~#queue~0.offset|) v_ArrVal_1802) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| (select .cse2 .cse4))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| (select .cse5 .cse4))) (not (<= v_ArrVal_1790 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ 1 (select .cse6 .cse3)) v_ArrVal_1798) (< (+ (select .cse7 .cse4) 1) v_ArrVal_1800)))))))))) is different from false [2022-12-13 20:41:40,603 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1801 (Array Int Int)) (v_ArrVal_1790 Int) (v_ArrVal_1792 Int) (v_ArrVal_1794 Int) (v_ArrVal_1796 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| Int) (v_ArrVal_1793 (Array Int Int)) (v_ArrVal_1798 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| Int) (v_ArrVal_1800 Int) (v_ArrVal_1802 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse5 v_ArrVal_1790) .cse1 v_ArrVal_1792)) |c_~#stored_elements~0.base| v_ArrVal_1793))) (let ((.cse6 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| 4) |c_~#queue~0.offset|) v_ArrVal_1794))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| .cse7) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1796))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .cse3 v_ArrVal_1798) .cse4 v_ArrVal_1800)) |c_~#stored_elements~0.base| v_ArrVal_1801) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1792) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| 4) |c_~#queue~0.offset|) v_ArrVal_1802) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| (select .cse2 .cse4))) (< (+ 1 (select .cse0 .cse5)) v_ArrVal_1790) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| (select .cse6 .cse4))) (< (+ 1 (select .cse7 .cse3)) v_ArrVal_1798) (< (+ (select .cse8 .cse4) 1) v_ArrVal_1800)))))))))) is different from false [2022-12-13 20:41:40,670 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1801 (Array Int Int)) (v_ArrVal_1796 (Array Int Int)) (v_ArrVal_1793 (Array Int Int)) (v_ArrVal_1790 Int) (v_ArrVal_1792 Int) (v_ArrVal_1794 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| Int) (v_ArrVal_1798 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| Int) (v_ArrVal_1800 Int) (v_ArrVal_1788 Int) (v_ArrVal_1802 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_1788)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_1790) .cse4 v_ArrVal_1792)) |c_~#stored_elements~0.base| v_ArrVal_1793))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| 4) |c_~#queue~0.offset|) v_ArrVal_1794))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| .cse7) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1796))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse0 .cse6 v_ArrVal_1798) .cse1 v_ArrVal_1800)) |c_~#stored_elements~0.base| v_ArrVal_1801) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1800) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1790) (< (+ (select .cse2 .cse4) 1) v_ArrVal_1792) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| 4) |c_~#queue~0.offset|) v_ArrVal_1802) .cse6) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| (select .cse5 .cse1))) (< (+ (select .cse7 .cse6) 1) v_ArrVal_1798) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| (select .cse8 .cse1)))))))))))) is different from false [2022-12-13 20:41:43,034 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-12-13 20:41:43,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820799843] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:41:43,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:41:43,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 18] total 54 [2022-12-13 20:41:43,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774126213] [2022-12-13 20:41:43,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:41:43,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-12-13 20:41:43,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:41:43,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-12-13 20:41:43,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=430, Invalid=1333, Unknown=15, NotChecked=1302, Total=3080 [2022-12-13 20:41:45,489 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-12-13 20:41:45,679 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 477 [2022-12-13 20:41:45,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 785 transitions, 12779 flow. Second operand has 56 states, 56 states have (on average 171.28571428571428) internal successors, (9592), 56 states have internal predecessors, (9592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:41:45,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:41:45,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 477 [2022-12-13 20:41:45,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:41:53,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:41:55,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:42:02,751 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-12-13 20:42:04,759 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-12-13 20:42:18,502 WARN L233 SmtUtils]: Spent 8.19s on a formula simplification. DAG size of input: 164 DAG size of output: 151 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:42:20,635 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-12-13 20:42:25,232 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-12-13 20:42:35,664 WARN L233 SmtUtils]: Spent 8.28s on a formula simplification. DAG size of input: 168 DAG size of output: 154 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:42:37,671 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-12-13 20:42:39,678 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-12-13 20:42:41,683 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-12-13 20:42:43,691 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-12-13 20:42:45,698 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-12-13 20:42:47,705 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-12-13 20:42:49,711 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-12-13 20:42:51,720 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-12-13 20:42:53,731 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-12-13 20:42:55,737 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-12-13 20:43:04,772 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-12-13 20:43:17,672 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-12-13 20:43:19,680 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-12-13 20:43:21,690 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-12-13 20:43:23,698 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-12-13 20:43:25,705 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-12-13 20:43:27,712 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-12-13 20:43:29,724 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-12-13 20:43:31,731 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-12-13 20:43:33,748 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-12-13 20:43:35,755 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-12-13 20:43:37,761 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-12-13 20:43:39,768 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-12-13 20:43:41,774 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-12-13 20:43:55,102 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-12-13 20:44:06,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-12-13 20:44:08,702 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-12-13 20:44:10,721 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-12-13 20:44:15,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 20:44:16,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 20:44:30,069 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-12-13 20:44:55,698 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-12-13 20:46:17,735 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-12-13 20:46:19,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, 1]