./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_ok.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_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/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_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/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_0f323e2c-376a-4316-8a30-7140717dff8c/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 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- 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 13:05:44,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:05:44,338 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:05:44,355 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:05:44,355 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:05:44,356 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:05:44,357 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:05:44,359 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:05:44,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:05:44,361 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:05:44,362 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:05:44,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:05:44,363 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:05:44,364 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:05:44,365 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:05:44,366 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:05:44,366 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:05:44,367 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:05:44,369 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:05:44,370 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:05:44,371 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:05:44,373 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:05:44,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:05:44,375 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:05:44,378 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:05:44,378 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:05:44,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:05:44,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:05:44,380 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:05:44,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:05:44,381 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:05:44,382 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:05:44,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:05:44,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:05:44,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:05:44,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:05:44,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:05:44,385 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:05:44,385 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:05:44,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:05:44,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:05:44,387 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-12-13 13:05:44,406 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:05:44,406 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:05:44,406 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:05:44,407 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:05:44,407 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 13:05:44,407 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 13:05:44,408 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:05:44,408 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:05:44,408 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:05:44,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:05:44,409 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:05:44,409 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 13:05:44,409 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:05:44,409 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:05:44,409 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:05:44,410 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:05:44,410 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:05:44,410 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:05:44,410 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 13:05:44,410 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:05:44,410 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:05:44,410 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:05:44,411 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:05:44,411 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:05:44,411 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:05:44,411 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:05:44,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:05:44,411 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:05:44,412 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:05:44,412 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:05:44,412 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:05:44,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:05:44,412 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 13:05:44,412 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 13:05:44,412 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 13:05:44,413 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 13:05:44,413 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 13:05:44,413 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_0f323e2c-376a-4316-8a30-7140717dff8c/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_0f323e2c-376a-4316-8a30-7140717dff8c/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 -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 [2022-12-13 13:05:44,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:05:44,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:05:44,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:05:44,635 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:05:44,636 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:05:44,636 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread/queue_ok.i [2022-12-13 13:05:47,279 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:05:47,522 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:05:47,523 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/sv-benchmarks/c/pthread/queue_ok.i [2022-12-13 13:05:47,535 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/data/c344a1353/f2f778712dda4b56a4c73eebdb5039c4/FLAG5859f5dfa [2022-12-13 13:05:47,549 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/data/c344a1353/f2f778712dda4b56a4c73eebdb5039c4 [2022-12-13 13:05:47,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:05:47,553 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:05:47,554 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:05:47,554 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:05:47,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:05:47,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:05:47" (1/1) ... [2022-12-13 13:05:47,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a13fbea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:05:47, skipping insertion in model container [2022-12-13 13:05:47,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:05:47" (1/1) ... [2022-12-13 13:05:47,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:05:47,601 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:05:48,007 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_0f323e2c-376a-4316-8a30-7140717dff8c/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-12-13 13:05:48,010 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_0f323e2c-376a-4316-8a30-7140717dff8c/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-12-13 13:05:48,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:05:48,026 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:05:48,069 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_0f323e2c-376a-4316-8a30-7140717dff8c/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-12-13 13:05:48,072 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_0f323e2c-376a-4316-8a30-7140717dff8c/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-12-13 13:05:48,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:05:48,117 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:05:48,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:05:48 WrapperNode [2022-12-13 13:05:48,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:05:48,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:05:48,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:05:48,119 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:05:48,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:05:48" (1/1) ... [2022-12-13 13:05:48,157 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:05:48" (1/1) ... [2022-12-13 13:05:48,177 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 214 [2022-12-13 13:05:48,178 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:05:48,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:05:48,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:05:48,178 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:05:48,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:05:48" (1/1) ... [2022-12-13 13:05:48,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:05:48" (1/1) ... [2022-12-13 13:05:48,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:05:48" (1/1) ... [2022-12-13 13:05:48,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:05:48" (1/1) ... [2022-12-13 13:05:48,204 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:05:48" (1/1) ... [2022-12-13 13:05:48,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:05:48" (1/1) ... [2022-12-13 13:05:48,208 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:05:48" (1/1) ... [2022-12-13 13:05:48,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:05:48" (1/1) ... [2022-12-13 13:05:48,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:05:48,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:05:48,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:05:48,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:05:48,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:05:48" (1/1) ... [2022-12-13 13:05:48,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:05:48,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:05:48,238 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:05:48,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:05:48,274 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-13 13:05:48,274 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-13 13:05:48,275 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-13 13:05:48,275 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-13 13:05:48,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:05:48,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:05:48,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 13:05:48,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:05:48,275 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 13:05:48,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:05:48,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:05:48,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:05:48,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:05:48,277 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 13:05:48,389 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:05:48,391 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:05:48,657 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:05:48,665 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:05:48,666 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 13:05:48,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:05:48 BoogieIcfgContainer [2022-12-13 13:05:48,668 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:05:48,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:05:48,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:05:48,672 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:05:48,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:05:47" (1/3) ... [2022-12-13 13:05:48,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d2afcd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:05:48, skipping insertion in model container [2022-12-13 13:05:48,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:05:48" (2/3) ... [2022-12-13 13:05:48,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d2afcd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:05:48, skipping insertion in model container [2022-12-13 13:05:48,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:05:48" (3/3) ... [2022-12-13 13:05:48,674 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-12-13 13:05:48,681 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 13:05:48,689 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:05:48,689 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-12-13 13:05:48,689 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 13:05:48,758 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 13:05:48,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 251 transitions, 518 flow [2022-12-13 13:05:48,846 INFO L130 PetriNetUnfolder]: 13/249 cut-off events. [2022-12-13 13:05:48,846 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 13:05:48,852 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 13:05:48,852 INFO L82 GeneralOperation]: Start removeDead. Operand has 245 places, 251 transitions, 518 flow [2022-12-13 13:05:48,856 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 239 transitions, 487 flow [2022-12-13 13:05:48,859 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 13:05:48,866 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 233 places, 239 transitions, 487 flow [2022-12-13 13:05:48,868 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 233 places, 239 transitions, 487 flow [2022-12-13 13:05:48,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 239 transitions, 487 flow [2022-12-13 13:05:48,905 INFO L130 PetriNetUnfolder]: 13/239 cut-off events. [2022-12-13 13:05:48,905 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 13:05:48,906 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 13:05:48,910 INFO L119 LiptonReduction]: Number of co-enabled transitions 14376 [2022-12-13 13:05:56,202 INFO L134 LiptonReduction]: Checked pairs total: 29129 [2022-12-13 13:05:56,202 INFO L136 LiptonReduction]: Total number of compositions: 226 [2022-12-13 13:05:56,212 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:05:56,216 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;@d69cbec, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 13:05:56,217 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-12-13 13:05:56,220 INFO L130 PetriNetUnfolder]: 1/18 cut-off events. [2022-12-13 13:05:56,220 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 13:05:56,220 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:05:56,220 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:05:56,221 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 13:05:56,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:05:56,224 INFO L85 PathProgramCache]: Analyzing trace with hash 336045671, now seen corresponding path program 1 times [2022-12-13 13:05:56,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:05:56,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996095386] [2022-12-13 13:05:56,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:05:56,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:05:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:05:56,903 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 13:05:56,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:05:56,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996095386] [2022-12-13 13:05:56,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996095386] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:05:56,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:05:56,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:05:56,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400908692] [2022-12-13 13:05:56,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:05:56,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:05:56,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:05:56,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:05:56,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:05:57,124 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 477 [2022-12-13 13:05:57,126 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 13:05:57,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:05:57,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 477 [2022-12-13 13:05:57,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:05:57,438 INFO L130 PetriNetUnfolder]: 1558/2568 cut-off events. [2022-12-13 13:05:57,438 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2022-12-13 13:05:57,441 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 13:05:57,451 INFO L137 encePairwiseOnDemand]: 470/477 looper letters, 57 selfloop transitions, 7 changer transitions 0/69 dead transitions. [2022-12-13 13:05:57,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 69 transitions, 275 flow [2022-12-13 13:05:57,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:05:57,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:05:57,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1191 transitions. [2022-12-13 13:05:57,466 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49937106918238994 [2022-12-13 13:05:57,466 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1191 transitions. [2022-12-13 13:05:57,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1191 transitions. [2022-12-13 13:05:57,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:05:57,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1191 transitions. [2022-12-13 13:05:57,476 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 13:05:57,483 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 13:05:57,485 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 13:05:57,486 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 123 flow. Second operand 5 states and 1191 transitions. [2022-12-13 13:05:57,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 69 transitions, 275 flow [2022-12-13 13:05:57,489 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 13:05:57,491 INFO L231 Difference]: Finished difference. Result has 61 places, 63 transitions, 165 flow [2022-12-13 13:05:57,492 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 13:05:57,495 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 4 predicate places. [2022-12-13 13:05:57,496 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 165 flow [2022-12-13 13:05:57,496 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 13:05:57,496 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:05:57,496 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:05:57,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:05:57,497 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 13:05:57,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:05:57,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1827228268, now seen corresponding path program 1 times [2022-12-13 13:05:57,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:05:57,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544343059] [2022-12-13 13:05:57,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:05:57,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:05:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:05:57,887 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 13:05:57,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:05:57,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544343059] [2022-12-13 13:05:57,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544343059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:05:57,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:05:57,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:05:57,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944530087] [2022-12-13 13:05:57,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:05:57,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:05:57,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:05:57,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:05:57,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:05:58,118 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 477 [2022-12-13 13:05:58,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 63 transitions, 165 flow. Second operand has 6 states, 6 states have (on average 222.33333333333334) internal successors, (1334), 6 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:05:58,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:05:58,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 477 [2022-12-13 13:05:58,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:05:58,670 INFO L130 PetriNetUnfolder]: 2736/4505 cut-off events. [2022-12-13 13:05:58,670 INFO L131 PetriNetUnfolder]: For 161/161 co-relation queries the response was YES. [2022-12-13 13:05:58,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9339 conditions, 4505 events. 2736/4505 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 25746 event pairs, 403 based on Foata normal form. 0/3292 useless extension candidates. Maximal degree in co-relation 6901. Up to 2533 conditions per place. [2022-12-13 13:05:58,687 INFO L137 encePairwiseOnDemand]: 465/477 looper letters, 126 selfloop transitions, 18 changer transitions 0/149 dead transitions. [2022-12-13 13:05:58,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 149 transitions, 644 flow [2022-12-13 13:05:58,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:05:58,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:05:58,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1246 transitions. [2022-12-13 13:05:58,690 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5224318658280922 [2022-12-13 13:05:58,690 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1246 transitions. [2022-12-13 13:05:58,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1246 transitions. [2022-12-13 13:05:58,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:05:58,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1246 transitions. [2022-12-13 13:05:58,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 249.2) internal successors, (1246), 5 states have internal predecessors, (1246), 0 states have call successors, (0), 0 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 13:05:58,695 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 13:05:58,696 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 13:05:58,696 INFO L175 Difference]: Start difference. First operand has 61 places, 63 transitions, 165 flow. Second operand 5 states and 1246 transitions. [2022-12-13 13:05:58,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 149 transitions, 644 flow [2022-12-13 13:05:58,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 149 transitions, 644 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 13:05:58,702 INFO L231 Difference]: Finished difference. Result has 68 places, 76 transitions, 291 flow [2022-12-13 13:05:58,702 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=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=291, PETRI_PLACES=68, PETRI_TRANSITIONS=76} [2022-12-13 13:05:58,703 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 11 predicate places. [2022-12-13 13:05:58,703 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 76 transitions, 291 flow [2022-12-13 13:05:58,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 222.33333333333334) internal successors, (1334), 6 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:05:58,703 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:05:58,704 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:05:58,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:05:58,704 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 13:05:58,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:05:58,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1827483089, now seen corresponding path program 1 times [2022-12-13 13:05:58,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:05:58,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745849019] [2022-12-13 13:05:58,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:05:58,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:05:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:05:59,070 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 13:05:59,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:05:59,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745849019] [2022-12-13 13:05:59,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745849019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:05:59,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:05:59,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:05:59,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113000552] [2022-12-13 13:05:59,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:05:59,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:05:59,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:05:59,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:05:59,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:05:59,297 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 477 [2022-12-13 13:05:59,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 76 transitions, 291 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 13:05:59,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:05:59,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 477 [2022-12-13 13:05:59,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:05:59,803 INFO L130 PetriNetUnfolder]: 2801/4634 cut-off events. [2022-12-13 13:05:59,803 INFO L131 PetriNetUnfolder]: For 1315/1315 co-relation queries the response was YES. [2022-12-13 13:05:59,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10810 conditions, 4634 events. 2801/4634 cut-off events. For 1315/1315 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 26618 event pairs, 771 based on Foata normal form. 93/3536 useless extension candidates. Maximal degree in co-relation 8350. Up to 3517 conditions per place. [2022-12-13 13:05:59,821 INFO L137 encePairwiseOnDemand]: 470/477 looper letters, 119 selfloop transitions, 14 changer transitions 0/138 dead transitions. [2022-12-13 13:05:59,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 138 transitions, 700 flow [2022-12-13 13:05:59,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:05:59,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:05:59,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1232 transitions. [2022-12-13 13:05:59,824 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5165618448637317 [2022-12-13 13:05:59,824 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1232 transitions. [2022-12-13 13:05:59,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1232 transitions. [2022-12-13 13:05:59,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:05:59,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1232 transitions. [2022-12-13 13:05:59,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 246.4) internal successors, (1232), 5 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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 13:05:59,829 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 13:05:59,830 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 13:05:59,830 INFO L175 Difference]: Start difference. First operand has 68 places, 76 transitions, 291 flow. Second operand 5 states and 1232 transitions. [2022-12-13 13:05:59,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 138 transitions, 700 flow [2022-12-13 13:05:59,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 138 transitions, 686 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-12-13 13:05:59,838 INFO L231 Difference]: Finished difference. Result has 73 places, 79 transitions, 341 flow [2022-12-13 13:05:59,838 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=341, PETRI_PLACES=73, PETRI_TRANSITIONS=79} [2022-12-13 13:05:59,839 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 16 predicate places. [2022-12-13 13:05:59,839 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 79 transitions, 341 flow [2022-12-13 13:05:59,840 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 13:05:59,840 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:05:59,840 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:05:59,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:05:59,840 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 13:05:59,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:05:59,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1139052889, now seen corresponding path program 1 times [2022-12-13 13:05:59,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:05:59,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468098903] [2022-12-13 13:05:59,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:05:59,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:05:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:05:59,884 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 13:05:59,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:05:59,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468098903] [2022-12-13 13:05:59,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468098903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:05:59,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:05:59,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:05:59,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398044679] [2022-12-13 13:05:59,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:05:59,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:05:59,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:05:59,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:05:59,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:05:59,900 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 477 [2022-12-13 13:05:59,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 79 transitions, 341 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 13:05:59,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:05:59,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 477 [2022-12-13 13:05:59,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:06:00,567 INFO L130 PetriNetUnfolder]: 4846/7809 cut-off events. [2022-12-13 13:06:00,567 INFO L131 PetriNetUnfolder]: For 3759/3759 co-relation queries the response was YES. [2022-12-13 13:06:00,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18666 conditions, 7809 events. 4846/7809 cut-off events. For 3759/3759 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 47208 event pairs, 2364 based on Foata normal form. 0/5738 useless extension candidates. Maximal degree in co-relation 14700. Up to 4707 conditions per place. [2022-12-13 13:06:00,595 INFO L137 encePairwiseOnDemand]: 470/477 looper letters, 160 selfloop transitions, 4 changer transitions 0/168 dead transitions. [2022-12-13 13:06:00,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 168 transitions, 1042 flow [2022-12-13 13:06:00,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:06:00,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:06:00,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1050 transitions. [2022-12-13 13:06:00,597 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.550314465408805 [2022-12-13 13:06:00,597 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1050 transitions. [2022-12-13 13:06:00,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1050 transitions. [2022-12-13 13:06:00,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:06:00,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1050 transitions. [2022-12-13 13:06:00,599 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 13:06:00,601 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 13:06:00,602 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 13:06:00,602 INFO L175 Difference]: Start difference. First operand has 73 places, 79 transitions, 341 flow. Second operand 4 states and 1050 transitions. [2022-12-13 13:06:00,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 168 transitions, 1042 flow [2022-12-13 13:06:00,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 168 transitions, 1024 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:06:00,607 INFO L231 Difference]: Finished difference. Result has 77 places, 82 transitions, 364 flow [2022-12-13 13:06:00,607 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=364, PETRI_PLACES=77, PETRI_TRANSITIONS=82} [2022-12-13 13:06:00,608 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 20 predicate places. [2022-12-13 13:06:00,608 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 82 transitions, 364 flow [2022-12-13 13:06:00,608 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 13:06:00,608 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:06:00,609 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:06:00,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 13:06:00,609 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 13:06:00,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:06:00,609 INFO L85 PathProgramCache]: Analyzing trace with hash -435859775, now seen corresponding path program 1 times [2022-12-13 13:06:00,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:06:00,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057517263] [2022-12-13 13:06:00,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:06:00,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:06:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:06:01,116 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 13:06:01,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:06:01,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057517263] [2022-12-13 13:06:01,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057517263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:06:01,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:06:01,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:06:01,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280201694] [2022-12-13 13:06:01,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:06:01,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:06:01,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:06:01,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:06:01,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:06:01,402 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 477 [2022-12-13 13:06:01,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 82 transitions, 364 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 13:06:01,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:06:01,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 477 [2022-12-13 13:06:01,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:06:02,140 INFO L130 PetriNetUnfolder]: 4707/7685 cut-off events. [2022-12-13 13:06:02,141 INFO L131 PetriNetUnfolder]: For 3933/3943 co-relation queries the response was YES. [2022-12-13 13:06:02,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19098 conditions, 7685 events. 4707/7685 cut-off events. For 3933/3943 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 47024 event pairs, 3113 based on Foata normal form. 0/6048 useless extension candidates. Maximal degree in co-relation 11896. Up to 7472 conditions per place. [2022-12-13 13:06:02,164 INFO L137 encePairwiseOnDemand]: 469/477 looper letters, 79 selfloop transitions, 8 changer transitions 0/92 dead transitions. [2022-12-13 13:06:02,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 92 transitions, 564 flow [2022-12-13 13:06:02,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:06:02,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:06:02,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1195 transitions. [2022-12-13 13:06:02,167 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5010482180293501 [2022-12-13 13:06:02,167 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1195 transitions. [2022-12-13 13:06:02,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1195 transitions. [2022-12-13 13:06:02,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:06:02,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1195 transitions. [2022-12-13 13:06:02,169 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 13:06:02,171 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 13:06:02,171 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 13:06:02,172 INFO L175 Difference]: Start difference. First operand has 77 places, 82 transitions, 364 flow. Second operand 5 states and 1195 transitions. [2022-12-13 13:06:02,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 92 transitions, 564 flow [2022-12-13 13:06:02,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 92 transitions, 562 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:06:02,179 INFO L231 Difference]: Finished difference. Result has 81 places, 84 transitions, 402 flow [2022-12-13 13:06:02,179 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=402, PETRI_PLACES=81, PETRI_TRANSITIONS=84} [2022-12-13 13:06:02,179 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 24 predicate places. [2022-12-13 13:06:02,180 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 84 transitions, 402 flow [2022-12-13 13:06:02,180 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 13:06:02,180 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:06:02,180 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:06:02,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 13:06:02,181 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 13:06:02,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:06:02,181 INFO L85 PathProgramCache]: Analyzing trace with hash 538174715, now seen corresponding path program 1 times [2022-12-13 13:06:02,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:06:02,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301469907] [2022-12-13 13:06:02,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:06:02,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:06:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:06:03,823 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 13:06:03,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:06:03,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301469907] [2022-12-13 13:06:03,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301469907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:06:03,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:06:03,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:06:03,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598458400] [2022-12-13 13:06:03,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:06:03,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:06:03,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:06:03,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:06:03,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:06:04,747 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 477 [2022-12-13 13:06:04,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 84 transitions, 402 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 13:06:04,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:06:04,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 477 [2022-12-13 13:06:04,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:06:06,001 INFO L130 PetriNetUnfolder]: 4942/8056 cut-off events. [2022-12-13 13:06:06,001 INFO L131 PetriNetUnfolder]: For 3748/3778 co-relation queries the response was YES. [2022-12-13 13:06:06,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20541 conditions, 8056 events. 4942/8056 cut-off events. For 3748/3778 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 50076 event pairs, 1224 based on Foata normal form. 98/6798 useless extension candidates. Maximal degree in co-relation 14648. Up to 6259 conditions per place. [2022-12-13 13:06:06,026 INFO L137 encePairwiseOnDemand]: 468/477 looper letters, 132 selfloop transitions, 16 changer transitions 0/153 dead transitions. [2022-12-13 13:06:06,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 153 transitions, 899 flow [2022-12-13 13:06:06,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:06:06,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:06:06,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1237 transitions. [2022-12-13 13:06:06,028 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5186582809224318 [2022-12-13 13:06:06,028 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1237 transitions. [2022-12-13 13:06:06,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1237 transitions. [2022-12-13 13:06:06,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:06:06,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1237 transitions. [2022-12-13 13:06:06,030 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 13:06:06,032 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 13:06:06,032 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 13:06:06,033 INFO L175 Difference]: Start difference. First operand has 81 places, 84 transitions, 402 flow. Second operand 5 states and 1237 transitions. [2022-12-13 13:06:06,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 153 transitions, 899 flow [2022-12-13 13:06:06,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 153 transitions, 887 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 13:06:06,048 INFO L231 Difference]: Finished difference. Result has 83 places, 86 transitions, 452 flow [2022-12-13 13:06:06,048 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=452, PETRI_PLACES=83, PETRI_TRANSITIONS=86} [2022-12-13 13:06:06,049 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 26 predicate places. [2022-12-13 13:06:06,049 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 86 transitions, 452 flow [2022-12-13 13:06:06,049 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 13:06:06,049 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:06:06,049 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:06:06,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:06:06,049 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 13:06:06,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:06:06,050 INFO L85 PathProgramCache]: Analyzing trace with hash -624863577, now seen corresponding path program 2 times [2022-12-13 13:06:06,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:06:06,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882174862] [2022-12-13 13:06:06,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:06:06,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:06:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:06:06,675 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 13:06:06,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:06:06,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882174862] [2022-12-13 13:06:06,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882174862] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:06:06,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:06:06,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:06:06,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680198860] [2022-12-13 13:06:06,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:06:06,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:06:06,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:06:06,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:06:06,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:06:07,122 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 477 [2022-12-13 13:06:07,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 86 transitions, 452 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 13:06:07,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:06:07,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 477 [2022-12-13 13:06:07,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:06:08,061 INFO L130 PetriNetUnfolder]: 5417/8850 cut-off events. [2022-12-13 13:06:08,061 INFO L131 PetriNetUnfolder]: For 6345/6373 co-relation queries the response was YES. [2022-12-13 13:06:08,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23458 conditions, 8850 events. 5417/8850 cut-off events. For 6345/6373 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 54312 event pairs, 1753 based on Foata normal form. 196/7629 useless extension candidates. Maximal degree in co-relation 18229. Up to 6083 conditions per place. [2022-12-13 13:06:08,091 INFO L137 encePairwiseOnDemand]: 469/477 looper letters, 134 selfloop transitions, 17 changer transitions 0/156 dead transitions. [2022-12-13 13:06:08,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 156 transitions, 965 flow [2022-12-13 13:06:08,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:06:08,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:06:08,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1241 transitions. [2022-12-13 13:06:08,094 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5203354297693921 [2022-12-13 13:06:08,094 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1241 transitions. [2022-12-13 13:06:08,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1241 transitions. [2022-12-13 13:06:08,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:06:08,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1241 transitions. [2022-12-13 13:06:08,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 248.2) internal successors, (1241), 5 states have internal predecessors, (1241), 0 states have call successors, (0), 0 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 13:06:08,098 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 13:06:08,099 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 13:06:08,099 INFO L175 Difference]: Start difference. First operand has 83 places, 86 transitions, 452 flow. Second operand 5 states and 1241 transitions. [2022-12-13 13:06:08,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 156 transitions, 965 flow [2022-12-13 13:06:08,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 156 transitions, 941 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 13:06:08,129 INFO L231 Difference]: Finished difference. Result has 85 places, 89 transitions, 507 flow [2022-12-13 13:06:08,129 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=507, PETRI_PLACES=85, PETRI_TRANSITIONS=89} [2022-12-13 13:06:08,129 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 28 predicate places. [2022-12-13 13:06:08,130 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 89 transitions, 507 flow [2022-12-13 13:06:08,130 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 13:06:08,130 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:06:08,130 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:06:08,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 13:06:08,131 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 13:06:08,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:06:08,131 INFO L85 PathProgramCache]: Analyzing trace with hash -586638659, now seen corresponding path program 1 times [2022-12-13 13:06:08,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:06:08,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501195527] [2022-12-13 13:06:08,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:06:08,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:06:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:06:08,161 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 13:06:08,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:06:08,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501195527] [2022-12-13 13:06:08,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501195527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:06:08,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:06:08,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:06:08,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152995070] [2022-12-13 13:06:08,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:06:08,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:06:08,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:06:08,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:06:08,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:06:08,168 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 477 [2022-12-13 13:06:08,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 89 transitions, 507 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 13:06:08,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:06:08,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 477 [2022-12-13 13:06:08,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:06:08,407 INFO L130 PetriNetUnfolder]: 998/1893 cut-off events. [2022-12-13 13:06:08,407 INFO L131 PetriNetUnfolder]: For 1331/1331 co-relation queries the response was YES. [2022-12-13 13:06:08,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4868 conditions, 1893 events. 998/1893 cut-off events. For 1331/1331 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 10670 event pairs, 691 based on Foata normal form. 92/1816 useless extension candidates. Maximal degree in co-relation 3838. Up to 1036 conditions per place. [2022-12-13 13:06:08,413 INFO L137 encePairwiseOnDemand]: 473/477 looper letters, 77 selfloop transitions, 2 changer transitions 8/90 dead transitions. [2022-12-13 13:06:08,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 90 transitions, 617 flow [2022-12-13 13:06:08,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:06:08,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:06:08,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 768 transitions. [2022-12-13 13:06:08,415 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5366876310272537 [2022-12-13 13:06:08,415 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 768 transitions. [2022-12-13 13:06:08,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 768 transitions. [2022-12-13 13:06:08,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:06:08,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 768 transitions. [2022-12-13 13:06:08,416 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 13:06:08,418 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 13:06:08,418 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 13:06:08,418 INFO L175 Difference]: Start difference. First operand has 85 places, 89 transitions, 507 flow. Second operand 3 states and 768 transitions. [2022-12-13 13:06:08,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 90 transitions, 617 flow [2022-12-13 13:06:08,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 90 transitions, 589 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-13 13:06:08,422 INFO L231 Difference]: Finished difference. Result has 85 places, 77 transitions, 387 flow [2022-12-13 13:06:08,422 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=387, PETRI_PLACES=85, PETRI_TRANSITIONS=77} [2022-12-13 13:06:08,422 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 28 predicate places. [2022-12-13 13:06:08,423 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 77 transitions, 387 flow [2022-12-13 13:06:08,423 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 13:06:08,423 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:06:08,423 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:06:08,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 13:06:08,423 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 13:06:08,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:06:08,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1010038033, now seen corresponding path program 1 times [2022-12-13 13:06:08,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:06:08,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481987374] [2022-12-13 13:06:08,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:06:08,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:06:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:06:08,463 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 13:06:08,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:06:08,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481987374] [2022-12-13 13:06:08,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481987374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:06:08,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:06:08,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:06:08,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867468256] [2022-12-13 13:06:08,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:06:08,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:06:08,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:06:08,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:06:08,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:06:08,474 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 477 [2022-12-13 13:06:08,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 77 transitions, 387 flow. Second operand has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 0 states have call successors, (0), 0 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 13:06:08,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:06:08,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 477 [2022-12-13 13:06:08,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:06:08,684 INFO L130 PetriNetUnfolder]: 785/1470 cut-off events. [2022-12-13 13:06:08,684 INFO L131 PetriNetUnfolder]: For 784/784 co-relation queries the response was YES. [2022-12-13 13:06:08,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3839 conditions, 1470 events. 785/1470 cut-off events. For 784/784 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 7263 event pairs, 573 based on Foata normal form. 10/1357 useless extension candidates. Maximal degree in co-relation 3270. Up to 1058 conditions per place. [2022-12-13 13:06:08,690 INFO L137 encePairwiseOnDemand]: 472/477 looper letters, 81 selfloop transitions, 3 changer transitions 0/88 dead transitions. [2022-12-13 13:06:08,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 88 transitions, 591 flow [2022-12-13 13:06:08,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:06:08,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:06:08,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 775 transitions. [2022-12-13 13:06:08,692 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5415793151642209 [2022-12-13 13:06:08,692 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 775 transitions. [2022-12-13 13:06:08,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 775 transitions. [2022-12-13 13:06:08,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:06:08,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 775 transitions. [2022-12-13 13:06:08,694 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 13:06:08,697 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 13:06:08,697 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 13:06:08,697 INFO L175 Difference]: Start difference. First operand has 85 places, 77 transitions, 387 flow. Second operand 3 states and 775 transitions. [2022-12-13 13:06:08,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 88 transitions, 591 flow [2022-12-13 13:06:08,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 88 transitions, 585 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 13:06:08,702 INFO L231 Difference]: Finished difference. Result has 85 places, 78 transitions, 407 flow [2022-12-13 13:06:08,703 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=407, PETRI_PLACES=85, PETRI_TRANSITIONS=78} [2022-12-13 13:06:08,703 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 28 predicate places. [2022-12-13 13:06:08,703 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 78 transitions, 407 flow [2022-12-13 13:06:08,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 0 states have call successors, (0), 0 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 13:06:08,704 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:06:08,704 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:06:08,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 13:06:08,704 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 13:06:08,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:06:08,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1415516147, now seen corresponding path program 1 times [2022-12-13 13:06:08,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:06:08,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649264308] [2022-12-13 13:06:08,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:06:08,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:06:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:06:09,203 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 13:06:09,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:06:09,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649264308] [2022-12-13 13:06:09,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649264308] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:06:09,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165328182] [2022-12-13 13:06:09,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:06:09,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:06:09,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:06:09,205 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:06:09,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 13:06:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:06:09,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-13 13:06:09,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:06:09,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:06:09,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:06:09,368 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 13:06:09,369 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 13:06:09,381 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 13:06:09,381 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 13:06:09,497 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 13:06:09,628 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 13:06:09,794 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 13:06:09,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:06:09,861 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 13:06:10,005 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 13:06:10,147 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 13:06:10,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:06:10,234 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_27| Int) (v_ArrVal_377 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_377) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_27| 4) |c_~#queue~0.offset|) v_ArrVal_378) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_27| (select .cse0 (+ 84 |c_~#queue~0.offset|))))))) is different from false [2022-12-13 13:06:10,254 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_27| Int) (v_ArrVal_375 Int) (v_ArrVal_377 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_375)) |c_~#stored_elements~0.base| v_ArrVal_377) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_375 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_27| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_27| 4) |c_~#queue~0.offset|) v_ArrVal_378) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-12-13 13:06:10,276 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_27| Int) (v_ArrVal_375 Int) (v_ArrVal_377 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |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_375)) |c_~#stored_elements~0.base| v_ArrVal_377) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_375) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_27| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_27| 4) |c_~#queue~0.offset|) v_ArrVal_378) (+ 88 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-12-13 13:06:10,322 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_27| Int) (v_ArrVal_375 Int) (v_ArrVal_373 Int) (v_ArrVal_377 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_373) .cse2 v_ArrVal_375)) |c_~#stored_elements~0.base| v_ArrVal_377) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_27| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_27| 4) |c_~#queue~0.offset|) v_ArrVal_378) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_375) (not (<= v_ArrVal_373 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))))))) is different from false [2022-12-13 13:06:10,349 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_27| Int) (v_ArrVal_375 Int) (v_ArrVal_373 Int) (v_ArrVal_377 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse3 v_ArrVal_373) .cse2 v_ArrVal_375)) |c_~#stored_elements~0.base| v_ArrVal_377) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_27| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_27| 4) |c_~#queue~0.offset|) v_ArrVal_378) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_375) (< (+ (select .cse1 .cse3) 1) v_ArrVal_373))))) is different from false [2022-12-13 13:06:13,240 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 13:06:13,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165328182] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:06:13,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:06:13,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-12-13 13:06:13,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54040121] [2022-12-13 13:06:13,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:06:13,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 13:06:13,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:06:13,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 13:06:13,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=520, Unknown=12, NotChecked=270, Total=992 [2022-12-13 13:06:13,579 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 477 [2022-12-13 13:06:13,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 78 transitions, 407 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 13:06:13,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:06:13,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 477 [2022-12-13 13:06:13,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:06:16,848 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 13:06:17,261 INFO L130 PetriNetUnfolder]: 810/1533 cut-off events. [2022-12-13 13:06:17,261 INFO L131 PetriNetUnfolder]: For 1053/1053 co-relation queries the response was YES. [2022-12-13 13:06:17,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4125 conditions, 1533 events. 810/1533 cut-off events. For 1053/1053 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 7752 event pairs, 604 based on Foata normal form. 2/1407 useless extension candidates. Maximal degree in co-relation 3561. Up to 1426 conditions per place. [2022-12-13 13:06:17,266 INFO L137 encePairwiseOnDemand]: 460/477 looper letters, 80 selfloop transitions, 42 changer transitions 0/126 dead transitions. [2022-12-13 13:06:17,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 126 transitions, 916 flow [2022-12-13 13:06:17,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 13:06:17,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 13:06:17,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3527 transitions. [2022-12-13 13:06:17,271 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.38916473573871785 [2022-12-13 13:06:17,271 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3527 transitions. [2022-12-13 13:06:17,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3527 transitions. [2022-12-13 13:06:17,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:06:17,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3527 transitions. [2022-12-13 13:06:17,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 185.6315789473684) internal successors, (3527), 19 states have internal predecessors, (3527), 0 states have call successors, (0), 0 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 13:06:17,286 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 13:06:17,289 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 13:06:17,289 INFO L175 Difference]: Start difference. First operand has 85 places, 78 transitions, 407 flow. Second operand 19 states and 3527 transitions. [2022-12-13 13:06:17,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 126 transitions, 916 flow [2022-12-13 13:06:17,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 126 transitions, 911 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:06:17,294 INFO L231 Difference]: Finished difference. Result has 110 places, 111 transitions, 794 flow [2022-12-13 13:06:17,294 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=794, PETRI_PLACES=110, PETRI_TRANSITIONS=111} [2022-12-13 13:06:17,295 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 53 predicate places. [2022-12-13 13:06:17,295 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 111 transitions, 794 flow [2022-12-13 13:06:17,297 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 13:06:17,297 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:06:17,297 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:06:17,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 13:06:17,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 13:06:17,498 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 13:06:17,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:06:17,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1415516148, now seen corresponding path program 1 times [2022-12-13 13:06:17,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:06:17,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176689382] [2022-12-13 13:06:17,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:06:17,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:06:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:06:18,061 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 13:06:18,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:06:18,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176689382] [2022-12-13 13:06:18,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176689382] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:06:18,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370558228] [2022-12-13 13:06:18,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:06:18,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:06:18,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:06:18,062 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:06:18,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 13:06:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:06:18,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-13 13:06:18,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:06:18,214 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 13:06:18,272 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 13:06:18,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:06:18,302 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 13:06:18,369 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-13 13:06:18,369 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 13:06:18,422 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 13:06:18,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:06:18,535 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_459 Int)) (or (< 0 (+ (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_458) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_459) (+ 88 |c_~#queue~0.offset|)) 2147483650)) (< (+ v_ArrVal_459 2147483648) 0))) is different from false [2022-12-13 13:06:18,624 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:06:18,624 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 13:06:18,632 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:06:18,633 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 13:06:18,639 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 13:06:18,655 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 13:06:18,665 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:06:18,666 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 13:06:18,761 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 13:06:18,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370558228] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:06:18,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:06:18,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 24 [2022-12-13 13:06:18,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602947729] [2022-12-13 13:06:18,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:06:18,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 13:06:18,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:06:18,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 13:06:18,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=488, Unknown=3, NotChecked=46, Total=650 [2022-12-13 13:06:18,902 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 477 [2022-12-13 13:06:18,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 111 transitions, 794 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 13:06:18,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:06:18,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 477 [2022-12-13 13:06:18,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:06:20,327 INFO L130 PetriNetUnfolder]: 1303/2488 cut-off events. [2022-12-13 13:06:20,327 INFO L131 PetriNetUnfolder]: For 1849/1849 co-relation queries the response was YES. [2022-12-13 13:06:20,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6956 conditions, 2488 events. 1303/2488 cut-off events. For 1849/1849 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 14375 event pairs, 505 based on Foata normal form. 12/2288 useless extension candidates. Maximal degree in co-relation 6685. Up to 1025 conditions per place. [2022-12-13 13:06:20,334 INFO L137 encePairwiseOnDemand]: 465/477 looper letters, 156 selfloop transitions, 41 changer transitions 0/201 dead transitions. [2022-12-13 13:06:20,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 201 transitions, 1550 flow [2022-12-13 13:06:20,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 13:06:20,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 13:06:20,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3205 transitions. [2022-12-13 13:06:20,339 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.39523985694906894 [2022-12-13 13:06:20,339 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3205 transitions. [2022-12-13 13:06:20,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3205 transitions. [2022-12-13 13:06:20,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:06:20,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3205 transitions. [2022-12-13 13:06:20,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 188.52941176470588) internal successors, (3205), 17 states have internal predecessors, (3205), 0 states have call successors, (0), 0 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 13:06:20,348 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 13:06:20,349 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 13:06:20,349 INFO L175 Difference]: Start difference. First operand has 110 places, 111 transitions, 794 flow. Second operand 17 states and 3205 transitions. [2022-12-13 13:06:20,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 201 transitions, 1550 flow [2022-12-13 13:06:20,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 201 transitions, 1413 flow, removed 44 selfloop flow, removed 6 redundant places. [2022-12-13 13:06:20,358 INFO L231 Difference]: Finished difference. Result has 123 places, 116 transitions, 827 flow [2022-12-13 13:06:20,358 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=827, PETRI_PLACES=123, PETRI_TRANSITIONS=116} [2022-12-13 13:06:20,359 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 66 predicate places. [2022-12-13 13:06:20,359 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 116 transitions, 827 flow [2022-12-13 13:06:20,360 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 13:06:20,360 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:06:20,360 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:06:20,364 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 13:06:20,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:06:20,562 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 13:06:20,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:06:20,563 INFO L85 PathProgramCache]: Analyzing trace with hash -466014701, now seen corresponding path program 1 times [2022-12-13 13:06:20,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:06:20,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432880635] [2022-12-13 13:06:20,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:06:20,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:06:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:06:21,125 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 13:06:21,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:06:21,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432880635] [2022-12-13 13:06:21,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432880635] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:06:21,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263951240] [2022-12-13 13:06:21,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:06:21,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:06:21,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:06:21,127 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:06:21,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 13:06:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:06:21,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-13 13:06:21,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:06:21,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:06:21,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:06:21,246 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 13:06:21,246 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 13:06:21,263 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 13:06:21,263 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 13:06:21,333 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 30 [2022-12-13 13:06:21,418 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 43 treesize of output 36 [2022-12-13 13:06:21,528 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 73 treesize of output 66 [2022-12-13 13:06:21,700 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 54 treesize of output 47 [2022-12-13 13:06:21,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:06:21,763 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 41 treesize of output 43 [2022-12-13 13:06:21,880 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 59 treesize of output 52 [2022-12-13 13:06:21,966 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 13:06:21,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:06:22,226 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| Int) (v_ArrVal_562 Int) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_558 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |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_558)) |c_~#stored_elements~0.base| v_ArrVal_560) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_558) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| 4)) v_ArrVal_562) (+ 88 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-12-13 13:06:22,264 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| Int) (v_ArrVal_562 Int) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_556) .cse2 v_ArrVal_558)) |c_~#stored_elements~0.base| v_ArrVal_560) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| 4)) v_ArrVal_562) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_558) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (not (<= v_ArrVal_556 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))))))) is different from false [2022-12-13 13:06:22,389 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_554 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| Int) (v_ArrVal_562 Int) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 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_554)) (.cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_556) .cse3 v_ArrVal_558)) |c_~#stored_elements~0.base| v_ArrVal_560) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| 4)) v_ArrVal_562) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_556) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse3) 1) v_ArrVal_558))))) is different from false [2022-12-13 13:06:24,394 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_554 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| Int) (v_ArrVal_562 Int) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_554))) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_556) .cse2 v_ArrVal_558)) |c_~#stored_elements~0.base| v_ArrVal_560) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_556) (< (+ (select .cse0 .cse2) 1) v_ArrVal_558) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| (select .cse3 .cse2))) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| 4)) v_ArrVal_562) .cse1) 2147483647)))))) is different from false [2022-12-13 13:06:26,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-13 13:06:26,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263951240] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:06:26,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:06:26,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-13 13:06:26,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802039224] [2022-12-13 13:06:26,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:06:26,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-13 13:06:26,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:06:26,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-13 13:06:26,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=714, Unknown=15, NotChecked=244, Total=1190 [2022-12-13 13:06:26,686 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 477 [2022-12-13 13:06:26,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 116 transitions, 827 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 13:06:26,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:06:26,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 477 [2022-12-13 13:06:26,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:06:29,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 13:06:42,965 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 13:06:44,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:06:46,977 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 13:06:48,982 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 13:06:50,994 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 13:06:53,002 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 13:06:55,007 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 13:06:57,014 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 13:06:59,952 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 13:07:02,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 13:07:02,087 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (+ 88 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| Int) (v_ArrVal_562 Int) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_558 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |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_558)) |c_~#stored_elements~0.base| v_ArrVal_560) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_558) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| (select .cse2 .cse3))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| 4)) v_ArrVal_562) .cse4) 2147483647))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| Int) (v_ArrVal_562 Int) (v_ArrVal_560 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_560) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| (select .cse5 .cse3))) (< (select (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| 4)) v_ArrVal_562) .cse4) 2147483647)))))) is different from false [2022-12-13 13:07:02,371 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| Int) (v_ArrVal_562 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| 4)) v_ArrVal_562) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| (select .cse0 .cse2)))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| Int) (v_ArrVal_562 Int) (v_ArrVal_560 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_560) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| (select .cse3 .cse2))) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| 4)) v_ArrVal_562) .cse1) 2147483647)))))) is different from false [2022-12-13 13:07:05,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:07:05,331 INFO L130 PetriNetUnfolder]: 2370/4508 cut-off events. [2022-12-13 13:07:05,331 INFO L131 PetriNetUnfolder]: For 4202/4202 co-relation queries the response was YES. [2022-12-13 13:07:05,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12606 conditions, 4508 events. 2370/4508 cut-off events. For 4202/4202 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 29342 event pairs, 994 based on Foata normal form. 27/4147 useless extension candidates. Maximal degree in co-relation 12143. Up to 2213 conditions per place. [2022-12-13 13:07:05,362 INFO L137 encePairwiseOnDemand]: 454/477 looper letters, 191 selfloop transitions, 109 changer transitions 0/304 dead transitions. [2022-12-13 13:07:05,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 304 transitions, 2123 flow [2022-12-13 13:07:05,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 13:07:05,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-13 13:07:05,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 5002 transitions. [2022-12-13 13:07:05,368 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3883841913192018 [2022-12-13 13:07:05,368 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 5002 transitions. [2022-12-13 13:07:05,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 5002 transitions. [2022-12-13 13:07:05,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:07:05,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 5002 transitions. [2022-12-13 13:07:05,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 185.25925925925927) internal successors, (5002), 27 states have internal predecessors, (5002), 0 states have call successors, (0), 0 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 13:07:05,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 477.0) internal successors, (13356), 28 states have internal predecessors, (13356), 0 states have call successors, (0), 0 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 13:07:05,383 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 477.0) internal successors, (13356), 28 states have internal predecessors, (13356), 0 states have call successors, (0), 0 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 13:07:05,383 INFO L175 Difference]: Start difference. First operand has 123 places, 116 transitions, 827 flow. Second operand 27 states and 5002 transitions. [2022-12-13 13:07:05,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 304 transitions, 2123 flow [2022-12-13 13:07:05,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 304 transitions, 2072 flow, removed 6 selfloop flow, removed 13 redundant places. [2022-12-13 13:07:05,397 INFO L231 Difference]: Finished difference. Result has 152 places, 185 transitions, 1658 flow [2022-12-13 13:07:05,397 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1658, PETRI_PLACES=152, PETRI_TRANSITIONS=185} [2022-12-13 13:07:05,397 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 95 predicate places. [2022-12-13 13:07:05,397 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 185 transitions, 1658 flow [2022-12-13 13:07:05,398 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 13:07:05,398 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:07:05,398 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:07:05,403 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 13:07:05,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:07:05,599 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 13:07:05,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:07:05,599 INFO L85 PathProgramCache]: Analyzing trace with hash -931580537, now seen corresponding path program 2 times [2022-12-13 13:07:05,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:07:05,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912502560] [2022-12-13 13:07:05,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:05,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:07:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:06,185 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 13:07:06,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:07:06,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912502560] [2022-12-13 13:07:06,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912502560] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:07:06,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452176642] [2022-12-13 13:07:06,186 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:07:06,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:07:06,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:07:06,187 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:07:06,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 13:07:06,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:07:06,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:07:06,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 83 conjunts are in the unsatisfiable core [2022-12-13 13:07:06,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:07:06,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:07:06,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:07:06,358 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 13:07:06,359 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 13:07:06,376 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 13:07:06,376 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 13:07:06,487 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 43 treesize of output 36 [2022-12-13 13:07:06,600 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 73 treesize of output 66 [2022-12-13 13:07:06,745 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 54 treesize of output 47 [2022-12-13 13:07:06,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:07:06,804 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 41 treesize of output 43 [2022-12-13 13:07:06,858 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 41 treesize of output 43 [2022-12-13 13:07:06,972 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 59 treesize of output 52 [2022-12-13 13:07:07,043 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 13:07:07,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:07:24,926 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 13:07:24,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452176642] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:07:24,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:07:24,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-13 13:07:24,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917392869] [2022-12-13 13:07:24,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:07:24,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-13 13:07:24,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:07:24,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-13 13:07:24,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=864, Unknown=52, NotChecked=0, Total=1190 [2022-12-13 13:07:26,984 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 13:07:29,077 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 13:07:31,132 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 13:07:33,207 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 13:07:35,278 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 13:07:37,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:07:39,410 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 13:07:41,507 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 13:07:43,578 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 13:07:45,634 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 13:07:47,686 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 13:07:49,773 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 13:07:51,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:07:53,893 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 13:07:55,976 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 13:07:58,031 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 13:08:00,100 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 13:08:02,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:08:04,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:08:06,287 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 13:08:08,337 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 13:08:10,381 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 13:08:12,405 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 13:08:14,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 [1] [2022-12-13 13:08:16,566 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 13:08:18,580 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 13:08:20,599 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 13:08:22,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:08:24,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 [1] [2022-12-13 13:08:26,674 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 13:08:28,731 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 13:08:30,783 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 13:08:32,843 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 13:08:34,898 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 13:08:36,955 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 13:08:39,018 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 13:08:41,075 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 13:08:43,146 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 13:08:45,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:08:47,297 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 13:08:47,298 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 477 [2022-12-13 13:08:47,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 185 transitions, 1658 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 13:08:47,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:08:47,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 477 [2022-12-13 13:08:47,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:08:56,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 13:08:58,891 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 13:09:00,898 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 13:09:02,905 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 13:09:04,921 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 13:09:06,977 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 13:09:09,006 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 13:09:11,015 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 13:09:11,035 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (+ (select .cse4 .cse5) 1)) (.cse2 (+ 88 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_664 Int) (v_ArrVal_661 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| Int) (v_ArrVal_663 (Array Int Int)) (v_ArrVal_662 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_661)) |c_~#stored_elements~0.base| v_ArrVal_662) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_663) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| 4) |c_~#queue~0.offset|) v_ArrVal_664) .cse2) 2147483647) (< .cse3 v_ArrVal_661)))) (forall ((v_ArrVal_664 Int) (v_ArrVal_661 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| Int) (v_ArrVal_658 Int) (v_ArrVal_663 (Array Int Int)) (v_ArrVal_662 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_658) .cse5 v_ArrVal_661)) |c_~#stored_elements~0.base| v_ArrVal_662) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_663) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| (select .cse6 .cse1))) (not (<= v_ArrVal_658 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< .cse3 v_ArrVal_661) (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_41| 4) |c_~#queue~0.offset|) v_ArrVal_664) .cse2) 2147483647))))))) is different from false [2022-12-13 13:09:13,651 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 13:09:15,657 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 13:09:18,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:09:20,201 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 13:09:22,288 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 13:09:24,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:09:26,426 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 13:09:29,109 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 13:09:31,200 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 13:09:34,509 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 13:09:37,305 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 13:09:41,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:09:42,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:09:50,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:09:51,889 INFO L130 PetriNetUnfolder]: 3927/7504 cut-off events. [2022-12-13 13:09:51,889 INFO L131 PetriNetUnfolder]: For 41534/41534 co-relation queries the response was YES. [2022-12-13 13:09:51,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34494 conditions, 7504 events. 3927/7504 cut-off events. For 41534/41534 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 54853 event pairs, 1209 based on Foata normal form. 22/6911 useless extension candidates. Maximal degree in co-relation 33597. Up to 3025 conditions per place. [2022-12-13 13:09:51,931 INFO L137 encePairwiseOnDemand]: 455/477 looper letters, 284 selfloop transitions, 120 changer transitions 4/412 dead transitions. [2022-12-13 13:09:51,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 412 transitions, 4787 flow [2022-12-13 13:09:51,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 13:09:51,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-13 13:09:51,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4850 transitions. [2022-12-13 13:09:51,936 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.39106595710369296 [2022-12-13 13:09:51,936 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 4850 transitions. [2022-12-13 13:09:51,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 4850 transitions. [2022-12-13 13:09:51,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:09:51,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 4850 transitions. [2022-12-13 13:09:51,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 186.53846153846155) internal successors, (4850), 26 states have internal predecessors, (4850), 0 states have call successors, (0), 0 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 13:09:51,947 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 13:09:51,948 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 13:09:51,948 INFO L175 Difference]: Start difference. First operand has 152 places, 185 transitions, 1658 flow. Second operand 26 states and 4850 transitions. [2022-12-13 13:09:51,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 412 transitions, 4787 flow [2022-12-13 13:09:52,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 412 transitions, 4640 flow, removed 64 selfloop flow, removed 4 redundant places. [2022-12-13 13:09:52,015 INFO L231 Difference]: Finished difference. Result has 182 places, 243 transitions, 2599 flow [2022-12-13 13:09:52,015 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=1557, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2599, PETRI_PLACES=182, PETRI_TRANSITIONS=243} [2022-12-13 13:09:52,016 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 125 predicate places. [2022-12-13 13:09:52,016 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 243 transitions, 2599 flow [2022-12-13 13:09:52,016 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 13:09:52,016 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:09:52,016 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:09:52,021 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 13:09:52,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 13:09:52,218 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 13:09:52,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:09:52,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1376034970, now seen corresponding path program 1 times [2022-12-13 13:09:52,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:09:52,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676044153] [2022-12-13 13:09:52,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:52,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:09:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:52,532 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 13:09:52,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:09:52,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676044153] [2022-12-13 13:09:52,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676044153] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:09:52,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017327703] [2022-12-13 13:09:52,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:52,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:09:52,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:09:52,534 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:09:52,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 13:09:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:52,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-13 13:09:52,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:09:52,663 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 13:09:52,664 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 13:09:52,772 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 13:09:52,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:09:52,809 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 13:09:52,874 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 13:09:52,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:09:52,907 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 13:09:52,976 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-13 13:09:52,976 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 13:09:53,035 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 13:09:53,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:09:53,131 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_752 Int) (v_ArrVal_751 (Array Int Int))) (or (< (+ v_ArrVal_752 2147483648) 0) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_751) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_752) (+ 88 |c_~#queue~0.offset|)))))) is different from false [2022-12-13 13:09:53,294 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:09:53,294 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 13:09:53,309 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:09:53,309 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 1777 treesize of output 1751 [2022-12-13 13:09:53,330 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 2830 treesize of output 2734 [2022-12-13 13:09:53,351 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 3118 treesize of output 2990 [2022-12-13 13:12:16,930 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 13:12:16,932 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 13:12:16,936 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 13:12:16,939 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 13:12:16,947 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:12:16,950 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 13:12:16,957 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 13:12:17,926 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:12:17,927 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 462 treesize of output 438 [2022-12-13 13:12:18,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:18,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017327703] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:18,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:18,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-13 13:12:18,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546897336] [2022-12-13 13:12:18,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:18,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 13:12:18,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:18,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 13:12:18,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=469, Unknown=9, NotChecked=46, Total=650 [2022-12-13 13:12:18,274 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 477 [2022-12-13 13:12:18,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 243 transitions, 2599 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 13:12:18,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:18,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 477 [2022-12-13 13:12:18,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:19,645 INFO L130 PetriNetUnfolder]: 3946/7555 cut-off events. [2022-12-13 13:12:19,645 INFO L131 PetriNetUnfolder]: For 61465/61465 co-relation queries the response was YES. [2022-12-13 13:12:19,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38564 conditions, 7555 events. 3946/7555 cut-off events. For 61465/61465 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 55505 event pairs, 2225 based on Foata normal form. 45/7038 useless extension candidates. Maximal degree in co-relation 37723. Up to 6621 conditions per place. [2022-12-13 13:12:19,683 INFO L137 encePairwiseOnDemand]: 473/477 looper letters, 239 selfloop transitions, 16 changer transitions 0/259 dead transitions. [2022-12-13 13:12:19,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 259 transitions, 3167 flow [2022-12-13 13:12:19,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:12:19,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:12:19,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1007 transitions. [2022-12-13 13:12:19,685 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2022-12-13 13:12:19,685 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1007 transitions. [2022-12-13 13:12:19,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1007 transitions. [2022-12-13 13:12:19,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:12:19,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1007 transitions. [2022-12-13 13:12:19,686 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 13:12:19,688 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 13:12:19,688 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 13:12:19,688 INFO L175 Difference]: Start difference. First operand has 182 places, 243 transitions, 2599 flow. Second operand 5 states and 1007 transitions. [2022-12-13 13:12:19,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 259 transitions, 3167 flow [2022-12-13 13:12:19,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 259 transitions, 2860 flow, removed 102 selfloop flow, removed 7 redundant places. [2022-12-13 13:12:19,757 INFO L231 Difference]: Finished difference. Result has 178 places, 239 transitions, 2262 flow [2022-12-13 13:12:19,757 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=2207, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2262, PETRI_PLACES=178, PETRI_TRANSITIONS=239} [2022-12-13 13:12:19,757 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 121 predicate places. [2022-12-13 13:12:19,757 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 239 transitions, 2262 flow [2022-12-13 13:12:19,758 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 13:12:19,758 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:19,758 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:19,762 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 13:12:19,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 13:12:19,960 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 13:12:19,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:19,961 INFO L85 PathProgramCache]: Analyzing trace with hash -931325717, now seen corresponding path program 3 times [2022-12-13 13:12:19,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:19,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078110928] [2022-12-13 13:12:19,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:19,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:20,643 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 13:12:20,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:20,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078110928] [2022-12-13 13:12:20,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078110928] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:20,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104387972] [2022-12-13 13:12:20,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 13:12:20,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:20,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:12:20,645 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:20,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 13:12:20,761 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 13:12:20,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:12:20,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 73 conjunts are in the unsatisfiable core [2022-12-13 13:12:20,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:20,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:12:20,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:12:20,786 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 13:12:20,786 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 13:12:20,801 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 13:12:20,801 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 13:12:20,887 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 13:12:20,991 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 13:12:21,126 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 13:12:21,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:12:21,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-12-13 13:12:21,336 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 13:12:21,451 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 13:12:21,624 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 13:12:21,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:21,841 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_851 Int) (v_ArrVal_855 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| Int) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_853 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_851)) |c_~#stored_elements~0.base| v_ArrVal_852))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (not (<= v_ArrVal_851 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| 4) |c_~#queue~0.offset|) v_ArrVal_853)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_855) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| (select .cse1 (+ 84 |c_~#queue~0.offset|)))))))) is different from false [2022-12-13 13:12:21,978 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_851 Int) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_849 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| Int) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_853 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_849) .cse3 v_ArrVal_851)) |c_~#stored_elements~0.base| v_ArrVal_852))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (not (<= v_ArrVal_849 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| 4) |c_~#queue~0.offset|) v_ArrVal_853)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_855) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| (select .cse1 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_851)))))) is different from false [2022-12-13 13:12:22,947 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_851 Int) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_849 Int) (v_ArrVal_847 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| Int) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_853 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_847)) (.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_849) .cse4 v_ArrVal_851)) |c_~#stored_elements~0.base| v_ArrVal_852))) (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_849) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| 4) |c_~#queue~0.offset|) v_ArrVal_853)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_855) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse0 .cse4) 1) v_ArrVal_851) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| (select .cse3 (+ 84 |c_~#queue~0.offset|))))))))) is different from false [2022-12-13 13:12:31,271 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 13:12:31,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104387972] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:31,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:31,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-13 13:12:31,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176793354] [2022-12-13 13:12:31,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:31,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-13 13:12:31,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:31,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-13 13:12:31,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=725, Unknown=32, NotChecked=186, Total=1190 [2022-12-13 13:12:32,548 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 477 [2022-12-13 13:12:32,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 239 transitions, 2262 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 13:12:32,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:32,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 477 [2022-12-13 13:12:32,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:42,840 WARN L233 SmtUtils]: Spent 6.23s on a formula simplification. DAG size of input: 177 DAG size of output: 97 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 13:12:45,010 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 13:12:47,023 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 13:12:49,034 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 13:12:51,055 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 13:12:53,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:12:55,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:12:57,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:12:57,201 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_851 Int) (v_ArrVal_855 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| Int) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_853 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_851)) |c_~#stored_elements~0.base| v_ArrVal_852))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| 4) |c_~#queue~0.offset|) v_ArrVal_853)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_855) |c_~#queue~0.base|) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| (select .cse1 .cse3))) (< (+ (select .cse4 .cse5) 1) v_ArrVal_851))))) (forall ((v_ArrVal_851 Int) (v_ArrVal_855 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| Int) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_853 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_851)) |c_~#stored_elements~0.base| v_ArrVal_852))) (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (or (not (<= v_ArrVal_851 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| 4) |c_~#queue~0.offset|) v_ArrVal_853)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_855) |c_~#queue~0.base|) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| (select .cse7 .cse3))))))))) is different from false [2022-12-13 13:12:59,298 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 13:13:01,624 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 13:13:02,668 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_855 (Array Int Int)) (v_ArrVal_853 Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_853)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_855) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647)) (forall ((v_ArrVal_855 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| Int) (v_ArrVal_853 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| 4) |c_~#queue~0.offset|) v_ArrVal_853)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_855) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-12-13 13:13:05,101 INFO L130 PetriNetUnfolder]: 5281/10087 cut-off events. [2022-12-13 13:13:05,102 INFO L131 PetriNetUnfolder]: For 76000/76000 co-relation queries the response was YES. [2022-12-13 13:13:05,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50469 conditions, 10087 events. 5281/10087 cut-off events. For 76000/76000 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 78721 event pairs, 1926 based on Foata normal form. 27/9353 useless extension candidates. Maximal degree in co-relation 49728. Up to 5170 conditions per place. [2022-12-13 13:13:05,157 INFO L137 encePairwiseOnDemand]: 455/477 looper letters, 274 selfloop transitions, 152 changer transitions 0/430 dead transitions. [2022-12-13 13:13:05,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 430 transitions, 5497 flow [2022-12-13 13:13:05,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 13:13:05,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-13 13:13:05,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3922 transitions. [2022-12-13 13:13:05,162 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3915343915343915 [2022-12-13 13:13:05,162 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3922 transitions. [2022-12-13 13:13:05,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3922 transitions. [2022-12-13 13:13:05,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:13:05,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3922 transitions. [2022-12-13 13:13:05,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 186.76190476190476) internal successors, (3922), 21 states have internal predecessors, (3922), 0 states have call successors, (0), 0 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 13:13:05,184 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 13:13:05,185 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 13:13:05,185 INFO L175 Difference]: Start difference. First operand has 178 places, 239 transitions, 2262 flow. Second operand 21 states and 3922 transitions. [2022-12-13 13:13:05,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 430 transitions, 5497 flow [2022-12-13 13:13:05,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 430 transitions, 5488 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-13 13:13:05,243 INFO L231 Difference]: Finished difference. Result has 204 places, 308 transitions, 3761 flow [2022-12-13 13:13:05,243 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=2241, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3761, PETRI_PLACES=204, PETRI_TRANSITIONS=308} [2022-12-13 13:13:05,243 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 147 predicate places. [2022-12-13 13:13:05,243 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 308 transitions, 3761 flow [2022-12-13 13:13:05,244 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 13:13:05,244 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:13:05,244 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:13:05,248 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 13:13:05,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 13:13:05,445 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 13:13:05,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:13:05,447 INFO L85 PathProgramCache]: Analyzing trace with hash 2100752267, now seen corresponding path program 1 times [2022-12-13 13:13:05,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:13:05,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198701460] [2022-12-13 13:13:05,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:13:05,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:13:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:13:05,762 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 13:13:05,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:13:05,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198701460] [2022-12-13 13:13:05,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198701460] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:13:05,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464109056] [2022-12-13 13:13:05,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:13:05,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:13:05,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:13:05,764 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:13:05,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 13:13:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:13:05,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-13 13:13:05,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:13:05,868 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 13:13:05,868 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 13:13:05,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:13:05,969 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 17 treesize of output 19 [2022-12-13 13:13:06,038 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 13:13:06,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:13:06,062 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 13:13:06,119 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 13:13:06,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 33 [2022-12-13 13:13:06,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2022-12-13 13:13:06,157 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 13:13:06,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:13:06,244 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_943 (Array Int Int)) (v_ArrVal_945 Int)) (< 0 (+ 2147483650 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_943) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_945)) .cse1))))) is different from false [2022-12-13 13:13:06,306 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_943 (Array Int Int)) (v_ArrVal_945 Int) (v_ArrVal_940 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_940))) (let ((.cse4 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse4 .cse5))) (or (not (<= 0 (+ 2147483649 .cse0))) (< 0 (+ (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_943) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) v_ArrVal_945)) .cse2)) 2147483650))))))) is different from false [2022-12-13 13:13:06,323 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:13:06,323 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 2399 treesize of output 2307 [2022-12-13 13:13:06,336 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 2774 treesize of output 2390 [2022-12-13 13:13:06,364 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:13:06,365 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 4420 treesize of output 3816 [2022-12-13 13:15:00,489 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 36 treesize of output 24 [2022-12-13 13:15:00,498 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 36 treesize of output 24 [2022-12-13 13:15:00,506 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 36 treesize of output 24 [2022-12-13 13:15:00,518 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 36 treesize of output 24 [2022-12-13 13:15:00,526 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 36 treesize of output 24 [2022-12-13 13:15:00,538 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 13:15:00,543 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 13:15:00,551 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 13:15:00,556 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 13:15:01,106 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:15:01,107 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 3116 treesize of output 2376 [2022-12-13 13:15:02,190 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 13:15:02,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464109056] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:15:02,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:15:02,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 25 [2022-12-13 13:15:02,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762389095] [2022-12-13 13:15:02,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:15:02,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 13:15:02,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:15:02,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 13:15:02,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=503, Unknown=5, NotChecked=94, Total=702 [2022-12-13 13:15:02,266 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 477 [2022-12-13 13:15:02,268 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 308 transitions, 3761 flow. Second operand has 27 states, 27 states have (on average 183.11111111111111) internal successors, (4944), 27 states have internal predecessors, (4944), 0 states have call successors, (0), 0 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 13:15:02,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:15:02,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 477 [2022-12-13 13:15:02,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:15:05,705 INFO L130 PetriNetUnfolder]: 6770/12959 cut-off events. [2022-12-13 13:15:05,705 INFO L131 PetriNetUnfolder]: For 217732/217736 co-relation queries the response was YES. [2022-12-13 13:15:05,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83172 conditions, 12959 events. 6770/12959 cut-off events. For 217732/217736 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 105995 event pairs, 2576 based on Foata normal form. 182/12199 useless extension candidates. Maximal degree in co-relation 80296. Up to 7683 conditions per place. [2022-12-13 13:15:05,829 INFO L137 encePairwiseOnDemand]: 459/477 looper letters, 300 selfloop transitions, 159 changer transitions 0/463 dead transitions. [2022-12-13 13:15:05,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 463 transitions, 6924 flow [2022-12-13 13:15:05,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 13:15:05,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 13:15:05,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2514 transitions. [2022-12-13 13:15:05,834 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.405418480890179 [2022-12-13 13:15:05,834 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2514 transitions. [2022-12-13 13:15:05,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2514 transitions. [2022-12-13 13:15:05,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:15:05,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2514 transitions. [2022-12-13 13:15:05,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 193.3846153846154) internal successors, (2514), 13 states have internal predecessors, (2514), 0 states have call successors, (0), 0 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 13:15:05,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 477.0) internal successors, (6678), 14 states have internal predecessors, (6678), 0 states have call successors, (0), 0 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 13:15:05,844 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 477.0) internal successors, (6678), 14 states have internal predecessors, (6678), 0 states have call successors, (0), 0 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 13:15:05,844 INFO L175 Difference]: Start difference. First operand has 204 places, 308 transitions, 3761 flow. Second operand 13 states and 2514 transitions. [2022-12-13 13:15:05,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 463 transitions, 6924 flow [2022-12-13 13:15:06,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 463 transitions, 6274 flow, removed 253 selfloop flow, removed 10 redundant places. [2022-12-13 13:15:06,023 INFO L231 Difference]: Finished difference. Result has 212 places, 350 transitions, 4462 flow [2022-12-13 13:15:06,024 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=3239, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4462, PETRI_PLACES=212, PETRI_TRANSITIONS=350} [2022-12-13 13:15:06,024 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 155 predicate places. [2022-12-13 13:15:06,024 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 350 transitions, 4462 flow [2022-12-13 13:15:06,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 183.11111111111111) internal successors, (4944), 27 states have internal predecessors, (4944), 0 states have call successors, (0), 0 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 13:15:06,025 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:15:06,025 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:15:06,029 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 13:15:06,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 13:15:06,227 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 13:15:06,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:15:06,228 INFO L85 PathProgramCache]: Analyzing trace with hash -63798878, now seen corresponding path program 1 times [2022-12-13 13:15:06,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:15:06,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045557895] [2022-12-13 13:15:06,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:15:06,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:15:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:15:06,842 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 13:15:06,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:15:06,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045557895] [2022-12-13 13:15:06,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045557895] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:15:06,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35903388] [2022-12-13 13:15:06,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:15:06,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:15:06,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:15:06,844 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:15:06,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 13:15:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:15:06,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-13 13:15:06,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:15:06,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:15:06,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:15:06,979 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 13:15:06,979 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 13:15:06,988 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 13:15:06,988 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 13:15:07,065 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 13:15:07,132 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 13:15:07,202 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-12-13 13:15:07,265 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 13:15:07,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:15:07,311 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 13:15:07,411 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 13:15:07,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 56 [2022-12-13 13:15:07,470 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 51 [2022-12-13 13:15:07,486 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 13:15:07,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:15:07,564 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1051 Int) (v_ArrVal_1049 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1049) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4) |c_~#queue~0.offset|) v_ArrVal_1051) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| (select .cse0 .cse1)))))) is different from false [2022-12-13 13:15:07,573 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:15:07,573 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 53 treesize of output 43 [2022-12-13 13:15:07,581 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:15:07,581 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 80 treesize of output 82 [2022-12-13 13:15:07,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2022-12-13 13:15:07,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2022-12-13 13:15:07,634 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:15:07,634 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 51 treesize of output 47 [2022-12-13 13:15:07,830 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 13:15:07,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35903388] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:15:07,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:15:07,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 25 [2022-12-13 13:15:07,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019669458] [2022-12-13 13:15:07,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:15:07,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 13:15:07,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:15:07,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 13:15:07,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=495, Unknown=1, NotChecked=48, Total=702 [2022-12-13 13:15:07,841 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 477 [2022-12-13 13:15:07,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 350 transitions, 4462 flow. Second operand has 27 states, 27 states have (on average 188.11111111111111) internal successors, (5079), 27 states have internal predecessors, (5079), 0 states have call successors, (0), 0 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 13:15:07,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:15:07,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 477 [2022-12-13 13:15:07,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:15:11,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:15:12,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:15:13,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:15:16,907 INFO L130 PetriNetUnfolder]: 7963/15210 cut-off events. [2022-12-13 13:15:16,907 INFO L131 PetriNetUnfolder]: For 307274/307278 co-relation queries the response was YES. [2022-12-13 13:15:16,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103407 conditions, 15210 events. 7963/15210 cut-off events. For 307274/307278 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 128051 event pairs, 4951 based on Foata normal form. 63/14108 useless extension candidates. Maximal degree in co-relation 99203. Up to 11621 conditions per place. [2022-12-13 13:15:17,031 INFO L137 encePairwiseOnDemand]: 457/477 looper letters, 416 selfloop transitions, 114 changer transitions 0/534 dead transitions. [2022-12-13 13:15:17,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 534 transitions, 8283 flow [2022-12-13 13:15:17,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 13:15:17,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 13:15:17,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3538 transitions. [2022-12-13 13:15:17,036 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.412066154204519 [2022-12-13 13:15:17,036 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3538 transitions. [2022-12-13 13:15:17,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3538 transitions. [2022-12-13 13:15:17,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:15:17,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3538 transitions. [2022-12-13 13:15:17,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 196.55555555555554) internal successors, (3538), 18 states have internal predecessors, (3538), 0 states have call successors, (0), 0 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 13:15:17,081 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 13:15:17,082 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 13:15:17,082 INFO L175 Difference]: Start difference. First operand has 212 places, 350 transitions, 4462 flow. Second operand 18 states and 3538 transitions. [2022-12-13 13:15:17,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 534 transitions, 8283 flow [2022-12-13 13:15:17,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 534 transitions, 8014 flow, removed 133 selfloop flow, removed 2 redundant places. [2022-12-13 13:15:17,323 INFO L231 Difference]: Finished difference. Result has 233 places, 407 transitions, 5594 flow [2022-12-13 13:15:17,323 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=4215, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=5594, PETRI_PLACES=233, PETRI_TRANSITIONS=407} [2022-12-13 13:15:17,324 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 176 predicate places. [2022-12-13 13:15:17,324 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 407 transitions, 5594 flow [2022-12-13 13:15:17,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 188.11111111111111) internal successors, (5079), 27 states have internal predecessors, (5079), 0 states have call successors, (0), 0 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 13:15:17,324 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:15:17,324 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:15:17,329 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 13:15:17,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:15:17,526 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 13:15:17,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:15:17,527 INFO L85 PathProgramCache]: Analyzing trace with hash 2100752314, now seen corresponding path program 2 times [2022-12-13 13:15:17,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:15:17,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124227548] [2022-12-13 13:15:17,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:15:17,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:15:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:15:18,325 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 13:15:18,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:15:18,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124227548] [2022-12-13 13:15:18,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124227548] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:15:18,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653210294] [2022-12-13 13:15:18,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:15:18,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:15:18,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:15:18,326 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:15:18,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 13:15:18,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:15:18,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:15:18,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 82 conjunts are in the unsatisfiable core [2022-12-13 13:15:18,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:15:18,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:15:18,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:15:18,480 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 13:15:18,480 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 13:15:18,495 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 13:15:18,495 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 13:15:18,587 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 13:15:18,663 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 13:15:18,778 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 13:15:18,895 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 13:15:18,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:15:18,944 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 13:15:19,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 89 treesize of output 82 [2022-12-13 13:15:19,145 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 116 treesize of output 111 [2022-12-13 13:15:19,216 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 13:15:19,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:15:19,298 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1158 (Array Int Int)) (v_ArrVal_1159 Int)) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1158) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1159)) .cse1)) 2147483647)) is different from false [2022-12-13 13:15:19,448 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1158 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1159 Int)) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1155))) (store .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse3 (select .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1158) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1159)) .cse1)) 2147483647)) is different from false [2022-12-13 13:15:19,554 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (= (select .cse0 .cse1) 20) (forall ((v_ArrVal_1154 Int) (v_ArrVal_1158 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1159 Int)) (< (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1154)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1155))) (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1158) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1159)) .cse3)) 2147483647)))) is different from false [2022-12-13 13:15:19,848 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-13 13:15:19,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653210294] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:15:19,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:15:19,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 30 [2022-12-13 13:15:19,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171314263] [2022-12-13 13:15:19,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:15:19,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 13:15:19,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:15:19,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 13:15:19,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=616, Unknown=22, NotChecked=168, Total=992 [2022-12-13 13:15:19,910 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 477 [2022-12-13 13:15:19,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 407 transitions, 5594 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 13:15:19,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:15:19,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 477 [2022-12-13 13:15:19,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:15:29,169 INFO L130 PetriNetUnfolder]: 9934/19057 cut-off events. [2022-12-13 13:15:29,169 INFO L131 PetriNetUnfolder]: For 447208/447216 co-relation queries the response was YES. [2022-12-13 13:15:29,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135445 conditions, 19057 events. 9934/19057 cut-off events. For 447208/447216 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 165724 event pairs, 3349 based on Foata normal form. 219/17839 useless extension candidates. Maximal degree in co-relation 128628. Up to 8141 conditions per place. [2022-12-13 13:15:29,328 INFO L137 encePairwiseOnDemand]: 456/477 looper letters, 440 selfloop transitions, 275 changer transitions 0/719 dead transitions. [2022-12-13 13:15:29,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 719 transitions, 12550 flow [2022-12-13 13:15:29,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-13 13:15:29,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-13 13:15:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 5593 transitions. [2022-12-13 13:15:29,334 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.404322995734837 [2022-12-13 13:15:29,334 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 5593 transitions. [2022-12-13 13:15:29,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 5593 transitions. [2022-12-13 13:15:29,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:15:29,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 5593 transitions. [2022-12-13 13:15:29,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 192.86206896551724) internal successors, (5593), 29 states have internal predecessors, (5593), 0 states have call successors, (0), 0 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 13:15:29,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 477.0) internal successors, (14310), 30 states have internal predecessors, (14310), 0 states have call successors, (0), 0 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 13:15:29,349 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 477.0) internal successors, (14310), 30 states have internal predecessors, (14310), 0 states have call successors, (0), 0 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 13:15:29,349 INFO L175 Difference]: Start difference. First operand has 233 places, 407 transitions, 5594 flow. Second operand 29 states and 5593 transitions. [2022-12-13 13:15:29,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 719 transitions, 12550 flow [2022-12-13 13:15:29,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 719 transitions, 12225 flow, removed 154 selfloop flow, removed 5 redundant places. [2022-12-13 13:15:29,766 INFO L231 Difference]: Finished difference. Result has 270 places, 517 transitions, 8279 flow [2022-12-13 13:15:29,766 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=5293, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=8279, PETRI_PLACES=270, PETRI_TRANSITIONS=517} [2022-12-13 13:15:29,766 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 213 predicate places. [2022-12-13 13:15:29,766 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 517 transitions, 8279 flow [2022-12-13 13:15:29,767 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 13:15:29,767 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:15:29,767 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:15:29,771 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 13:15:29,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 13:15:29,968 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 13:15:29,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:15:29,969 INFO L85 PathProgramCache]: Analyzing trace with hash 194328060, now seen corresponding path program 3 times [2022-12-13 13:15:29,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:15:29,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971209701] [2022-12-13 13:15:29,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:15:29,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:15:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:15:30,588 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 13:15:30,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:15:30,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971209701] [2022-12-13 13:15:30,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971209701] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:15:30,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045953726] [2022-12-13 13:15:30,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 13:15:30,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:15:30,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:15:30,590 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:15:30,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 13:15:30,716 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 13:15:30,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:15:30,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 92 conjunts are in the unsatisfiable core [2022-12-13 13:15:30,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:15:30,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:15:30,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:15:30,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-12-13 13:15:30,797 INFO L321 Elim1Store]: treesize reduction 40, result has 45.2 percent of original size [2022-12-13 13:15:30,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 35 treesize of output 55 [2022-12-13 13:15:30,917 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 43 treesize of output 36 [2022-12-13 13:15:30,999 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 62 treesize of output 57 [2022-12-13 13:15:31,186 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 51 treesize of output 44 [2022-12-13 13:15:31,242 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 41 treesize of output 43 [2022-12-13 13:15:31,347 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 56 treesize of output 49 [2022-12-13 13:15:31,418 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 53 treesize of output 48 [2022-12-13 13:15:31,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 48 [2022-12-13 13:15:31,507 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 13:15:31,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:15:31,527 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1271 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1271) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647)) is different from false [2022-12-13 13:15:31,532 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1269 Int) (v_ArrVal_1271 (Array Int 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|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1269)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1271) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647)) is different from false [2022-12-13 13:15:31,701 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1267 Int) (v_ArrVal_1269 Int) (v_ArrVal_1271 (Array Int Int))) (< (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1266))) (store .cse0 |c_~#queue~0.base| (store (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1267)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1269))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1271) |c_~#queue~0.base|) .cse2)) 2147483647)) is different from false [2022-12-13 13:15:31,714 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1267 Int) (v_ArrVal_1269 Int) (v_ArrVal_1271 (Array Int Int))) (< (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (select (store (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 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1266))) (store .cse0 |c_~#queue~0.base| (store (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1267)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1269))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1271) |c_~#queue~0.base|) .cse2)) 2147483647)) is different from false [2022-12-13 13:15:32,030 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 13:15:32,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045953726] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:15:32,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:15:32,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 12] total 31 [2022-12-13 13:15:32,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256652895] [2022-12-13 13:15:32,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:15:32,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-13 13:15:32,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:15:32,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-13 13:15:32,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=617, Unknown=15, NotChecked=228, Total=1056 [2022-12-13 13:15:32,337 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 477 [2022-12-13 13:15:32,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 517 transitions, 8279 flow. Second operand has 33 states, 33 states have (on average 183.72727272727272) internal successors, (6063), 33 states have internal predecessors, (6063), 0 states have call successors, (0), 0 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 13:15:32,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:15:32,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 477 [2022-12-13 13:15:32,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:15:43,226 INFO L130 PetriNetUnfolder]: 12945/24932 cut-off events. [2022-12-13 13:15:43,226 INFO L131 PetriNetUnfolder]: For 928570/928576 co-relation queries the response was YES. [2022-12-13 13:15:43,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212071 conditions, 24932 events. 12945/24932 cut-off events. For 928570/928576 co-relation queries the response was YES. Maximal size of possible extension queue 1063. Compared 227973 event pairs, 5465 based on Foata normal form. 180/23330 useless extension candidates. Maximal degree in co-relation 210447. Up to 13141 conditions per place. [2022-12-13 13:15:43,504 INFO L137 encePairwiseOnDemand]: 455/477 looper letters, 628 selfloop transitions, 281 changer transitions 0/913 dead transitions. [2022-12-13 13:15:43,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 913 transitions, 18074 flow [2022-12-13 13:15:43,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 13:15:43,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-13 13:15:43,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 4834 transitions. [2022-12-13 13:15:43,509 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4053668763102725 [2022-12-13 13:15:43,509 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 4834 transitions. [2022-12-13 13:15:43,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 4834 transitions. [2022-12-13 13:15:43,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:15:43,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 4834 transitions. [2022-12-13 13:15:43,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 193.36) internal successors, (4834), 25 states have internal predecessors, (4834), 0 states have call successors, (0), 0 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 13:15:43,522 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 13:15:43,523 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 13:15:43,523 INFO L175 Difference]: Start difference. First operand has 270 places, 517 transitions, 8279 flow. Second operand 25 states and 4834 transitions. [2022-12-13 13:15:43,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 913 transitions, 18074 flow [2022-12-13 13:15:44,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 913 transitions, 17039 flow, removed 489 selfloop flow, removed 9 redundant places. [2022-12-13 13:15:44,503 INFO L231 Difference]: Finished difference. Result has 292 places, 658 transitions, 11703 flow [2022-12-13 13:15:44,503 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=7346, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=497, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=11703, PETRI_PLACES=292, PETRI_TRANSITIONS=658} [2022-12-13 13:15:44,503 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 235 predicate places. [2022-12-13 13:15:44,504 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 658 transitions, 11703 flow [2022-12-13 13:15:44,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 183.72727272727272) internal successors, (6063), 33 states have internal predecessors, (6063), 0 states have call successors, (0), 0 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 13:15:44,504 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:15:44,504 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:15:44,508 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 13:15:44,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:15:44,706 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 13:15:44,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:15:44,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1181196048, now seen corresponding path program 1 times [2022-12-13 13:15:44,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:15:44,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209129051] [2022-12-13 13:15:44,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:15:44,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:15:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:15:44,780 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 13:15:44,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:15:44,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209129051] [2022-12-13 13:15:44,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209129051] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:15:44,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432494740] [2022-12-13 13:15:44,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:15:44,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:15:44,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:15:44,781 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:15:44,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 13:15:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:15:44,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 13:15:44,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:15:44,907 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 13:15:44,907 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:15:44,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432494740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:15:44,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:15:44,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-13 13:15:44,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967831191] [2022-12-13 13:15:44,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:15:44,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:15:44,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:15:44,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:15:44,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:15:44,917 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 477 [2022-12-13 13:15:44,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 658 transitions, 11703 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 13:15:44,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:15:44,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 477 [2022-12-13 13:15:44,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:15:51,634 INFO L130 PetriNetUnfolder]: 12562/24446 cut-off events. [2022-12-13 13:15:51,634 INFO L131 PetriNetUnfolder]: For 1321973/1321973 co-relation queries the response was YES. [2022-12-13 13:15:51,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232147 conditions, 24446 events. 12562/24446 cut-off events. For 1321973/1321973 co-relation queries the response was YES. Maximal size of possible extension queue 1053. Compared 225687 event pairs, 5591 based on Foata normal form. 125/23057 useless extension candidates. Maximal degree in co-relation 220171. Up to 22355 conditions per place. [2022-12-13 13:15:51,976 INFO L137 encePairwiseOnDemand]: 474/477 looper letters, 626 selfloop transitions, 5 changer transitions 0/635 dead transitions. [2022-12-13 13:15:51,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 635 transitions, 12788 flow [2022-12-13 13:15:51,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:15:51,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:15:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1013 transitions. [2022-12-13 13:15:51,979 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5309224318658281 [2022-12-13 13:15:51,979 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1013 transitions. [2022-12-13 13:15:51,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1013 transitions. [2022-12-13 13:15:51,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:15:51,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1013 transitions. [2022-12-13 13:15:51,981 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 13:15:51,983 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 13:15:51,983 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 13:15:51,983 INFO L175 Difference]: Start difference. First operand has 292 places, 658 transitions, 11703 flow. Second operand 4 states and 1013 transitions. [2022-12-13 13:15:51,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 635 transitions, 12788 flow [2022-12-13 13:15:53,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 635 transitions, 11901 flow, removed 364 selfloop flow, removed 8 redundant places. [2022-12-13 13:15:53,570 INFO L231 Difference]: Finished difference. Result has 286 places, 624 transitions, 10206 flow [2022-12-13 13:15:53,570 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=10196, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=624, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=619, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=10206, PETRI_PLACES=286, PETRI_TRANSITIONS=624} [2022-12-13 13:15:53,571 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 229 predicate places. [2022-12-13 13:15:53,571 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 624 transitions, 10206 flow [2022-12-13 13:15:53,571 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 13:15:53,571 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:15:53,571 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:15:53,575 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 13:15:53,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:15:53,773 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 13:15:53,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:15:53,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1337027909, now seen corresponding path program 1 times [2022-12-13 13:15:53,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:15:53,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506733720] [2022-12-13 13:15:53,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:15:53,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:15:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:15:53,850 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 13:15:53,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:15:53,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506733720] [2022-12-13 13:15:53,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506733720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:15:53,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:15:53,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:15:53,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396901445] [2022-12-13 13:15:53,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:15:53,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:15:53,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:15:53,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:15:53,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:15:53,861 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 477 [2022-12-13 13:15:53,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 624 transitions, 10206 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 13:15:53,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:15:53,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 477 [2022-12-13 13:15:53,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:16:00,121 INFO L130 PetriNetUnfolder]: 12181/24010 cut-off events. [2022-12-13 13:16:00,121 INFO L131 PetriNetUnfolder]: For 1247441/1247441 co-relation queries the response was YES. [2022-12-13 13:16:00,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218343 conditions, 24010 events. 12181/24010 cut-off events. For 1247441/1247441 co-relation queries the response was YES. Maximal size of possible extension queue 1052. Compared 224364 event pairs, 6649 based on Foata normal form. 256/22859 useless extension candidates. Maximal degree in co-relation 209522. Up to 14691 conditions per place. [2022-12-13 13:16:00,412 INFO L137 encePairwiseOnDemand]: 473/477 looper letters, 496 selfloop transitions, 97 changer transitions 0/597 dead transitions. [2022-12-13 13:16:00,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 597 transitions, 11043 flow [2022-12-13 13:16:00,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:16:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:16:00,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 760 transitions. [2022-12-13 13:16:00,414 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5310971348707197 [2022-12-13 13:16:00,414 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 760 transitions. [2022-12-13 13:16:00,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 760 transitions. [2022-12-13 13:16:00,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:16:00,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 760 transitions. [2022-12-13 13:16:00,415 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 13:16:00,416 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 13:16:00,416 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 13:16:00,416 INFO L175 Difference]: Start difference. First operand has 286 places, 624 transitions, 10206 flow. Second operand 3 states and 760 transitions. [2022-12-13 13:16:00,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 597 transitions, 11043 flow [2022-12-13 13:16:01,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 597 transitions, 10833 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 13:16:01,638 INFO L231 Difference]: Finished difference. Result has 284 places, 589 transitions, 9587 flow [2022-12-13 13:16:01,638 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=9393, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=589, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=9587, PETRI_PLACES=284, PETRI_TRANSITIONS=589} [2022-12-13 13:16:01,639 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 227 predicate places. [2022-12-13 13:16:01,639 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 589 transitions, 9587 flow [2022-12-13 13:16:01,639 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 13:16:01,639 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:16:01,639 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 13:16:01,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 13:16:01,639 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 13:16:01,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:01,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1886173447, now seen corresponding path program 1 times [2022-12-13 13:16:01,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:01,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933434547] [2022-12-13 13:16:01,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:01,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:01,681 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 13:16:01,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:16:01,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933434547] [2022-12-13 13:16:01,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933434547] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:16:01,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861062368] [2022-12-13 13:16:01,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:01,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:16:01,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:01,683 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:16:01,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 13:16:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:01,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 13:16:01,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:16:01,817 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 13:16:01,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:16:01,833 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 13:16:01,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861062368] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:16:01,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:16:01,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 13:16:01,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740978949] [2022-12-13 13:16:01,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:16:01,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:16:01,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:16:01,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:16:01,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:16:01,847 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 477 [2022-12-13 13:16:01,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 589 transitions, 9587 flow. Second operand has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 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 13:16:01,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:16:01,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 477 [2022-12-13 13:16:01,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:16:05,811 INFO L130 PetriNetUnfolder]: 6847/12906 cut-off events. [2022-12-13 13:16:05,811 INFO L131 PetriNetUnfolder]: For 862090/862090 co-relation queries the response was YES. [2022-12-13 13:16:05,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156096 conditions, 12906 events. 6847/12906 cut-off events. For 862090/862090 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 94014 event pairs, 1738 based on Foata normal form. 479/13121 useless extension candidates. Maximal degree in co-relation 149009. Up to 5203 conditions per place. [2022-12-13 13:16:05,947 INFO L137 encePairwiseOnDemand]: 473/477 looper letters, 571 selfloop transitions, 50 changer transitions 0/625 dead transitions. [2022-12-13 13:16:05,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 625 transitions, 11777 flow [2022-12-13 13:16:05,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:16:05,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:16:05,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1514 transitions. [2022-12-13 13:16:05,950 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5290006988120196 [2022-12-13 13:16:05,950 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1514 transitions. [2022-12-13 13:16:05,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1514 transitions. [2022-12-13 13:16:05,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:16:05,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1514 transitions. [2022-12-13 13:16:05,952 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 13:16:05,953 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 13:16:05,954 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 13:16:05,954 INFO L175 Difference]: Start difference. First operand has 284 places, 589 transitions, 9587 flow. Second operand 6 states and 1514 transitions. [2022-12-13 13:16:05,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 625 transitions, 11777 flow [2022-12-13 13:16:06,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 625 transitions, 11604 flow, removed 19 selfloop flow, removed 3 redundant places. [2022-12-13 13:16:06,806 INFO L231 Difference]: Finished difference. Result has 290 places, 563 transitions, 8999 flow [2022-12-13 13:16:06,806 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=8605, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8999, PETRI_PLACES=290, PETRI_TRANSITIONS=563} [2022-12-13 13:16:06,807 INFO L288 CegarLoopForPetriNet]: 57 programPoint places, 233 predicate places. [2022-12-13 13:16:06,807 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 563 transitions, 8999 flow [2022-12-13 13:16:06,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 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 13:16:06,807 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:16:06,807 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:16:06,811 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 13:16:07,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:16:07,009 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-13 13:16:07,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:07,010 INFO L85 PathProgramCache]: Analyzing trace with hash -2129760670, now seen corresponding path program 1 times [2022-12-13 13:16:07,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:07,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028457100] [2022-12-13 13:16:07,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:07,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:08,184 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 13:16:08,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:16:08,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028457100] [2022-12-13 13:16:08,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028457100] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:16:08,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3761773] [2022-12-13 13:16:08,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:08,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:16:08,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:08,185 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:16:08,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f323e2c-376a-4316-8a30-7140717dff8c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 13:16:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:08,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 97 conjunts are in the unsatisfiable core [2022-12-13 13:16:08,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:16:08,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:16:08,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:16:08,325 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 13:16:08,325 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 13:16:08,339 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 13:16:08,339 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 13:16:08,434 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 13:16:08,536 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 13:16:08,689 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 13:16:08,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:16:08,777 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 13:16:08,899 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 13:16:09,275 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 13:16:10,292 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 57 treesize of output 59 [2022-12-13 13:16:12,762 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 13:16:17,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:16:17,089 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 13:16:17,909 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 13:16:23,157 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 13:16:23,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:16:23,282 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1609 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1607 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1607) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| 4) |c_~#queue~0.offset|) v_ArrVal_1609) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| (select .cse0 (+ 84 |c_~#queue~0.offset|))))))) is different from false [2022-12-13 13:16:23,488 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1605 Int) (v_ArrVal_1609 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1607 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1604))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1605)) |c_~#stored_elements~0.base| v_ArrVal_1607) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1605) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| 4) |c_~#queue~0.offset|) v_ArrVal_1609) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| (select .cse2 (+ 84 |c_~#queue~0.offset|))))))))) is different from false [2022-12-13 13:16:23,512 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1605 Int) (v_ArrVal_1609 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1602 Int) (v_ArrVal_1607 (Array Int 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|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1602)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1604))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1605)) |c_~#stored_elements~0.base| v_ArrVal_1607) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| 4) |c_~#queue~0.offset|) v_ArrVal_1609) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_1602 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1605) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| (select .cse0 (+ 84 |c_~#queue~0.offset|))))))))) is different from false [2022-12-13 13:16:23,538 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1605 Int) (v_ArrVal_1609 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1602 Int) (v_ArrVal_1607 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1602)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1604))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1605)) |c_~#stored_elements~0.base| v_ArrVal_1607) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1602) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| 4) |c_~#queue~0.offset|) v_ArrVal_1609) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1605) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| (select .cse2 (+ 84 |c_~#queue~0.offset|)))))))))) is different from false [2022-12-13 13:16:23,567 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1605 Int) (v_ArrVal_1609 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1602 Int) (v_ArrVal_1601 Int) (v_ArrVal_1607 (Array Int 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_1601)) (.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1602)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1604))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1605)) |c_~#stored_elements~0.base| v_ArrVal_1607) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1602) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| 4) |c_~#queue~0.offset|) v_ArrVal_1609) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1605))))))) is different from false [2022-12-13 13:16:23,591 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1605 Int) (v_ArrVal_1609 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_1602 Int) (v_ArrVal_1601 Int) (v_ArrVal_1607 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_1601)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1602)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1604))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store .cse5 .cse4 v_ArrVal_1605)) |c_~#stored_elements~0.base| v_ArrVal_1607) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1602) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| 4) |c_~#queue~0.offset|) v_ArrVal_1609) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse3 .cse4))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| (select .cse2 .cse4))) (< (+ (select .cse5 .cse4) 1) v_ArrVal_1605)))))))) is different from false [2022-12-13 13:16:23,621 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1605 Int) (v_ArrVal_1599 (Array Int Int)) (v_ArrVal_1609 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_1602 Int) (v_ArrVal_1601 Int) (v_ArrVal_1607 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1599))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_1601)) (.cse3 (+ 88 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse5 .cse3 v_ArrVal_1602)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1604))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1605)) |c_~#stored_elements~0.base| v_ArrVal_1607) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1605) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| (select .cse2 .cse1))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| 4) |c_~#queue~0.offset|) v_ArrVal_1609) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse4 .cse1))) (< (+ (select .cse5 .cse3) 1) v_ArrVal_1602))))))))) is different from false [2022-12-13 13:16:23,656 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1605 Int) (v_ArrVal_1599 (Array Int Int)) (v_ArrVal_1609 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1597 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_1602 Int) (v_ArrVal_1601 Int) (v_ArrVal_1607 (Array Int 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|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1597)) |c_~#stored_elements~0.base| v_ArrVal_1599))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_1601)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1602)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1604))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_1605)) |c_~#stored_elements~0.base| v_ArrVal_1607) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1602) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1605) (not (<= v_ArrVal_1597 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse4 .cse3))) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| 4) |c_~#queue~0.offset|) v_ArrVal_1609) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| (select .cse5 .cse3))))))))))) is different from false [2022-12-13 13:16:23,701 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1605 Int) (v_ArrVal_1599 (Array Int Int)) (v_ArrVal_1609 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1597 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_1602 Int) (v_ArrVal_1601 Int) (v_ArrVal_1607 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1597)) |c_~#stored_elements~0.base| v_ArrVal_1599))) (let ((.cse6 (select .cse9 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_1601)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1602)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1604))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (select (store (store .cse8 |c_~#queue~0.base| (store .cse4 .cse5 v_ArrVal_1605)) |c_~#stored_elements~0.base| v_ArrVal_1607) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1602) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1597) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1605) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse6 .cse5))) (< (select (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| 4) |c_~#queue~0.offset|) v_ArrVal_1609) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| (select .cse7 .cse5)))))))))))) is different from false [2022-12-13 13:16:23,794 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1605 Int) (v_ArrVal_1599 (Array Int Int)) (v_ArrVal_1609 Int) (v_ArrVal_1595 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1597 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_1602 Int) (v_ArrVal_1601 Int) (v_ArrVal_1607 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1595) .cse5 v_ArrVal_1597)) |c_~#stored_elements~0.base| v_ArrVal_1599))) (let ((.cse6 (select .cse9 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_1601)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1602)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1604))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse8 |c_~#queue~0.base| (store .cse7 .cse3 v_ArrVal_1605)) |c_~#stored_elements~0.base| v_ArrVal_1607) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1602) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| (select .cse2 .cse3))) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1597) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse6 .cse3))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| 4) |c_~#queue~0.offset|) v_ArrVal_1609) .cse1) 2147483647) (not (<= v_ArrVal_1595 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse7 .cse3) 1) v_ArrVal_1605)))))))))) is different from false [2022-12-13 13:16:23,852 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1605 Int) (v_ArrVal_1599 (Array Int Int)) (v_ArrVal_1609 Int) (v_ArrVal_1595 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1597 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_1602 Int) (v_ArrVal_1601 Int) (v_ArrVal_1607 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 .cse8 v_ArrVal_1595) .cse5 v_ArrVal_1597)) |c_~#stored_elements~0.base| v_ArrVal_1599))) (let ((.cse6 (select .cse10 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_1601)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1602)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1604))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse9 |c_~#queue~0.base| (store .cse7 .cse3 v_ArrVal_1605)) |c_~#stored_elements~0.base| v_ArrVal_1607) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1602) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| (select .cse2 .cse3))) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1597) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse6 .cse3))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| 4) |c_~#queue~0.offset|) v_ArrVal_1609) .cse1) 2147483647) (< (+ (select .cse7 .cse3) 1) v_ArrVal_1605) (< (+ (select .cse4 .cse8) 1) v_ArrVal_1595)))))))))) is different from false [2022-12-13 13:16:23,922 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1605 Int) (v_ArrVal_1599 (Array Int Int)) (v_ArrVal_1609 Int) (v_ArrVal_1594 Int) (v_ArrVal_1595 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1597 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_1602 Int) (v_ArrVal_1601 Int) (v_ArrVal_1607 (Array Int 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_1594)) (.cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse2 v_ArrVal_1595) .cse1 v_ArrVal_1597)) |c_~#stored_elements~0.base| v_ArrVal_1599))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse5 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_1601)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store .cse5 .cse6 v_ArrVal_1602)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1604))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (select (store (store .cse9 |c_~#queue~0.base| (store .cse8 .cse4 v_ArrVal_1605)) |c_~#stored_elements~0.base| v_ArrVal_1607) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1597) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1595) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| (select .cse3 .cse4))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1602) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse7 .cse4))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| 4) |c_~#queue~0.offset|) v_ArrVal_1609) .cse6) 2147483647) (< (+ (select .cse8 .cse4) 1) v_ArrVal_1605)))))))))) is different from false [2022-12-13 13:16:30,383 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 13:16:30,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3761773] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:16:30,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:16:30,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 52 [2022-12-13 13:16:30,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745771834] [2022-12-13 13:16:30,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:16:30,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-12-13 13:16:30,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:16:30,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-12-13 13:16:30,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=1299, Unknown=23, NotChecked=1092, Total=2862 [2022-12-13 13:16:30,879 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 477 [2022-12-13 13:16:30,883 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 563 transitions, 8999 flow. Second operand has 54 states, 54 states have (on average 177.38888888888889) internal successors, (9579), 54 states have internal predecessors, (9579), 0 states have call successors, (0), 0 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 13:16:30,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:16:30,883 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 477 [2022-12-13 13:16:30,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:16:46,904 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 13:16:51,279 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 13:16:59,660 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 13:17:11,796 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 13:17:13,813 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 13:17:15,820 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 13:17:17,831 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 13:17:19,837 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 13:17:21,843 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 13:17:30,585 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 13:17:32,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 13:17:34,599 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 13:17:36,606 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 13:17:38,612 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 13:17:40,649 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 13:17:54,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 13:18:07,134 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 13:18:08,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 13:18:10,563 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 13:18:12,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 13:18:14,574 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 13:18:16,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 13:18:18,586 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 13:18:20,952 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 13:18:22,961 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 13:18:24,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 13:18:26,978 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 13:18:28,984 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 13:18:30,990 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 13:18:32,997 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 13:18:35,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 13:18:59,411 WARN L233 SmtUtils]: Spent 10.27s on a formula simplification. DAG size of input: 192 DAG size of output: 164 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 13:19:01,441 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 13:19:19,882 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 13:19:33,667 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 13:19:35,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 13:19:37,762 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 13:19:56,521 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]