./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/popl20-more-nonblocking-counter-alt2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/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_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/popl20-more-nonblocking-counter-alt2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3697d9128f1f55a146432bb6e854f5639b64b16acb09c5233c8611aa24537748 --- 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 19:08:21,351 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 19:08:21,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 19:08:21,365 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 19:08:21,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 19:08:21,366 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 19:08:21,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 19:08:21,367 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 19:08:21,368 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 19:08:21,369 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 19:08:21,370 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 19:08:21,370 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 19:08:21,371 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 19:08:21,371 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 19:08:21,372 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 19:08:21,373 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 19:08:21,373 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 19:08:21,374 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 19:08:21,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 19:08:21,376 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 19:08:21,377 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 19:08:21,378 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 19:08:21,378 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 19:08:21,379 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 19:08:21,381 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 19:08:21,381 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 19:08:21,381 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 19:08:21,382 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 19:08:21,382 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 19:08:21,383 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 19:08:21,383 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 19:08:21,384 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 19:08:21,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 19:08:21,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 19:08:21,385 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 19:08:21,385 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 19:08:21,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 19:08:21,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 19:08:21,386 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 19:08:21,387 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 19:08:21,387 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 19:08:21,388 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 19:08:21,412 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 19:08:21,412 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 19:08:21,413 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 19:08:21,413 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 19:08:21,419 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 19:08:21,419 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 19:08:21,419 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 19:08:21,420 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 19:08:21,420 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 19:08:21,420 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 19:08:21,420 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 19:08:21,421 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 19:08:21,421 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 19:08:21,421 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 19:08:21,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 19:08:21,421 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 19:08:21,422 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 19:08:21,422 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 19:08:21,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 19:08:21,422 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 19:08:21,422 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 19:08:21,423 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 19:08:21,423 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 19:08:21,423 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 19:08:21,423 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 19:08:21,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:08:21,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 19:08:21,424 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 19:08:21,424 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 19:08:21,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 19:08:21,424 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 19:08:21,424 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 19:08:21,424 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 19:08:21,424 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 19:08:21,424 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_6976e042-2772-4c27-a2ab-92940ebc68b3/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_6976e042-2772-4c27-a2ab-92940ebc68b3/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 3697d9128f1f55a146432bb6e854f5639b64b16acb09c5233c8611aa24537748 [2022-12-13 19:08:21,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 19:08:21,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 19:08:21,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 19:08:21,606 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 19:08:21,607 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 19:08:21,607 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/weaver/popl20-more-nonblocking-counter-alt2.wvr.c [2022-12-13 19:08:24,129 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 19:08:24,253 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 19:08:24,253 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/sv-benchmarks/c/weaver/popl20-more-nonblocking-counter-alt2.wvr.c [2022-12-13 19:08:24,258 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/data/738c2a817/cbbabffd74ed403887f2dc50da100760/FLAGed61e63a7 [2022-12-13 19:08:24,269 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/data/738c2a817/cbbabffd74ed403887f2dc50da100760 [2022-12-13 19:08:24,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 19:08:24,272 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 19:08:24,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 19:08:24,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 19:08:24,275 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 19:08:24,276 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:08:24" (1/1) ... [2022-12-13 19:08:24,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5abf45e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:08:24, skipping insertion in model container [2022-12-13 19:08:24,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:08:24" (1/1) ... [2022-12-13 19:08:24,283 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 19:08:24,296 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 19:08:24,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:08:24,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:08:24,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:08:24,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:08:24,410 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_6976e042-2772-4c27-a2ab-92940ebc68b3/sv-benchmarks/c/weaver/popl20-more-nonblocking-counter-alt2.wvr.c[2147,2160] [2022-12-13 19:08:24,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:08:24,421 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 19:08:24,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:08:24,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:08:24,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:08:24,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:08:24,435 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_6976e042-2772-4c27-a2ab-92940ebc68b3/sv-benchmarks/c/weaver/popl20-more-nonblocking-counter-alt2.wvr.c[2147,2160] [2022-12-13 19:08:24,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:08:24,446 INFO L208 MainTranslator]: Completed translation [2022-12-13 19:08:24,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:08:24 WrapperNode [2022-12-13 19:08:24,447 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 19:08:24,447 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 19:08:24,447 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 19:08:24,448 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 19:08:24,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:08:24" (1/1) ... [2022-12-13 19:08:24,459 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:08:24" (1/1) ... [2022-12-13 19:08:24,472 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2022-12-13 19:08:24,472 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 19:08:24,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 19:08:24,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 19:08:24,473 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 19:08:24,479 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:08:24" (1/1) ... [2022-12-13 19:08:24,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:08:24" (1/1) ... [2022-12-13 19:08:24,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:08:24" (1/1) ... [2022-12-13 19:08:24,481 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:08:24" (1/1) ... [2022-12-13 19:08:24,484 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:08:24" (1/1) ... [2022-12-13 19:08:24,486 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:08:24" (1/1) ... [2022-12-13 19:08:24,487 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:08:24" (1/1) ... [2022-12-13 19:08:24,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:08:24" (1/1) ... [2022-12-13 19:08:24,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 19:08:24,490 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 19:08:24,490 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 19:08:24,490 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 19:08:24,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:08:24" (1/1) ... [2022-12-13 19:08:24,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:08:24,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:08:24,516 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 19:08:24,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 19:08:24,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 19:08:24,543 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 19:08:24,543 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 19:08:24,543 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 19:08:24,543 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 19:08:24,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 19:08:24,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 19:08:24,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 19:08:24,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 19:08:24,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 19:08:24,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 19:08:24,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 19:08:24,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 19:08:24,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 19:08:24,545 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 19:08:24,620 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 19:08:24,621 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 19:08:24,777 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 19:08:24,813 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 19:08:24,813 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 19:08:24,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:08:24 BoogieIcfgContainer [2022-12-13 19:08:24,816 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 19:08:24,818 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 19:08:24,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 19:08:24,822 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 19:08:24,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:08:24" (1/3) ... [2022-12-13 19:08:24,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a862a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:08:24, skipping insertion in model container [2022-12-13 19:08:24,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:08:24" (2/3) ... [2022-12-13 19:08:24,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a862a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:08:24, skipping insertion in model container [2022-12-13 19:08:24,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:08:24" (3/3) ... [2022-12-13 19:08:24,825 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-nonblocking-counter-alt2.wvr.c [2022-12-13 19:08:24,844 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 19:08:24,844 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-12-13 19:08:24,844 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 19:08:24,918 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 19:08:24,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 96 transitions, 208 flow [2022-12-13 19:08:24,981 INFO L130 PetriNetUnfolder]: 6/94 cut-off events. [2022-12-13 19:08:24,981 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 19:08:24,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 94 events. 6/94 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-12-13 19:08:24,985 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 96 transitions, 208 flow [2022-12-13 19:08:24,988 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 89 transitions, 190 flow [2022-12-13 19:08:24,991 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 19:08:24,999 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 89 transitions, 190 flow [2022-12-13 19:08:25,001 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 89 transitions, 190 flow [2022-12-13 19:08:25,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 89 transitions, 190 flow [2022-12-13 19:08:25,019 INFO L130 PetriNetUnfolder]: 6/89 cut-off events. [2022-12-13 19:08:25,019 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 19:08:25,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 89 events. 6/89 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-12-13 19:08:25,020 INFO L119 LiptonReduction]: Number of co-enabled transitions 540 [2022-12-13 19:08:26,907 INFO L134 LiptonReduction]: Checked pairs total: 653 [2022-12-13 19:08:26,907 INFO L136 LiptonReduction]: Total number of compositions: 91 [2022-12-13 19:08:26,921 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 19:08:26,925 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@55fa84d7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 19:08:26,925 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2022-12-13 19:08:26,926 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 19:08:26,926 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 19:08:26,926 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:08:26,927 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 19:08:26,927 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-12-13 19:08:26,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:08:26,931 INFO L85 PathProgramCache]: Analyzing trace with hash 374, now seen corresponding path program 1 times [2022-12-13 19:08:26,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:08:26,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789799800] [2022-12-13 19:08:26,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:08:26,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:08:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:08:27,002 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 19:08:27,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:08:27,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789799800] [2022-12-13 19:08:27,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789799800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:08:27,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:08:27,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 19:08:27,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858479525] [2022-12-13 19:08:27,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:08:27,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 19:08:27,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:08:27,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 19:08:27,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 19:08:27,026 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 187 [2022-12-13 19:08:27,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 24 transitions, 60 flow. Second operand has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 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 19:08:27,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:08:27,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 187 [2022-12-13 19:08:27,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:08:27,088 INFO L130 PetriNetUnfolder]: 100/163 cut-off events. [2022-12-13 19:08:27,088 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 19:08:27,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 338 conditions, 163 events. 100/163 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 505 event pairs, 42 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 264. Up to 160 conditions per place. [2022-12-13 19:08:27,091 INFO L137 encePairwiseOnDemand]: 184/187 looper letters, 19 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2022-12-13 19:08:27,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 21 transitions, 92 flow [2022-12-13 19:08:27,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 19:08:27,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 19:08:27,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 194 transitions. [2022-12-13 19:08:27,104 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5187165775401069 [2022-12-13 19:08:27,105 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 194 transitions. [2022-12-13 19:08:27,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 194 transitions. [2022-12-13 19:08:27,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:08:27,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 194 transitions. [2022-12-13 19:08:27,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 97.0) internal successors, (194), 2 states have internal predecessors, (194), 0 states have call successors, (0), 0 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 19:08:27,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 0 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 19:08:27,116 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 0 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 19:08:27,117 INFO L175 Difference]: Start difference. First operand has 29 places, 24 transitions, 60 flow. Second operand 2 states and 194 transitions. [2022-12-13 19:08:27,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 21 transitions, 92 flow [2022-12-13 19:08:27,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 21 transitions, 84 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 19:08:27,122 INFO L231 Difference]: Finished difference. Result has 23 places, 21 transitions, 46 flow [2022-12-13 19:08:27,124 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=46, PETRI_PLACES=23, PETRI_TRANSITIONS=21} [2022-12-13 19:08:27,127 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, -6 predicate places. [2022-12-13 19:08:27,127 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 21 transitions, 46 flow [2022-12-13 19:08:27,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 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 19:08:27,128 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:08:27,128 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 19:08:27,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 19:08:27,128 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-12-13 19:08:27,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:08:27,129 INFO L85 PathProgramCache]: Analyzing trace with hash 365507, now seen corresponding path program 1 times [2022-12-13 19:08:27,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:08:27,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290445257] [2022-12-13 19:08:27,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:08:27,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:08:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:08:27,282 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 19:08:27,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:08:27,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290445257] [2022-12-13 19:08:27,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290445257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:08:27,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:08:27,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 19:08:27,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171613623] [2022-12-13 19:08:27,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:08:27,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:08:27,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:08:27,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:08:27,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:08:27,311 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 187 [2022-12-13 19:08:27,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 21 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 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 19:08:27,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:08:27,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 187 [2022-12-13 19:08:27,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:08:27,358 INFO L130 PetriNetUnfolder]: 93/150 cut-off events. [2022-12-13 19:08:27,358 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 19:08:27,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 150 events. 93/150 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 456 event pairs, 39 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 300. Up to 146 conditions per place. [2022-12-13 19:08:27,360 INFO L137 encePairwiseOnDemand]: 184/187 looper letters, 16 selfloop transitions, 1 changer transitions 0/19 dead transitions. [2022-12-13 19:08:27,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 19 transitions, 76 flow [2022-12-13 19:08:27,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:08:27,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:08:27,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2022-12-13 19:08:27,363 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46702317290552586 [2022-12-13 19:08:27,363 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 262 transitions. [2022-12-13 19:08:27,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 262 transitions. [2022-12-13 19:08:27,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:08:27,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 262 transitions. [2022-12-13 19:08:27,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 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 19:08:27,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 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 19:08:27,366 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 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 19:08:27,366 INFO L175 Difference]: Start difference. First operand has 23 places, 21 transitions, 46 flow. Second operand 3 states and 262 transitions. [2022-12-13 19:08:27,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 19 transitions, 76 flow [2022-12-13 19:08:27,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 19 transitions, 76 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 19:08:27,366 INFO L231 Difference]: Finished difference. Result has 23 places, 19 transitions, 44 flow [2022-12-13 19:08:27,366 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=23, PETRI_TRANSITIONS=19} [2022-12-13 19:08:27,367 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, -6 predicate places. [2022-12-13 19:08:27,367 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 44 flow [2022-12-13 19:08:27,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 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 19:08:27,367 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:08:27,367 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 19:08:27,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 19:08:27,368 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-12-13 19:08:27,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:08:27,368 INFO L85 PathProgramCache]: Analyzing trace with hash 365508, now seen corresponding path program 1 times [2022-12-13 19:08:27,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:08:27,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301817464] [2022-12-13 19:08:27,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:08:27,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:08:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:08:27,413 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 19:08:27,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:08:27,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301817464] [2022-12-13 19:08:27,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301817464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:08:27,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:08:27,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 19:08:27,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251082727] [2022-12-13 19:08:27,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:08:27,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:08:27,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:08:27,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:08:27,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:08:27,448 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 187 [2022-12-13 19:08:27,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 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 19:08:27,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:08:27,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 187 [2022-12-13 19:08:27,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:08:27,484 INFO L130 PetriNetUnfolder]: 86/137 cut-off events. [2022-12-13 19:08:27,484 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 19:08:27,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 137 events. 86/137 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 403 event pairs, 36 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 275. Up to 133 conditions per place. [2022-12-13 19:08:27,486 INFO L137 encePairwiseOnDemand]: 184/187 looper letters, 14 selfloop transitions, 1 changer transitions 0/17 dead transitions. [2022-12-13 19:08:27,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 17 transitions, 70 flow [2022-12-13 19:08:27,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:08:27,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:08:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2022-12-13 19:08:27,488 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44206773618538325 [2022-12-13 19:08:27,488 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 248 transitions. [2022-12-13 19:08:27,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 248 transitions. [2022-12-13 19:08:27,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:08:27,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 248 transitions. [2022-12-13 19:08:27,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 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 19:08:27,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 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 19:08:27,490 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 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 19:08:27,490 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 44 flow. Second operand 3 states and 248 transitions. [2022-12-13 19:08:27,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 17 transitions, 70 flow [2022-12-13 19:08:27,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 17 transitions, 69 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 19:08:27,491 INFO L231 Difference]: Finished difference. Result has 22 places, 17 transitions, 41 flow [2022-12-13 19:08:27,491 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=39, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=41, PETRI_PLACES=22, PETRI_TRANSITIONS=17} [2022-12-13 19:08:27,491 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, -7 predicate places. [2022-12-13 19:08:27,491 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 17 transitions, 41 flow [2022-12-13 19:08:27,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 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 19:08:27,492 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:08:27,492 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 19:08:27,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 19:08:27,492 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-12-13 19:08:27,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:08:27,492 INFO L85 PathProgramCache]: Analyzing trace with hash 351259313, now seen corresponding path program 1 times [2022-12-13 19:08:27,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:08:27,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968950398] [2022-12-13 19:08:27,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:08:27,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:08:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:08:27,551 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 19:08:27,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:08:27,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968950398] [2022-12-13 19:08:27,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968950398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:08:27,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:08:27,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:08:27,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997804012] [2022-12-13 19:08:27,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:08:27,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:08:27,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:08:27,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:08:27,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:08:27,603 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 187 [2022-12-13 19:08:27,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 17 transitions, 41 flow. Second operand has 4 states, 4 states have (on average 74.25) internal successors, (297), 4 states have internal predecessors, (297), 0 states have call successors, (0), 0 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 19:08:27,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:08:27,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 187 [2022-12-13 19:08:27,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:08:27,637 INFO L130 PetriNetUnfolder]: 65/107 cut-off events. [2022-12-13 19:08:27,637 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 19:08:27,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 107 events. 65/107 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 283 event pairs, 27 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 216. Up to 103 conditions per place. [2022-12-13 19:08:27,638 INFO L137 encePairwiseOnDemand]: 185/187 looper letters, 13 selfloop transitions, 1 changer transitions 0/16 dead transitions. [2022-12-13 19:08:27,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 16 transitions, 67 flow [2022-12-13 19:08:27,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:08:27,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:08:27,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2022-12-13 19:08:27,640 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41711229946524064 [2022-12-13 19:08:27,640 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 234 transitions. [2022-12-13 19:08:27,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 234 transitions. [2022-12-13 19:08:27,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:08:27,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 234 transitions. [2022-12-13 19:08:27,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 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 19:08:27,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 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 19:08:27,644 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 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 19:08:27,644 INFO L175 Difference]: Start difference. First operand has 22 places, 17 transitions, 41 flow. Second operand 3 states and 234 transitions. [2022-12-13 19:08:27,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 16 transitions, 67 flow [2022-12-13 19:08:27,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 16 transitions, 66 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 19:08:27,645 INFO L231 Difference]: Finished difference. Result has 22 places, 16 transitions, 40 flow [2022-12-13 19:08:27,645 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=22, PETRI_TRANSITIONS=16} [2022-12-13 19:08:27,645 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, -7 predicate places. [2022-12-13 19:08:27,645 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 16 transitions, 40 flow [2022-12-13 19:08:27,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 4 states have internal predecessors, (297), 0 states have call successors, (0), 0 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 19:08:27,645 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:08:27,646 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 19:08:27,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 19:08:27,646 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-12-13 19:08:27,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:08:27,646 INFO L85 PathProgramCache]: Analyzing trace with hash 351259312, now seen corresponding path program 1 times [2022-12-13 19:08:27,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:08:27,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332636003] [2022-12-13 19:08:27,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:08:27,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:08:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:08:27,707 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 19:08:27,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:08:27,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332636003] [2022-12-13 19:08:27,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332636003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:08:27,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:08:27,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 19:08:27,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586788570] [2022-12-13 19:08:27,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:08:27,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:08:27,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:08:27,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:08:27,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:08:27,733 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 187 [2022-12-13 19:08:27,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 16 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 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 19:08:27,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:08:27,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 187 [2022-12-13 19:08:27,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:08:27,761 INFO L130 PetriNetUnfolder]: 44/77 cut-off events. [2022-12-13 19:08:27,761 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 19:08:27,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 77 events. 44/77 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 168 event pairs, 18 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 157. Up to 73 conditions per place. [2022-12-13 19:08:27,762 INFO L137 encePairwiseOnDemand]: 185/187 looper letters, 12 selfloop transitions, 1 changer transitions 0/15 dead transitions. [2022-12-13 19:08:27,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 15 transitions, 64 flow [2022-12-13 19:08:27,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:08:27,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:08:27,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2022-12-13 19:08:27,763 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45811051693404636 [2022-12-13 19:08:27,763 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 257 transitions. [2022-12-13 19:08:27,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 257 transitions. [2022-12-13 19:08:27,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:08:27,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 257 transitions. [2022-12-13 19:08:27,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 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 19:08:27,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 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 19:08:27,766 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 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 19:08:27,766 INFO L175 Difference]: Start difference. First operand has 22 places, 16 transitions, 40 flow. Second operand 3 states and 257 transitions. [2022-12-13 19:08:27,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 15 transitions, 64 flow [2022-12-13 19:08:27,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 15 transitions, 63 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 19:08:27,767 INFO L231 Difference]: Finished difference. Result has 22 places, 15 transitions, 39 flow [2022-12-13 19:08:27,767 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=37, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=39, PETRI_PLACES=22, PETRI_TRANSITIONS=15} [2022-12-13 19:08:27,768 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, -7 predicate places. [2022-12-13 19:08:27,768 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 15 transitions, 39 flow [2022-12-13 19:08:27,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 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 19:08:27,768 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:08:27,768 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:08:27,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 19:08:27,769 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-12-13 19:08:27,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:08:27,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1800419587, now seen corresponding path program 1 times [2022-12-13 19:08:27,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:08:27,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399868166] [2022-12-13 19:08:27,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:08:27,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:08:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:08:27,898 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 19:08:27,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:08:27,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399868166] [2022-12-13 19:08:27,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399868166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:08:27,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:08:27,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:08:27,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283007706] [2022-12-13 19:08:27,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:08:27,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:08:27,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:08:27,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:08:27,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:08:27,917 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 187 [2022-12-13 19:08:27,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 15 transitions, 39 flow. Second operand has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 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 19:08:27,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:08:27,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 187 [2022-12-13 19:08:27,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:08:27,957 INFO L130 PetriNetUnfolder]: 54/95 cut-off events. [2022-12-13 19:08:27,957 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 19:08:27,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 95 events. 54/95 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 242 event pairs, 20 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 197. Up to 73 conditions per place. [2022-12-13 19:08:27,957 INFO L137 encePairwiseOnDemand]: 183/187 looper letters, 17 selfloop transitions, 3 changer transitions 0/21 dead transitions. [2022-12-13 19:08:27,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 21 transitions, 92 flow [2022-12-13 19:08:27,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:08:27,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 19:08:27,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2022-12-13 19:08:27,959 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4505347593582888 [2022-12-13 19:08:27,959 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 337 transitions. [2022-12-13 19:08:27,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 337 transitions. [2022-12-13 19:08:27,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:08:27,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 337 transitions. [2022-12-13 19:08:27,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 0 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 19:08:27,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 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 19:08:27,961 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 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 19:08:27,961 INFO L175 Difference]: Start difference. First operand has 22 places, 15 transitions, 39 flow. Second operand 4 states and 337 transitions. [2022-12-13 19:08:27,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 21 transitions, 92 flow [2022-12-13 19:08:27,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 21 transitions, 91 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 19:08:27,962 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 52 flow [2022-12-13 19:08:27,962 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=52, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2022-12-13 19:08:27,962 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, -4 predicate places. [2022-12-13 19:08:27,962 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 52 flow [2022-12-13 19:08:27,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 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 19:08:27,963 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:08:27,963 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:08:27,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 19:08:27,963 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-12-13 19:08:27,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:08:27,963 INFO L85 PathProgramCache]: Analyzing trace with hash -982957310, now seen corresponding path program 1 times [2022-12-13 19:08:27,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:08:27,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719451098] [2022-12-13 19:08:27,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:08:27,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:08:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:08:28,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:28,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:08:28,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719451098] [2022-12-13 19:08:28,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719451098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:08:28,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:08:28,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 19:08:28,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466986214] [2022-12-13 19:08:28,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:08:28,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:08:28,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:08:28,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:08:28,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:08:28,047 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 187 [2022-12-13 19:08:28,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 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 19:08:28,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:08:28,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 187 [2022-12-13 19:08:28,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:08:28,089 INFO L130 PetriNetUnfolder]: 51/93 cut-off events. [2022-12-13 19:08:28,090 INFO L131 PetriNetUnfolder]: For 21/30 co-relation queries the response was YES. [2022-12-13 19:08:28,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 93 events. 51/93 cut-off events. For 21/30 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 219 event pairs, 24 based on Foata normal form. 9/84 useless extension candidates. Maximal degree in co-relation 235. Up to 73 conditions per place. [2022-12-13 19:08:28,091 INFO L137 encePairwiseOnDemand]: 183/187 looper letters, 19 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2022-12-13 19:08:28,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 23 transitions, 118 flow [2022-12-13 19:08:28,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:08:28,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 19:08:28,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 341 transitions. [2022-12-13 19:08:28,092 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45588235294117646 [2022-12-13 19:08:28,092 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 341 transitions. [2022-12-13 19:08:28,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 341 transitions. [2022-12-13 19:08:28,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:08:28,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 341 transitions. [2022-12-13 19:08:28,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 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 19:08:28,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 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 19:08:28,094 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 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 19:08:28,094 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 52 flow. Second operand 4 states and 341 transitions. [2022-12-13 19:08:28,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 23 transitions, 118 flow [2022-12-13 19:08:28,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 23 transitions, 109 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 19:08:28,095 INFO L231 Difference]: Finished difference. Result has 27 places, 17 transitions, 60 flow [2022-12-13 19:08:28,095 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=60, PETRI_PLACES=27, PETRI_TRANSITIONS=17} [2022-12-13 19:08:28,095 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, -2 predicate places. [2022-12-13 19:08:28,095 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 17 transitions, 60 flow [2022-12-13 19:08:28,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 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 19:08:28,096 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:08:28,096 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:08:28,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 19:08:28,096 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-12-13 19:08:28,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:08:28,096 INFO L85 PathProgramCache]: Analyzing trace with hash -2040159208, now seen corresponding path program 1 times [2022-12-13 19:08:28,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:08:28,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116555305] [2022-12-13 19:08:28,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:08:28,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:08:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:08:28,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:28,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:08:28,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116555305] [2022-12-13 19:08:28,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116555305] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:08:28,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372206748] [2022-12-13 19:08:28,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:08:28,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:08:28,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:08:28,334 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:08:28,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 19:08:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:08:28,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 19:08:28,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:08:28,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:28,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:08:28,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:28,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372206748] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:08:28,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:08:28,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 12 [2022-12-13 19:08:28,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574743553] [2022-12-13 19:08:28,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:08:28,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 19:08:28,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:08:28,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 19:08:28,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-12-13 19:08:28,858 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 187 [2022-12-13 19:08:28,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 17 transitions, 60 flow. Second operand has 14 states, 14 states have (on average 75.64285714285714) internal successors, (1059), 14 states have internal predecessors, (1059), 0 states have call successors, (0), 0 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 19:08:28,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:08:28,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 187 [2022-12-13 19:08:28,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:08:29,235 INFO L130 PetriNetUnfolder]: 165/298 cut-off events. [2022-12-13 19:08:29,235 INFO L131 PetriNetUnfolder]: For 106/106 co-relation queries the response was YES. [2022-12-13 19:08:29,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 836 conditions, 298 events. 165/298 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1054 event pairs, 12 based on Foata normal form. 2/230 useless extension candidates. Maximal degree in co-relation 830. Up to 97 conditions per place. [2022-12-13 19:08:29,237 INFO L137 encePairwiseOnDemand]: 179/187 looper letters, 53 selfloop transitions, 23 changer transitions 14/90 dead transitions. [2022-12-13 19:08:29,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 90 transitions, 478 flow [2022-12-13 19:08:29,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 19:08:29,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 19:08:29,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1039 transitions. [2022-12-13 19:08:29,239 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42739613327848625 [2022-12-13 19:08:29,239 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1039 transitions. [2022-12-13 19:08:29,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1039 transitions. [2022-12-13 19:08:29,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:08:29,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1039 transitions. [2022-12-13 19:08:29,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 79.92307692307692) internal successors, (1039), 13 states have internal predecessors, (1039), 0 states have call successors, (0), 0 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 19:08:29,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 187.0) internal successors, (2618), 14 states have internal predecessors, (2618), 0 states have call successors, (0), 0 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 19:08:29,244 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 187.0) internal successors, (2618), 14 states have internal predecessors, (2618), 0 states have call successors, (0), 0 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 19:08:29,244 INFO L175 Difference]: Start difference. First operand has 27 places, 17 transitions, 60 flow. Second operand 13 states and 1039 transitions. [2022-12-13 19:08:29,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 90 transitions, 478 flow [2022-12-13 19:08:29,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 90 transitions, 454 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-13 19:08:29,246 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 214 flow [2022-12-13 19:08:29,246 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=214, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2022-12-13 19:08:29,246 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 15 predicate places. [2022-12-13 19:08:29,246 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 214 flow [2022-12-13 19:08:29,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 75.64285714285714) internal successors, (1059), 14 states have internal predecessors, (1059), 0 states have call successors, (0), 0 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 19:08:29,247 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:08:29,247 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:08:29,253 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 19:08:29,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-13 19:08:29,448 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-12-13 19:08:29,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:08:29,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1789604620, now seen corresponding path program 2 times [2022-12-13 19:08:29,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:08:29,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981994911] [2022-12-13 19:08:29,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:08:29,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:08:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:08:29,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:08:29,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:08:29,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981994911] [2022-12-13 19:08:29,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981994911] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:08:29,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822505869] [2022-12-13 19:08:29,561 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:08:29,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:08:29,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:08:29,562 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:08:29,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 19:08:29,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:08:29,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:08:29,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 19:08:29,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:08:29,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:08:29,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:08:29,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:08:29,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822505869] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:08:29,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:08:29,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 19:08:29,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667757564] [2022-12-13 19:08:29,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:08:29,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 19:08:29,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:08:29,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 19:08:29,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-13 19:08:29,806 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 187 [2022-12-13 19:08:29,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 214 flow. Second operand has 8 states, 8 states have (on average 80.75) internal successors, (646), 8 states have internal predecessors, (646), 0 states have call successors, (0), 0 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 19:08:29,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:08:29,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 187 [2022-12-13 19:08:29,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:08:29,910 INFO L130 PetriNetUnfolder]: 160/292 cut-off events. [2022-12-13 19:08:29,910 INFO L131 PetriNetUnfolder]: For 450/451 co-relation queries the response was YES. [2022-12-13 19:08:29,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 292 events. 160/292 cut-off events. For 450/451 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1014 event pairs, 52 based on Foata normal form. 14/305 useless extension candidates. Maximal degree in co-relation 1011. Up to 233 conditions per place. [2022-12-13 19:08:29,914 INFO L137 encePairwiseOnDemand]: 182/187 looper letters, 39 selfloop transitions, 12 changer transitions 0/53 dead transitions. [2022-12-13 19:08:29,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 53 transitions, 385 flow [2022-12-13 19:08:29,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 19:08:29,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 19:08:29,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 501 transitions. [2022-12-13 19:08:29,916 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.446524064171123 [2022-12-13 19:08:29,916 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 501 transitions. [2022-12-13 19:08:29,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 501 transitions. [2022-12-13 19:08:29,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:08:29,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 501 transitions. [2022-12-13 19:08:29,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 0 states have call successors, (0), 0 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 19:08:29,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 187.0) internal successors, (1309), 7 states have internal predecessors, (1309), 0 states have call successors, (0), 0 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 19:08:29,918 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 187.0) internal successors, (1309), 7 states have internal predecessors, (1309), 0 states have call successors, (0), 0 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 19:08:29,918 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 214 flow. Second operand 6 states and 501 transitions. [2022-12-13 19:08:29,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 53 transitions, 385 flow [2022-12-13 19:08:29,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 53 transitions, 379 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 19:08:29,921 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 284 flow [2022-12-13 19:08:29,921 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=284, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 19:08:29,921 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 22 predicate places. [2022-12-13 19:08:29,921 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 284 flow [2022-12-13 19:08:29,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 80.75) internal successors, (646), 8 states have internal predecessors, (646), 0 states have call successors, (0), 0 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 19:08:29,922 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:08:29,922 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:08:29,926 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 19:08:30,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:08:30,122 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-12-13 19:08:30,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:08:30,123 INFO L85 PathProgramCache]: Analyzing trace with hash 737437239, now seen corresponding path program 3 times [2022-12-13 19:08:30,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:08:30,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540496621] [2022-12-13 19:08:30,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:08:30,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:08:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:08:30,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:30,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:08:30,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540496621] [2022-12-13 19:08:30,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540496621] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:08:30,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732939674] [2022-12-13 19:08:30,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 19:08:30,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:08:30,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:08:30,289 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:08:30,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 19:08:30,347 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 19:08:30,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:08:30,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 19:08:30,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:08:30,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:30,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:08:30,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:30,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732939674] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:08:30,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:08:30,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-12-13 19:08:30,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75731591] [2022-12-13 19:08:30,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:08:30,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 19:08:30,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:08:30,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 19:08:30,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-12-13 19:08:30,632 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 187 [2022-12-13 19:08:30,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 284 flow. Second operand has 14 states, 14 states have (on average 77.21428571428571) internal successors, (1081), 14 states have internal predecessors, (1081), 0 states have call successors, (0), 0 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 19:08:30,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:08:30,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 187 [2022-12-13 19:08:30,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:08:30,991 INFO L130 PetriNetUnfolder]: 299/538 cut-off events. [2022-12-13 19:08:30,991 INFO L131 PetriNetUnfolder]: For 1334/1334 co-relation queries the response was YES. [2022-12-13 19:08:30,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2148 conditions, 538 events. 299/538 cut-off events. For 1334/1334 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2200 event pairs, 55 based on Foata normal form. 18/556 useless extension candidates. Maximal degree in co-relation 2131. Up to 189 conditions per place. [2022-12-13 19:08:30,994 INFO L137 encePairwiseOnDemand]: 181/187 looper letters, 76 selfloop transitions, 26 changer transitions 4/106 dead transitions. [2022-12-13 19:08:30,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 106 transitions, 815 flow [2022-12-13 19:08:30,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 19:08:30,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 19:08:30,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 982 transitions. [2022-12-13 19:08:30,997 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4376114081996435 [2022-12-13 19:08:30,997 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 982 transitions. [2022-12-13 19:08:30,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 982 transitions. [2022-12-13 19:08:30,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:08:30,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 982 transitions. [2022-12-13 19:08:30,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 81.83333333333333) internal successors, (982), 12 states have internal predecessors, (982), 0 states have call successors, (0), 0 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 19:08:31,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 187.0) internal successors, (2431), 13 states have internal predecessors, (2431), 0 states have call successors, (0), 0 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 19:08:31,001 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 187.0) internal successors, (2431), 13 states have internal predecessors, (2431), 0 states have call successors, (0), 0 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 19:08:31,001 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 284 flow. Second operand 12 states and 982 transitions. [2022-12-13 19:08:31,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 106 transitions, 815 flow [2022-12-13 19:08:31,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 106 transitions, 792 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-13 19:08:31,006 INFO L231 Difference]: Finished difference. Result has 65 places, 57 transitions, 474 flow [2022-12-13 19:08:31,006 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=474, PETRI_PLACES=65, PETRI_TRANSITIONS=57} [2022-12-13 19:08:31,007 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 36 predicate places. [2022-12-13 19:08:31,007 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 474 flow [2022-12-13 19:08:31,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 77.21428571428571) internal successors, (1081), 14 states have internal predecessors, (1081), 0 states have call successors, (0), 0 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 19:08:31,007 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:08:31,007 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:08:31,013 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 19:08:31,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:08:31,208 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-12-13 19:08:31,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:08:31,208 INFO L85 PathProgramCache]: Analyzing trace with hash -880298999, now seen corresponding path program 4 times [2022-12-13 19:08:31,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:08:31,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546040339] [2022-12-13 19:08:31,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:08:31,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:08:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:08:31,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:31,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:08:31,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546040339] [2022-12-13 19:08:31,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546040339] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:08:31,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33282821] [2022-12-13 19:08:31,357 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 19:08:31,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:08:31,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:08:31,358 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:08:31,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 19:08:31,413 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 19:08:31,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:08:31,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 19:08:31,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:08:31,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:31,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:08:31,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:31,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33282821] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:08:31,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:08:31,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 14 [2022-12-13 19:08:31,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746643236] [2022-12-13 19:08:31,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:08:31,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 19:08:31,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:08:31,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 19:08:31,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-12-13 19:08:31,751 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 187 [2022-12-13 19:08:31,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 474 flow. Second operand has 14 states, 14 states have (on average 79.14285714285714) internal successors, (1108), 14 states have internal predecessors, (1108), 0 states have call successors, (0), 0 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 19:08:31,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:08:31,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 187 [2022-12-13 19:08:31,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:08:32,228 INFO L130 PetriNetUnfolder]: 410/735 cut-off events. [2022-12-13 19:08:32,228 INFO L131 PetriNetUnfolder]: For 4241/4241 co-relation queries the response was YES. [2022-12-13 19:08:32,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3503 conditions, 735 events. 410/735 cut-off events. For 4241/4241 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3375 event pairs, 15 based on Foata normal form. 14/749 useless extension candidates. Maximal degree in co-relation 3482. Up to 269 conditions per place. [2022-12-13 19:08:32,234 INFO L137 encePairwiseOnDemand]: 181/187 looper letters, 79 selfloop transitions, 56 changer transitions 30/165 dead transitions. [2022-12-13 19:08:32,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 165 transitions, 1576 flow [2022-12-13 19:08:32,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 19:08:32,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 19:08:32,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1654 transitions. [2022-12-13 19:08:32,238 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44224598930481285 [2022-12-13 19:08:32,238 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1654 transitions. [2022-12-13 19:08:32,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1654 transitions. [2022-12-13 19:08:32,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:08:32,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1654 transitions. [2022-12-13 19:08:32,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 82.7) internal successors, (1654), 20 states have internal predecessors, (1654), 0 states have call successors, (0), 0 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 19:08:32,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 187.0) internal successors, (3927), 21 states have internal predecessors, (3927), 0 states have call successors, (0), 0 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 19:08:32,249 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 187.0) internal successors, (3927), 21 states have internal predecessors, (3927), 0 states have call successors, (0), 0 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 19:08:32,249 INFO L175 Difference]: Start difference. First operand has 65 places, 57 transitions, 474 flow. Second operand 20 states and 1654 transitions. [2022-12-13 19:08:32,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 165 transitions, 1576 flow [2022-12-13 19:08:32,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 165 transitions, 1464 flow, removed 47 selfloop flow, removed 4 redundant places. [2022-12-13 19:08:32,265 INFO L231 Difference]: Finished difference. Result has 88 places, 91 transitions, 904 flow [2022-12-13 19:08:32,265 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=904, PETRI_PLACES=88, PETRI_TRANSITIONS=91} [2022-12-13 19:08:32,266 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 59 predicate places. [2022-12-13 19:08:32,266 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 91 transitions, 904 flow [2022-12-13 19:08:32,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 79.14285714285714) internal successors, (1108), 14 states have internal predecessors, (1108), 0 states have call successors, (0), 0 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 19:08:32,267 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:08:32,267 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:08:32,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 19:08:32,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:08:32,468 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-12-13 19:08:32,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:08:32,470 INFO L85 PathProgramCache]: Analyzing trace with hash 492247625, now seen corresponding path program 5 times [2022-12-13 19:08:32,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:08:32,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390201276] [2022-12-13 19:08:32,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:08:32,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:08:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:08:32,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:32,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:08:32,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390201276] [2022-12-13 19:08:32,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390201276] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:08:32,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897376272] [2022-12-13 19:08:32,682 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 19:08:32,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:08:32,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:08:32,683 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:08:32,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 19:08:32,740 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:08:32,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:08:32,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 19:08:32,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:08:32,831 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:32,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:08:32,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:32,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897376272] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:08:32,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:08:32,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-12-13 19:08:32,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744868815] [2022-12-13 19:08:32,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:08:32,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 19:08:32,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:08:32,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 19:08:32,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-12-13 19:08:33,059 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 187 [2022-12-13 19:08:33,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 91 transitions, 904 flow. Second operand has 16 states, 16 states have (on average 77.25) internal successors, (1236), 16 states have internal predecessors, (1236), 0 states have call successors, (0), 0 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 19:08:33,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:08:33,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 187 [2022-12-13 19:08:33,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:08:33,669 INFO L130 PetriNetUnfolder]: 406/739 cut-off events. [2022-12-13 19:08:33,670 INFO L131 PetriNetUnfolder]: For 9527/9527 co-relation queries the response was YES. [2022-12-13 19:08:33,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4352 conditions, 739 events. 406/739 cut-off events. For 9527/9527 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3429 event pairs, 30 based on Foata normal form. 42/781 useless extension candidates. Maximal degree in co-relation 4324. Up to 292 conditions per place. [2022-12-13 19:08:33,674 INFO L137 encePairwiseOnDemand]: 180/187 looper letters, 125 selfloop transitions, 66 changer transitions 2/193 dead transitions. [2022-12-13 19:08:33,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 193 transitions, 2114 flow [2022-12-13 19:08:33,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 19:08:33,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 19:08:33,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1542 transitions. [2022-12-13 19:08:33,677 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43399943709541233 [2022-12-13 19:08:33,677 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1542 transitions. [2022-12-13 19:08:33,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1542 transitions. [2022-12-13 19:08:33,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:08:33,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1542 transitions. [2022-12-13 19:08:33,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 81.15789473684211) internal successors, (1542), 19 states have internal predecessors, (1542), 0 states have call successors, (0), 0 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 19:08:33,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 187.0) internal successors, (3740), 20 states have internal predecessors, (3740), 0 states have call successors, (0), 0 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 19:08:33,683 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 187.0) internal successors, (3740), 20 states have internal predecessors, (3740), 0 states have call successors, (0), 0 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 19:08:33,683 INFO L175 Difference]: Start difference. First operand has 88 places, 91 transitions, 904 flow. Second operand 19 states and 1542 transitions. [2022-12-13 19:08:33,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 193 transitions, 2114 flow [2022-12-13 19:08:33,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 193 transitions, 1865 flow, removed 116 selfloop flow, removed 3 redundant places. [2022-12-13 19:08:33,699 INFO L231 Difference]: Finished difference. Result has 108 places, 121 transitions, 1373 flow [2022-12-13 19:08:33,700 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1373, PETRI_PLACES=108, PETRI_TRANSITIONS=121} [2022-12-13 19:08:33,700 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 79 predicate places. [2022-12-13 19:08:33,700 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 121 transitions, 1373 flow [2022-12-13 19:08:33,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 77.25) internal successors, (1236), 16 states have internal predecessors, (1236), 0 states have call successors, (0), 0 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 19:08:33,701 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:08:33,701 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:08:33,705 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 19:08:33,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:08:33,902 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-12-13 19:08:33,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:08:33,903 INFO L85 PathProgramCache]: Analyzing trace with hash 751057335, now seen corresponding path program 6 times [2022-12-13 19:08:33,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:08:33,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580509401] [2022-12-13 19:08:33,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:08:33,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:08:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:08:34,212 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:34,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:08:34,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580509401] [2022-12-13 19:08:34,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580509401] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:08:34,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597726352] [2022-12-13 19:08:34,213 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 19:08:34,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:08:34,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:08:34,213 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:08:34,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 19:08:34,264 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-13 19:08:34,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:08:34,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 19:08:34,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:08:34,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:34,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:08:34,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:34,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597726352] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:08:34,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:08:34,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 15 [2022-12-13 19:08:34,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170806488] [2022-12-13 19:08:34,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:08:34,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 19:08:34,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:08:34,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 19:08:34,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-12-13 19:08:34,585 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 187 [2022-12-13 19:08:34,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 121 transitions, 1373 flow. Second operand has 15 states, 15 states have (on average 79.33333333333333) internal successors, (1190), 15 states have internal predecessors, (1190), 0 states have call successors, (0), 0 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 19:08:34,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:08:34,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 187 [2022-12-13 19:08:34,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:08:35,348 INFO L130 PetriNetUnfolder]: 494/933 cut-off events. [2022-12-13 19:08:35,348 INFO L131 PetriNetUnfolder]: For 20036/20036 co-relation queries the response was YES. [2022-12-13 19:08:35,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6603 conditions, 933 events. 494/933 cut-off events. For 20036/20036 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4757 event pairs, 13 based on Foata normal form. 24/957 useless extension candidates. Maximal degree in co-relation 6567. Up to 313 conditions per place. [2022-12-13 19:08:35,354 INFO L137 encePairwiseOnDemand]: 180/187 looper letters, 95 selfloop transitions, 104 changer transitions 0/199 dead transitions. [2022-12-13 19:08:35,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 199 transitions, 2439 flow [2022-12-13 19:08:35,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 19:08:35,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-13 19:08:35,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1734 transitions. [2022-12-13 19:08:35,357 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2022-12-13 19:08:35,357 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1734 transitions. [2022-12-13 19:08:35,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1734 transitions. [2022-12-13 19:08:35,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:08:35,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1734 transitions. [2022-12-13 19:08:35,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 82.57142857142857) internal successors, (1734), 21 states have internal predecessors, (1734), 0 states have call successors, (0), 0 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 19:08:35,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 187.0) internal successors, (4114), 22 states have internal predecessors, (4114), 0 states have call successors, (0), 0 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 19:08:35,363 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 187.0) internal successors, (4114), 22 states have internal predecessors, (4114), 0 states have call successors, (0), 0 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 19:08:35,363 INFO L175 Difference]: Start difference. First operand has 108 places, 121 transitions, 1373 flow. Second operand 21 states and 1734 transitions. [2022-12-13 19:08:35,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 199 transitions, 2439 flow [2022-12-13 19:08:35,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 199 transitions, 2121 flow, removed 147 selfloop flow, removed 5 redundant places. [2022-12-13 19:08:35,398 INFO L231 Difference]: Finished difference. Result has 127 places, 142 transitions, 1745 flow [2022-12-13 19:08:35,398 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1745, PETRI_PLACES=127, PETRI_TRANSITIONS=142} [2022-12-13 19:08:35,398 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 98 predicate places. [2022-12-13 19:08:35,398 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 142 transitions, 1745 flow [2022-12-13 19:08:35,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 79.33333333333333) internal successors, (1190), 15 states have internal predecessors, (1190), 0 states have call successors, (0), 0 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 19:08:35,399 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:08:35,399 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:08:35,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 19:08:35,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 19:08:35,601 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-12-13 19:08:35,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:08:35,602 INFO L85 PathProgramCache]: Analyzing trace with hash 49023667, now seen corresponding path program 7 times [2022-12-13 19:08:35,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:08:35,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349339895] [2022-12-13 19:08:35,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:08:35,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:08:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:08:35,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:35,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:08:35,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349339895] [2022-12-13 19:08:35,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349339895] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:08:35,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497687945] [2022-12-13 19:08:35,773 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 19:08:35,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:08:35,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:08:35,774 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:08:35,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 19:08:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:08:35,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 19:08:35,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:08:35,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:35,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:08:36,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:36,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497687945] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:08:36,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:08:36,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2022-12-13 19:08:36,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348546086] [2022-12-13 19:08:36,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:08:36,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 19:08:36,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:08:36,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 19:08:36,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-12-13 19:08:36,142 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 187 [2022-12-13 19:08:36,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 142 transitions, 1745 flow. Second operand has 16 states, 16 states have (on average 77.3125) internal successors, (1237), 16 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 19:08:36,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:08:36,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 187 [2022-12-13 19:08:36,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:08:37,032 INFO L130 PetriNetUnfolder]: 685/1297 cut-off events. [2022-12-13 19:08:37,032 INFO L131 PetriNetUnfolder]: For 34237/34237 co-relation queries the response was YES. [2022-12-13 19:08:37,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9969 conditions, 1297 events. 685/1297 cut-off events. For 34237/34237 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7293 event pairs, 77 based on Foata normal form. 39/1336 useless extension candidates. Maximal degree in co-relation 9930. Up to 764 conditions per place. [2022-12-13 19:08:37,041 INFO L137 encePairwiseOnDemand]: 179/187 looper letters, 188 selfloop transitions, 115 changer transitions 5/308 dead transitions. [2022-12-13 19:08:37,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 308 transitions, 4180 flow [2022-12-13 19:08:37,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 19:08:37,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-13 19:08:37,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2194 transitions. [2022-12-13 19:08:37,044 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4345414933650228 [2022-12-13 19:08:37,044 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 2194 transitions. [2022-12-13 19:08:37,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 2194 transitions. [2022-12-13 19:08:37,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:08:37,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 2194 transitions. [2022-12-13 19:08:37,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 81.25925925925925) internal successors, (2194), 27 states have internal predecessors, (2194), 0 states have call successors, (0), 0 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 19:08:37,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 187.0) internal successors, (5236), 28 states have internal predecessors, (5236), 0 states have call successors, (0), 0 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 19:08:37,053 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 187.0) internal successors, (5236), 28 states have internal predecessors, (5236), 0 states have call successors, (0), 0 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 19:08:37,053 INFO L175 Difference]: Start difference. First operand has 127 places, 142 transitions, 1745 flow. Second operand 27 states and 2194 transitions. [2022-12-13 19:08:37,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 308 transitions, 4180 flow [2022-12-13 19:08:37,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 308 transitions, 3705 flow, removed 193 selfloop flow, removed 11 redundant places. [2022-12-13 19:08:37,125 INFO L231 Difference]: Finished difference. Result has 156 places, 202 transitions, 2878 flow [2022-12-13 19:08:37,125 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=1510, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=2878, PETRI_PLACES=156, PETRI_TRANSITIONS=202} [2022-12-13 19:08:37,126 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 127 predicate places. [2022-12-13 19:08:37,126 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 202 transitions, 2878 flow [2022-12-13 19:08:37,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 77.3125) internal successors, (1237), 16 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 19:08:37,126 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:08:37,126 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:08:37,130 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 19:08:37,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 19:08:37,328 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-12-13 19:08:37,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:08:37,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1045261423, now seen corresponding path program 8 times [2022-12-13 19:08:37,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:08:37,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434913825] [2022-12-13 19:08:37,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:08:37,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:08:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:08:37,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:37,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:08:37,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434913825] [2022-12-13 19:08:37,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434913825] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:08:37,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855073190] [2022-12-13 19:08:37,555 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:08:37,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:08:37,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:08:37,556 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:08:37,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 19:08:37,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:08:37,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:08:37,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 19:08:37,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:08:37,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:37,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:08:39,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:39,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855073190] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:08:39,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:08:39,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 14 [2022-12-13 19:08:39,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476272554] [2022-12-13 19:08:39,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:08:39,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 19:08:39,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:08:39,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 19:08:39,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-12-13 19:08:40,062 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 187 [2022-12-13 19:08:40,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 202 transitions, 2878 flow. Second operand has 14 states, 14 states have (on average 79.0) internal successors, (1106), 14 states have internal predecessors, (1106), 0 states have call successors, (0), 0 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 19:08:40,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:08:40,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 187 [2022-12-13 19:08:40,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:08:40,697 INFO L130 PetriNetUnfolder]: 851/1669 cut-off events. [2022-12-13 19:08:40,697 INFO L131 PetriNetUnfolder]: For 64203/64203 co-relation queries the response was YES. [2022-12-13 19:08:40,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14016 conditions, 1669 events. 851/1669 cut-off events. For 64203/64203 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 10325 event pairs, 87 based on Foata normal form. 14/1683 useless extension candidates. Maximal degree in co-relation 13963. Up to 481 conditions per place. [2022-12-13 19:08:40,709 INFO L137 encePairwiseOnDemand]: 181/187 looper letters, 167 selfloop transitions, 134 changer transitions 4/305 dead transitions. [2022-12-13 19:08:40,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 305 transitions, 5325 flow [2022-12-13 19:08:40,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 19:08:40,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 19:08:40,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1397 transitions. [2022-12-13 19:08:40,711 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43944636678200694 [2022-12-13 19:08:40,711 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1397 transitions. [2022-12-13 19:08:40,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1397 transitions. [2022-12-13 19:08:40,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:08:40,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1397 transitions. [2022-12-13 19:08:40,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 82.17647058823529) internal successors, (1397), 17 states have internal predecessors, (1397), 0 states have call successors, (0), 0 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 19:08:40,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 187.0) internal successors, (3366), 18 states have internal predecessors, (3366), 0 states have call successors, (0), 0 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 19:08:40,715 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 187.0) internal successors, (3366), 18 states have internal predecessors, (3366), 0 states have call successors, (0), 0 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 19:08:40,715 INFO L175 Difference]: Start difference. First operand has 156 places, 202 transitions, 2878 flow. Second operand 17 states and 1397 transitions. [2022-12-13 19:08:40,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 305 transitions, 5325 flow [2022-12-13 19:08:40,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 305 transitions, 4329 flow, removed 475 selfloop flow, removed 8 redundant places. [2022-12-13 19:08:40,835 INFO L231 Difference]: Finished difference. Result has 173 places, 245 transitions, 3561 flow [2022-12-13 19:08:40,835 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=2402, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3561, PETRI_PLACES=173, PETRI_TRANSITIONS=245} [2022-12-13 19:08:40,835 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 144 predicate places. [2022-12-13 19:08:40,836 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 245 transitions, 3561 flow [2022-12-13 19:08:40,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 79.0) internal successors, (1106), 14 states have internal predecessors, (1106), 0 states have call successors, (0), 0 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 19:08:40,836 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:08:40,836 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:08:40,840 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 19:08:41,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 19:08:41,039 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-12-13 19:08:41,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:08:41,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1532551459, now seen corresponding path program 9 times [2022-12-13 19:08:41,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:08:41,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924884831] [2022-12-13 19:08:41,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:08:41,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:08:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:08:41,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:41,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:08:41,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924884831] [2022-12-13 19:08:41,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924884831] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:08:41,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108241010] [2022-12-13 19:08:41,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 19:08:41,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:08:41,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:08:41,212 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:08:41,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 19:08:41,270 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 19:08:41,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:08:41,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 19:08:41,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:08:41,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:41,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:08:41,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:41,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108241010] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:08:41,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:08:41,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2022-12-13 19:08:41,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395453435] [2022-12-13 19:08:41,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:08:41,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 19:08:41,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:08:41,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 19:08:41,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-12-13 19:08:41,746 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 187 [2022-12-13 19:08:41,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 245 transitions, 3561 flow. Second operand has 13 states, 13 states have (on average 79.07692307692308) internal successors, (1028), 13 states have internal predecessors, (1028), 0 states have call successors, (0), 0 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 19:08:41,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:08:41,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 187 [2022-12-13 19:08:41,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:08:42,598 INFO L130 PetriNetUnfolder]: 963/1871 cut-off events. [2022-12-13 19:08:42,598 INFO L131 PetriNetUnfolder]: For 70500/70500 co-relation queries the response was YES. [2022-12-13 19:08:42,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15208 conditions, 1871 events. 963/1871 cut-off events. For 70500/70500 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 11815 event pairs, 143 based on Foata normal form. 24/1895 useless extension candidates. Maximal degree in co-relation 15149. Up to 757 conditions per place. [2022-12-13 19:08:42,615 INFO L137 encePairwiseOnDemand]: 180/187 looper letters, 155 selfloop transitions, 178 changer transitions 1/334 dead transitions. [2022-12-13 19:08:42,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 334 transitions, 5345 flow [2022-12-13 19:08:42,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 19:08:42,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 19:08:42,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1245 transitions. [2022-12-13 19:08:42,618 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44385026737967914 [2022-12-13 19:08:42,618 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1245 transitions. [2022-12-13 19:08:42,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1245 transitions. [2022-12-13 19:08:42,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:08:42,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1245 transitions. [2022-12-13 19:08:42,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 83.0) internal successors, (1245), 15 states have internal predecessors, (1245), 0 states have call successors, (0), 0 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 19:08:42,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 187.0) internal successors, (2992), 16 states have internal predecessors, (2992), 0 states have call successors, (0), 0 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 19:08:42,623 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 187.0) internal successors, (2992), 16 states have internal predecessors, (2992), 0 states have call successors, (0), 0 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 19:08:42,623 INFO L175 Difference]: Start difference. First operand has 173 places, 245 transitions, 3561 flow. Second operand 15 states and 1245 transitions. [2022-12-13 19:08:42,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 334 transitions, 5345 flow [2022-12-13 19:08:42,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 334 transitions, 4971 flow, removed 161 selfloop flow, removed 4 redundant places. [2022-12-13 19:08:42,784 INFO L231 Difference]: Finished difference. Result has 189 places, 289 transitions, 4634 flow [2022-12-13 19:08:42,784 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=3329, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4634, PETRI_PLACES=189, PETRI_TRANSITIONS=289} [2022-12-13 19:08:42,784 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 160 predicate places. [2022-12-13 19:08:42,784 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 289 transitions, 4634 flow [2022-12-13 19:08:42,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 79.07692307692308) internal successors, (1028), 13 states have internal predecessors, (1028), 0 states have call successors, (0), 0 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 19:08:42,785 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:08:42,785 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:08:42,789 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 19:08:42,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 19:08:42,986 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-12-13 19:08:42,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:08:42,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1817564061, now seen corresponding path program 10 times [2022-12-13 19:08:42,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:08:42,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74270847] [2022-12-13 19:08:42,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:08:42,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:08:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:08:43,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:43,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:08:43,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74270847] [2022-12-13 19:08:43,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74270847] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:08:43,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475529393] [2022-12-13 19:08:43,136 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 19:08:43,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:08:43,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:08:43,137 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:08:43,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 19:08:43,185 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 19:08:43,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:08:43,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 19:08:43,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:08:43,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:43,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:08:43,469 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:43,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475529393] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:08:43,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:08:43,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-12-13 19:08:43,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055721686] [2022-12-13 19:08:43,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:08:43,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 19:08:43,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:08:43,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 19:08:43,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-12-13 19:08:43,582 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 187 [2022-12-13 19:08:43,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 289 transitions, 4634 flow. Second operand has 15 states, 15 states have (on average 79.13333333333334) internal successors, (1187), 15 states have internal predecessors, (1187), 0 states have call successors, (0), 0 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 19:08:43,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:08:43,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 187 [2022-12-13 19:08:43,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:08:45,216 INFO L130 PetriNetUnfolder]: 1054/2077 cut-off events. [2022-12-13 19:08:45,216 INFO L131 PetriNetUnfolder]: For 86113/86113 co-relation queries the response was YES. [2022-12-13 19:08:45,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18082 conditions, 2077 events. 1054/2077 cut-off events. For 86113/86113 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13560 event pairs, 153 based on Foata normal form. 28/2105 useless extension candidates. Maximal degree in co-relation 18017. Up to 1015 conditions per place. [2022-12-13 19:08:45,230 INFO L137 encePairwiseOnDemand]: 180/187 looper letters, 211 selfloop transitions, 190 changer transitions 8/409 dead transitions. [2022-12-13 19:08:45,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 409 transitions, 6815 flow [2022-12-13 19:08:45,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 19:08:45,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-13 19:08:45,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1832 transitions. [2022-12-13 19:08:45,232 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44530870199319394 [2022-12-13 19:08:45,233 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1832 transitions. [2022-12-13 19:08:45,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1832 transitions. [2022-12-13 19:08:45,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:08:45,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1832 transitions. [2022-12-13 19:08:45,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 83.27272727272727) internal successors, (1832), 22 states have internal predecessors, (1832), 0 states have call successors, (0), 0 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 19:08:45,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 187.0) internal successors, (4301), 23 states have internal predecessors, (4301), 0 states have call successors, (0), 0 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 19:08:45,237 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 187.0) internal successors, (4301), 23 states have internal predecessors, (4301), 0 states have call successors, (0), 0 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 19:08:45,237 INFO L175 Difference]: Start difference. First operand has 189 places, 289 transitions, 4634 flow. Second operand 22 states and 1832 transitions. [2022-12-13 19:08:45,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 409 transitions, 6815 flow [2022-12-13 19:08:45,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 409 transitions, 6664 flow, removed 54 selfloop flow, removed 4 redundant places. [2022-12-13 19:08:45,468 INFO L231 Difference]: Finished difference. Result has 215 places, 314 transitions, 5508 flow [2022-12-13 19:08:45,468 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=4434, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=5508, PETRI_PLACES=215, PETRI_TRANSITIONS=314} [2022-12-13 19:08:45,469 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 186 predicate places. [2022-12-13 19:08:45,469 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 314 transitions, 5508 flow [2022-12-13 19:08:45,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 79.13333333333334) internal successors, (1187), 15 states have internal predecessors, (1187), 0 states have call successors, (0), 0 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 19:08:45,469 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:08:45,469 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:08:45,473 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 19:08:45,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 19:08:45,671 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-12-13 19:08:45,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:08:45,672 INFO L85 PathProgramCache]: Analyzing trace with hash -737011571, now seen corresponding path program 11 times [2022-12-13 19:08:45,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:08:45,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591755433] [2022-12-13 19:08:45,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:08:45,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:08:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:08:45,891 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 19:08:45,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:08:45,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591755433] [2022-12-13 19:08:45,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591755433] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:08:45,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531467685] [2022-12-13 19:08:45,891 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 19:08:45,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:08:45,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:08:45,892 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:08:45,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 19:08:45,959 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 19:08:45,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:08:45,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 19:08:45,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:08:46,110 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 19:08:46,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:08:46,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:08:46,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531467685] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:08:46,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:08:46,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 13 [2022-12-13 19:08:46,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866111200] [2022-12-13 19:08:46,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:08:46,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 19:08:46,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:08:46,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 19:08:46,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2022-12-13 19:08:46,517 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 187 [2022-12-13 19:08:46,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 314 transitions, 5508 flow. Second operand has 15 states, 15 states have (on average 78.33333333333333) internal successors, (1175), 15 states have internal predecessors, (1175), 0 states have call successors, (0), 0 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 19:08:46,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:08:46,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 187 [2022-12-13 19:08:46,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:08:47,479 INFO L130 PetriNetUnfolder]: 1431/2830 cut-off events. [2022-12-13 19:08:47,479 INFO L131 PetriNetUnfolder]: For 138084/138085 co-relation queries the response was YES. [2022-12-13 19:08:47,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27331 conditions, 2830 events. 1431/2830 cut-off events. For 138084/138085 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 19848 event pairs, 151 based on Foata normal form. 26/2853 useless extension candidates. Maximal degree in co-relation 27258. Up to 1159 conditions per place. [2022-12-13 19:08:47,499 INFO L137 encePairwiseOnDemand]: 181/187 looper letters, 269 selfloop transitions, 133 changer transitions 91/497 dead transitions. [2022-12-13 19:08:47,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 497 transitions, 9651 flow [2022-12-13 19:08:47,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 19:08:47,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 19:08:47,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1164 transitions. [2022-12-13 19:08:47,501 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44461420932009166 [2022-12-13 19:08:47,501 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1164 transitions. [2022-12-13 19:08:47,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1164 transitions. [2022-12-13 19:08:47,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:08:47,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1164 transitions. [2022-12-13 19:08:47,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 83.14285714285714) internal successors, (1164), 14 states have internal predecessors, (1164), 0 states have call successors, (0), 0 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 19:08:47,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 187.0) internal successors, (2805), 15 states have internal predecessors, (2805), 0 states have call successors, (0), 0 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 19:08:47,504 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 187.0) internal successors, (2805), 15 states have internal predecessors, (2805), 0 states have call successors, (0), 0 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 19:08:47,504 INFO L175 Difference]: Start difference. First operand has 215 places, 314 transitions, 5508 flow. Second operand 14 states and 1164 transitions. [2022-12-13 19:08:47,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 497 transitions, 9651 flow [2022-12-13 19:08:47,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 497 transitions, 9290 flow, removed 137 selfloop flow, removed 10 redundant places. [2022-12-13 19:08:47,879 INFO L231 Difference]: Finished difference. Result has 224 places, 348 transitions, 6598 flow [2022-12-13 19:08:47,880 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=5238, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=6598, PETRI_PLACES=224, PETRI_TRANSITIONS=348} [2022-12-13 19:08:47,880 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 195 predicate places. [2022-12-13 19:08:47,880 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 348 transitions, 6598 flow [2022-12-13 19:08:47,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 78.33333333333333) internal successors, (1175), 15 states have internal predecessors, (1175), 0 states have call successors, (0), 0 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 19:08:47,880 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:08:47,880 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:08:47,884 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 19:08:48,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 19:08:48,082 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-12-13 19:08:48,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:08:48,082 INFO L85 PathProgramCache]: Analyzing trace with hash 468794047, now seen corresponding path program 12 times [2022-12-13 19:08:48,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:08:48,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651872911] [2022-12-13 19:08:48,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:08:48,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:08:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:08:48,201 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:48,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:08:48,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651872911] [2022-12-13 19:08:48,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651872911] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:08:48,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354833710] [2022-12-13 19:08:48,201 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 19:08:48,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:08:48,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:08:48,203 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:08:48,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 19:08:48,287 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-13 19:08:48,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:08:48,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 19:08:48,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:08:48,472 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:48,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:08:48,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:08:48,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354833710] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:08:48,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:08:48,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 12 [2022-12-13 19:08:48,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061776588] [2022-12-13 19:08:48,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:08:48,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 19:08:48,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:08:48,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 19:08:48,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-12-13 19:08:50,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:08:51,443 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 187 [2022-12-13 19:08:51,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 348 transitions, 6598 flow. Second operand has 13 states, 13 states have (on average 78.76923076923077) internal successors, (1024), 13 states have internal predecessors, (1024), 0 states have call successors, (0), 0 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 19:08:51,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:08:51,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 187 [2022-12-13 19:08:51,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:08:57,514 INFO L130 PetriNetUnfolder]: 1118/2240 cut-off events. [2022-12-13 19:08:57,514 INFO L131 PetriNetUnfolder]: For 120496/120497 co-relation queries the response was YES. [2022-12-13 19:08:57,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21705 conditions, 2240 events. 1118/2240 cut-off events. For 120496/120497 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 15001 event pairs, 182 based on Foata normal form. 44/2281 useless extension candidates. Maximal degree in co-relation 21629. Up to 1830 conditions per place. [2022-12-13 19:08:57,531 INFO L137 encePairwiseOnDemand]: 183/187 looper letters, 313 selfloop transitions, 67 changer transitions 31/415 dead transitions. [2022-12-13 19:08:57,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 415 transitions, 8606 flow [2022-12-13 19:08:57,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 19:08:57,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 19:08:57,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1149 transitions. [2022-12-13 19:08:57,533 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43888464476699773 [2022-12-13 19:08:57,533 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1149 transitions. [2022-12-13 19:08:57,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1149 transitions. [2022-12-13 19:08:57,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:08:57,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1149 transitions. [2022-12-13 19:08:57,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 82.07142857142857) internal successors, (1149), 14 states have internal predecessors, (1149), 0 states have call successors, (0), 0 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 19:08:57,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 187.0) internal successors, (2805), 15 states have internal predecessors, (2805), 0 states have call successors, (0), 0 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 19:08:57,536 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 187.0) internal successors, (2805), 15 states have internal predecessors, (2805), 0 states have call successors, (0), 0 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 19:08:57,536 INFO L175 Difference]: Start difference. First operand has 224 places, 348 transitions, 6598 flow. Second operand 14 states and 1149 transitions. [2022-12-13 19:08:57,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 415 transitions, 8606 flow [2022-12-13 19:08:57,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 415 transitions, 8358 flow, removed 102 selfloop flow, removed 8 redundant places. [2022-12-13 19:08:57,838 INFO L231 Difference]: Finished difference. Result has 232 places, 352 transitions, 6783 flow [2022-12-13 19:08:57,838 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=6323, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=6783, PETRI_PLACES=232, PETRI_TRANSITIONS=352} [2022-12-13 19:08:57,838 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 203 predicate places. [2022-12-13 19:08:57,838 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 352 transitions, 6783 flow [2022-12-13 19:08:57,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 78.76923076923077) internal successors, (1024), 13 states have internal predecessors, (1024), 0 states have call successors, (0), 0 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 19:08:57,839 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:08:57,839 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:08:57,842 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 19:08:58,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:08:58,040 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-12-13 19:08:58,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:08:58,041 INFO L85 PathProgramCache]: Analyzing trace with hash -2074730633, now seen corresponding path program 13 times [2022-12-13 19:08:58,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:08:58,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179676806] [2022-12-13 19:08:58,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:08:58,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:08:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:08:58,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:58,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:08:58,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179676806] [2022-12-13 19:08:58,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179676806] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:08:58,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159084386] [2022-12-13 19:08:58,294 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 19:08:58,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:08:58,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:08:58,295 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:08:58,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 19:08:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:08:58,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 19:08:58,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:08:58,471 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:58,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:08:59,009 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:08:59,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159084386] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:08:59,009 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:08:59,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-12-13 19:08:59,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906376681] [2022-12-13 19:08:59,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:08:59,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 19:08:59,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:08:59,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 19:08:59,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2022-12-13 19:08:59,189 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 187 [2022-12-13 19:08:59,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 352 transitions, 6783 flow. Second operand has 20 states, 20 states have (on average 76.7) internal successors, (1534), 20 states have internal predecessors, (1534), 0 states have call successors, (0), 0 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 19:08:59,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:08:59,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 187 [2022-12-13 19:08:59,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:09:02,553 INFO L130 PetriNetUnfolder]: 1396/2788 cut-off events. [2022-12-13 19:09:02,553 INFO L131 PetriNetUnfolder]: For 132953/132953 co-relation queries the response was YES. [2022-12-13 19:09:02,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26924 conditions, 2788 events. 1396/2788 cut-off events. For 132953/132953 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 19640 event pairs, 40 based on Foata normal form. 54/2842 useless extension candidates. Maximal degree in co-relation 26844. Up to 783 conditions per place. [2022-12-13 19:09:02,573 INFO L137 encePairwiseOnDemand]: 179/187 looper letters, 245 selfloop transitions, 296 changer transitions 25/566 dead transitions. [2022-12-13 19:09:02,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 566 transitions, 11382 flow [2022-12-13 19:09:02,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 19:09:02,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-12-13 19:09:02,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 2814 transitions. [2022-12-13 19:09:02,577 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4299465240641711 [2022-12-13 19:09:02,577 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 2814 transitions. [2022-12-13 19:09:02,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 2814 transitions. [2022-12-13 19:09:02,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:09:02,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 2814 transitions. [2022-12-13 19:09:02,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 80.4) internal successors, (2814), 35 states have internal predecessors, (2814), 0 states have call successors, (0), 0 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 19:09:02,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 187.0) internal successors, (6732), 36 states have internal predecessors, (6732), 0 states have call successors, (0), 0 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 19:09:02,586 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 187.0) internal successors, (6732), 36 states have internal predecessors, (6732), 0 states have call successors, (0), 0 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 19:09:02,586 INFO L175 Difference]: Start difference. First operand has 232 places, 352 transitions, 6783 flow. Second operand 35 states and 2814 transitions. [2022-12-13 19:09:02,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 566 transitions, 11382 flow [2022-12-13 19:09:02,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 566 transitions, 11141 flow, removed 61 selfloop flow, removed 7 redundant places. [2022-12-13 19:09:02,959 INFO L231 Difference]: Finished difference. Result has 274 places, 443 transitions, 9914 flow [2022-12-13 19:09:02,959 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=6591, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=9914, PETRI_PLACES=274, PETRI_TRANSITIONS=443} [2022-12-13 19:09:02,959 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 245 predicate places. [2022-12-13 19:09:02,959 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 443 transitions, 9914 flow [2022-12-13 19:09:02,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 76.7) internal successors, (1534), 20 states have internal predecessors, (1534), 0 states have call successors, (0), 0 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 19:09:02,960 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:09:02,960 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:09:02,964 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 19:09:03,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:09:03,161 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-12-13 19:09:03,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:09:03,162 INFO L85 PathProgramCache]: Analyzing trace with hash 488155593, now seen corresponding path program 14 times [2022-12-13 19:09:03,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:09:03,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521683419] [2022-12-13 19:09:03,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:09:03,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:09:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:09:03,355 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:09:03,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:09:03,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521683419] [2022-12-13 19:09:03,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521683419] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:09:03,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266249282] [2022-12-13 19:09:03,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:09:03,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:09:03,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:09:03,357 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:09:03,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 19:09:03,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:09:03,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:09:03,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 19:09:03,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:09:03,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:09:03,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:09:09,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:09:09,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266249282] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:09:09,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:09:09,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-12-13 19:09:09,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523457179] [2022-12-13 19:09:09,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:09:09,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 19:09:09,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:09:09,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 19:09:09,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2022-12-13 19:09:11,785 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 187 [2022-12-13 19:09:11,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 443 transitions, 9914 flow. Second operand has 19 states, 19 states have (on average 76.73684210526316) internal successors, (1458), 19 states have internal predecessors, (1458), 0 states have call successors, (0), 0 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 19:09:11,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:09:11,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 187 [2022-12-13 19:09:11,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:09:31,078 WARN L233 SmtUtils]: Spent 18.57s on a formula simplification. DAG size of input: 90 DAG size of output: 89 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:09:37,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 19:09:43,081 INFO L130 PetriNetUnfolder]: 1411/2784 cut-off events. [2022-12-13 19:09:43,081 INFO L131 PetriNetUnfolder]: For 147184/147184 co-relation queries the response was YES. [2022-12-13 19:09:43,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30028 conditions, 2784 events. 1411/2784 cut-off events. For 147184/147184 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 19154 event pairs, 79 based on Foata normal form. 14/2798 useless extension candidates. Maximal degree in co-relation 29935. Up to 986 conditions per place. [2022-12-13 19:09:43,103 INFO L137 encePairwiseOnDemand]: 180/187 looper letters, 316 selfloop transitions, 216 changer transitions 21/553 dead transitions. [2022-12-13 19:09:43,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 553 transitions, 12923 flow [2022-12-13 19:09:43,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 19:09:43,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-13 19:09:43,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2458 transitions. [2022-12-13 19:09:43,106 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4240124202173538 [2022-12-13 19:09:43,106 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 2458 transitions. [2022-12-13 19:09:43,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 2458 transitions. [2022-12-13 19:09:43,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:09:43,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2458 transitions. [2022-12-13 19:09:43,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 79.29032258064517) internal successors, (2458), 31 states have internal predecessors, (2458), 0 states have call successors, (0), 0 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 19:09:43,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 187.0) internal successors, (5984), 32 states have internal predecessors, (5984), 0 states have call successors, (0), 0 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 19:09:43,111 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 187.0) internal successors, (5984), 32 states have internal predecessors, (5984), 0 states have call successors, (0), 0 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 19:09:43,111 INFO L175 Difference]: Start difference. First operand has 274 places, 443 transitions, 9914 flow. Second operand 31 states and 2458 transitions. [2022-12-13 19:09:43,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 553 transitions, 12923 flow [2022-12-13 19:09:43,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 553 transitions, 12211 flow, removed 328 selfloop flow, removed 11 redundant places. [2022-12-13 19:09:43,730 INFO L231 Difference]: Finished difference. Result has 298 places, 466 transitions, 10581 flow [2022-12-13 19:09:43,730 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=9139, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=185, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=10581, PETRI_PLACES=298, PETRI_TRANSITIONS=466} [2022-12-13 19:09:43,730 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 269 predicate places. [2022-12-13 19:09:43,730 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 466 transitions, 10581 flow [2022-12-13 19:09:43,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 76.73684210526316) internal successors, (1458), 19 states have internal predecessors, (1458), 0 states have call successors, (0), 0 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 19:09:43,731 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:09:43,731 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:09:43,735 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 19:09:43,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:09:43,933 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-12-13 19:09:43,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:09:43,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1861310719, now seen corresponding path program 15 times [2022-12-13 19:09:43,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:09:43,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081324243] [2022-12-13 19:09:43,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:09:43,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:09:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:09:44,090 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 19:09:44,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:09:44,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081324243] [2022-12-13 19:09:44,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081324243] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:09:44,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037518095] [2022-12-13 19:09:44,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 19:09:44,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:09:44,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:09:44,092 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:09:44,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 19:09:44,155 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 19:09:44,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:09:44,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 19:09:44,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:09:44,275 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 19:09:44,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:09:44,609 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:09:44,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037518095] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:09:44,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:09:44,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-12-13 19:09:44,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804902714] [2022-12-13 19:09:44,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:09:44,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 19:09:44,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:09:44,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 19:09:44,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-12-13 19:09:44,784 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 187 [2022-12-13 19:09:44,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 466 transitions, 10581 flow. Second operand has 20 states, 20 states have (on average 76.85) internal successors, (1537), 20 states have internal predecessors, (1537), 0 states have call successors, (0), 0 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 19:09:44,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:09:44,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 187 [2022-12-13 19:09:44,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:09:46,770 INFO L130 PetriNetUnfolder]: 1640/3179 cut-off events. [2022-12-13 19:09:46,770 INFO L131 PetriNetUnfolder]: For 182684/182684 co-relation queries the response was YES. [2022-12-13 19:09:46,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34856 conditions, 3179 events. 1640/3179 cut-off events. For 182684/182684 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 22144 event pairs, 114 based on Foata normal form. 62/3241 useless extension candidates. Maximal degree in co-relation 34757. Up to 967 conditions per place. [2022-12-13 19:09:46,797 INFO L137 encePairwiseOnDemand]: 179/187 looper letters, 284 selfloop transitions, 396 changer transitions 5/685 dead transitions. [2022-12-13 19:09:46,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 685 transitions, 16387 flow [2022-12-13 19:09:46,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 19:09:46,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-13 19:09:46,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2176 transitions. [2022-12-13 19:09:46,799 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43097643097643096 [2022-12-13 19:09:46,800 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 2176 transitions. [2022-12-13 19:09:46,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 2176 transitions. [2022-12-13 19:09:46,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:09:46,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 2176 transitions. [2022-12-13 19:09:46,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 80.5925925925926) internal successors, (2176), 27 states have internal predecessors, (2176), 0 states have call successors, (0), 0 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 19:09:46,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 187.0) internal successors, (5236), 28 states have internal predecessors, (5236), 0 states have call successors, (0), 0 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 19:09:46,804 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 187.0) internal successors, (5236), 28 states have internal predecessors, (5236), 0 states have call successors, (0), 0 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 19:09:46,804 INFO L175 Difference]: Start difference. First operand has 298 places, 466 transitions, 10581 flow. Second operand 27 states and 2176 transitions. [2022-12-13 19:09:46,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 685 transitions, 16387 flow [2022-12-13 19:09:47,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 685 transitions, 15757 flow, removed 274 selfloop flow, removed 15 redundant places. [2022-12-13 19:09:47,607 INFO L231 Difference]: Finished difference. Result has 312 places, 584 transitions, 14783 flow [2022-12-13 19:09:47,608 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=10042, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=283, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=14783, PETRI_PLACES=312, PETRI_TRANSITIONS=584} [2022-12-13 19:09:47,608 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 283 predicate places. [2022-12-13 19:09:47,608 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 584 transitions, 14783 flow [2022-12-13 19:09:47,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 76.85) internal successors, (1537), 20 states have internal predecessors, (1537), 0 states have call successors, (0), 0 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 19:09:47,608 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:09:47,608 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:09:47,612 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-13 19:09:47,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-13 19:09:47,810 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-12-13 19:09:47,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:09:47,811 INFO L85 PathProgramCache]: Analyzing trace with hash -338743467, now seen corresponding path program 16 times [2022-12-13 19:09:47,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:09:47,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504377223] [2022-12-13 19:09:47,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:09:47,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:09:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:09:47,998 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:09:47,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:09:47,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504377223] [2022-12-13 19:09:47,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504377223] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:09:47,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242579285] [2022-12-13 19:09:47,998 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 19:09:47,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:09:47,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:09:47,999 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:09:48,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 19:09:48,045 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 19:09:48,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:09:48,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 19:09:48,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:09:48,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:09:48,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:09:48,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:09:48,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242579285] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:09:48,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:09:48,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-12-13 19:09:48,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032792053] [2022-12-13 19:09:48,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:09:48,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 19:09:48,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:09:48,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 19:09:48,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2022-12-13 19:09:48,824 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 187 [2022-12-13 19:09:48,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 584 transitions, 14783 flow. Second operand has 19 states, 19 states have (on average 76.73684210526316) internal successors, (1458), 19 states have internal predecessors, (1458), 0 states have call successors, (0), 0 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 19:09:48,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:09:48,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 187 [2022-12-13 19:09:48,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:09:51,219 INFO L130 PetriNetUnfolder]: 1785/3417 cut-off events. [2022-12-13 19:09:51,219 INFO L131 PetriNetUnfolder]: For 179621/179621 co-relation queries the response was YES. [2022-12-13 19:09:51,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39734 conditions, 3417 events. 1785/3417 cut-off events. For 179621/179621 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 23769 event pairs, 224 based on Foata normal form. 26/3443 useless extension candidates. Maximal degree in co-relation 39630. Up to 1372 conditions per place. [2022-12-13 19:09:51,250 INFO L137 encePairwiseOnDemand]: 180/187 looper letters, 342 selfloop transitions, 326 changer transitions 23/691 dead transitions. [2022-12-13 19:09:51,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 691 transitions, 18594 flow [2022-12-13 19:09:51,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 19:09:51,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-13 19:09:51,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1831 transitions. [2022-12-13 19:09:51,253 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4257149500116252 [2022-12-13 19:09:51,253 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1831 transitions. [2022-12-13 19:09:51,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1831 transitions. [2022-12-13 19:09:51,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:09:51,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1831 transitions. [2022-12-13 19:09:51,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 79.6086956521739) internal successors, (1831), 23 states have internal predecessors, (1831), 0 states have call successors, (0), 0 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 19:09:51,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 187.0) internal successors, (4488), 24 states have internal predecessors, (4488), 0 states have call successors, (0), 0 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 19:09:51,257 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 187.0) internal successors, (4488), 24 states have internal predecessors, (4488), 0 states have call successors, (0), 0 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 19:09:51,257 INFO L175 Difference]: Start difference. First operand has 312 places, 584 transitions, 14783 flow. Second operand 23 states and 1831 transitions. [2022-12-13 19:09:51,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 691 transitions, 18594 flow [2022-12-13 19:09:52,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 691 transitions, 17775 flow, removed 301 selfloop flow, removed 16 redundant places. [2022-12-13 19:09:52,233 INFO L231 Difference]: Finished difference. Result has 322 places, 616 transitions, 16277 flow [2022-12-13 19:09:52,234 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=13932, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=287, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=16277, PETRI_PLACES=322, PETRI_TRANSITIONS=616} [2022-12-13 19:09:52,234 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 293 predicate places. [2022-12-13 19:09:52,234 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 616 transitions, 16277 flow [2022-12-13 19:09:52,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 76.73684210526316) internal successors, (1458), 19 states have internal predecessors, (1458), 0 states have call successors, (0), 0 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 19:09:52,234 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:09:52,234 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:09:52,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-13 19:09:52,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 19:09:52,436 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-12-13 19:09:52,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:09:52,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1176235472, now seen corresponding path program 17 times [2022-12-13 19:09:52,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:09:52,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102035610] [2022-12-13 19:09:52,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:09:52,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:09:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:09:52,791 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:09:52,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:09:52,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102035610] [2022-12-13 19:09:52,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102035610] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:09:52,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808911279] [2022-12-13 19:09:52,791 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 19:09:52,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:09:52,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:09:52,792 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:09:52,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 19:09:52,853 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 19:09:52,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:09:52,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 19:09:52,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:09:53,113 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:09:53,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:09:53,367 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:09:53,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808911279] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:09:53,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:09:53,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-12-13 19:09:53,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065322822] [2022-12-13 19:09:53,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:09:53,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 19:09:53,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:09:53,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 19:09:53,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2022-12-13 19:09:53,611 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 187 [2022-12-13 19:09:53,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 616 transitions, 16277 flow. Second operand has 24 states, 24 states have (on average 75.0) internal successors, (1800), 24 states have internal predecessors, (1800), 0 states have call successors, (0), 0 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 19:09:53,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:09:53,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 187 [2022-12-13 19:09:53,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:09:57,643 INFO L130 PetriNetUnfolder]: 2979/5844 cut-off events. [2022-12-13 19:09:57,643 INFO L131 PetriNetUnfolder]: For 360480/360480 co-relation queries the response was YES. [2022-12-13 19:09:57,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69946 conditions, 5844 events. 2979/5844 cut-off events. For 360480/360480 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 45912 event pairs, 312 based on Foata normal form. 71/5915 useless extension candidates. Maximal degree in co-relation 69838. Up to 2314 conditions per place. [2022-12-13 19:09:57,704 INFO L137 encePairwiseOnDemand]: 180/187 looper letters, 851 selfloop transitions, 300 changer transitions 58/1209 dead transitions. [2022-12-13 19:09:57,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 1209 transitions, 32969 flow [2022-12-13 19:09:57,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-13 19:09:57,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-13 19:09:57,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 2860 transitions. [2022-12-13 19:09:57,708 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42483660130718953 [2022-12-13 19:09:57,708 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 2860 transitions. [2022-12-13 19:09:57,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 2860 transitions. [2022-12-13 19:09:57,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:09:57,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 2860 transitions. [2022-12-13 19:09:57,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 79.44444444444444) internal successors, (2860), 36 states have internal predecessors, (2860), 0 states have call successors, (0), 0 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 19:09:57,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 187.0) internal successors, (6919), 37 states have internal predecessors, (6919), 0 states have call successors, (0), 0 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 19:09:57,714 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 187.0) internal successors, (6919), 37 states have internal predecessors, (6919), 0 states have call successors, (0), 0 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 19:09:57,714 INFO L175 Difference]: Start difference. First operand has 322 places, 616 transitions, 16277 flow. Second operand 36 states and 2860 transitions. [2022-12-13 19:09:57,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 1209 transitions, 32969 flow [2022-12-13 19:09:59,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 1209 transitions, 32037 flow, removed 425 selfloop flow, removed 12 redundant places. [2022-12-13 19:09:59,773 INFO L231 Difference]: Finished difference. Result has 356 places, 799 transitions, 21551 flow [2022-12-13 19:09:59,774 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=15633, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=21551, PETRI_PLACES=356, PETRI_TRANSITIONS=799} [2022-12-13 19:09:59,774 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 327 predicate places. [2022-12-13 19:09:59,774 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 799 transitions, 21551 flow [2022-12-13 19:09:59,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 75.0) internal successors, (1800), 24 states have internal predecessors, (1800), 0 states have call successors, (0), 0 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 19:09:59,775 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:09:59,775 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:09:59,779 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-13 19:09:59,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:09:59,976 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-12-13 19:09:59,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:09:59,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1374979758, now seen corresponding path program 18 times [2022-12-13 19:09:59,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:09:59,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791310834] [2022-12-13 19:09:59,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:09:59,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:10:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:10:00,288 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:10:00,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:10:00,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791310834] [2022-12-13 19:10:00,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791310834] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:10:00,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586223337] [2022-12-13 19:10:00,289 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 19:10:00,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:10:00,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:10:00,290 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:10:00,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 19:10:00,341 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-13 19:10:00,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:10:00,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 19:10:00,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:10:00,576 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:10:00,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:10:00,873 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:10:00,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586223337] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:10:00,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:10:00,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2022-12-13 19:10:00,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790302958] [2022-12-13 19:10:00,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:10:00,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 19:10:00,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:10:00,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 19:10:00,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2022-12-13 19:10:01,097 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 187 [2022-12-13 19:10:01,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 799 transitions, 21551 flow. Second operand has 21 states, 21 states have (on average 75.0952380952381) internal successors, (1577), 21 states have internal predecessors, (1577), 0 states have call successors, (0), 0 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 19:10:01,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:10:01,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 187 [2022-12-13 19:10:01,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:10:05,600 INFO L130 PetriNetUnfolder]: 3127/6131 cut-off events. [2022-12-13 19:10:05,600 INFO L131 PetriNetUnfolder]: For 437725/437725 co-relation queries the response was YES. [2022-12-13 19:10:05,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77096 conditions, 6131 events. 3127/6131 cut-off events. For 437725/437725 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 48623 event pairs, 407 based on Foata normal form. 60/6191 useless extension candidates. Maximal degree in co-relation 76976. Up to 2392 conditions per place. [2022-12-13 19:10:05,663 INFO L137 encePairwiseOnDemand]: 178/187 looper letters, 912 selfloop transitions, 300 changer transitions 40/1252 dead transitions. [2022-12-13 19:10:05,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 1252 transitions, 35102 flow [2022-12-13 19:10:05,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-13 19:10:05,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-13 19:10:05,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 2935 transitions. [2022-12-13 19:10:05,666 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4241942477236595 [2022-12-13 19:10:05,666 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 2935 transitions. [2022-12-13 19:10:05,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 2935 transitions. [2022-12-13 19:10:05,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:10:05,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 2935 transitions. [2022-12-13 19:10:05,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 79.32432432432432) internal successors, (2935), 37 states have internal predecessors, (2935), 0 states have call successors, (0), 0 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 19:10:05,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 187.0) internal successors, (7106), 38 states have internal predecessors, (7106), 0 states have call successors, (0), 0 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 19:10:05,672 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 187.0) internal successors, (7106), 38 states have internal predecessors, (7106), 0 states have call successors, (0), 0 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 19:10:05,672 INFO L175 Difference]: Start difference. First operand has 356 places, 799 transitions, 21551 flow. Second operand 37 states and 2935 transitions. [2022-12-13 19:10:05,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 1252 transitions, 35102 flow [2022-12-13 19:10:08,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 1252 transitions, 33809 flow, removed 547 selfloop flow, removed 11 redundant places. [2022-12-13 19:10:08,310 INFO L231 Difference]: Finished difference. Result has 390 places, 863 transitions, 23465 flow [2022-12-13 19:10:08,311 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=20551, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=799, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=246, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=526, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=23465, PETRI_PLACES=390, PETRI_TRANSITIONS=863} [2022-12-13 19:10:08,311 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 361 predicate places. [2022-12-13 19:10:08,311 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 863 transitions, 23465 flow [2022-12-13 19:10:08,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 75.0952380952381) internal successors, (1577), 21 states have internal predecessors, (1577), 0 states have call successors, (0), 0 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 19:10:08,312 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:10:08,312 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:10:08,315 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-13 19:10:08,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:10:08,513 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-12-13 19:10:08,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:10:08,514 INFO L85 PathProgramCache]: Analyzing trace with hash 545095396, now seen corresponding path program 19 times [2022-12-13 19:10:08,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:10:08,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497257256] [2022-12-13 19:10:08,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:10:08,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:10:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:10:08,825 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:10:08,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:10:08,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497257256] [2022-12-13 19:10:08,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497257256] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:10:08,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805960972] [2022-12-13 19:10:08,826 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 19:10:08,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:10:08,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:10:08,827 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:10:08,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 19:10:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:10:08,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 19:10:08,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:10:09,120 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:10:09,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:10:09,477 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:10:09,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805960972] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:10:09,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:10:09,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-12-13 19:10:09,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742378294] [2022-12-13 19:10:09,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:10:09,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 19:10:09,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:10:09,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 19:10:09,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2022-12-13 19:10:09,721 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 187 [2022-12-13 19:10:09,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 863 transitions, 23465 flow. Second operand has 23 states, 23 states have (on average 74.8695652173913) internal successors, (1722), 23 states have internal predecessors, (1722), 0 states have call successors, (0), 0 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 19:10:09,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:10:09,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 187 [2022-12-13 19:10:09,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:10:18,605 INFO L130 PetriNetUnfolder]: 3365/6680 cut-off events. [2022-12-13 19:10:18,605 INFO L131 PetriNetUnfolder]: For 581161/581161 co-relation queries the response was YES. [2022-12-13 19:10:18,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86549 conditions, 6680 events. 3365/6680 cut-off events. For 581161/581161 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 54601 event pairs, 76 based on Foata normal form. 42/6722 useless extension candidates. Maximal degree in co-relation 86421. Up to 1645 conditions per place. [2022-12-13 19:10:18,723 INFO L137 encePairwiseOnDemand]: 179/187 looper letters, 576 selfloop transitions, 776 changer transitions 44/1396 dead transitions. [2022-12-13 19:10:18,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 1396 transitions, 39284 flow [2022-12-13 19:10:18,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-12-13 19:10:18,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2022-12-13 19:10:18,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 4335 transitions. [2022-12-13 19:10:18,726 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4214876033057851 [2022-12-13 19:10:18,727 INFO L72 ComplementDD]: Start complementDD. Operand 55 states and 4335 transitions. [2022-12-13 19:10:18,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 4335 transitions. [2022-12-13 19:10:18,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:10:18,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 4335 transitions. [2022-12-13 19:10:18,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 56 states, 55 states have (on average 78.81818181818181) internal successors, (4335), 55 states have internal predecessors, (4335), 0 states have call successors, (0), 0 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 19:10:18,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 56 states, 56 states have (on average 187.0) internal successors, (10472), 56 states have internal predecessors, (10472), 0 states have call successors, (0), 0 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 19:10:18,736 INFO L81 ComplementDD]: Finished complementDD. Result has 56 states, 56 states have (on average 187.0) internal successors, (10472), 56 states have internal predecessors, (10472), 0 states have call successors, (0), 0 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 19:10:18,736 INFO L175 Difference]: Start difference. First operand has 390 places, 863 transitions, 23465 flow. Second operand 55 states and 4335 transitions. [2022-12-13 19:10:18,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 1396 transitions, 39284 flow [2022-12-13 19:10:22,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 1396 transitions, 38275 flow, removed 417 selfloop flow, removed 10 redundant places. [2022-12-13 19:10:22,946 INFO L231 Difference]: Finished difference. Result has 455 places, 1089 transitions, 32515 flow [2022-12-13 19:10:22,947 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=22485, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=863, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=562, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=32515, PETRI_PLACES=455, PETRI_TRANSITIONS=1089} [2022-12-13 19:10:22,947 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 426 predicate places. [2022-12-13 19:10:22,947 INFO L495 AbstractCegarLoop]: Abstraction has has 455 places, 1089 transitions, 32515 flow [2022-12-13 19:10:22,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 74.8695652173913) internal successors, (1722), 23 states have internal predecessors, (1722), 0 states have call successors, (0), 0 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 19:10:22,948 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:10:22,948 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:10:22,952 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-13 19:10:23,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:10:23,149 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-12-13 19:10:23,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:10:23,150 INFO L85 PathProgramCache]: Analyzing trace with hash 287381226, now seen corresponding path program 20 times [2022-12-13 19:10:23,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:10:23,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502057531] [2022-12-13 19:10:23,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:10:23,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:10:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:10:23,363 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:10:23,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:10:23,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502057531] [2022-12-13 19:10:23,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502057531] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:10:23,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606454077] [2022-12-13 19:10:23,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:10:23,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:10:23,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:10:23,365 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:10:23,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 19:10:23,420 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:10:23,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:10:23,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 19:10:23,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:10:23,586 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:10:23,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:10:23,921 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:10:23,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606454077] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:10:23,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:10:23,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-12-13 19:10:23,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986501878] [2022-12-13 19:10:23,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:10:23,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 19:10:23,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:10:23,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 19:10:23,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2022-12-13 19:10:24,144 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 187 [2022-12-13 19:10:24,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 1089 transitions, 32515 flow. Second operand has 23 states, 23 states have (on average 76.95652173913044) internal successors, (1770), 23 states have internal predecessors, (1770), 0 states have call successors, (0), 0 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 19:10:24,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:10:24,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 187 [2022-12-13 19:10:24,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:10:32,590 INFO L130 PetriNetUnfolder]: 3404/6664 cut-off events. [2022-12-13 19:10:32,590 INFO L131 PetriNetUnfolder]: For 657034/657034 co-relation queries the response was YES. [2022-12-13 19:10:32,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91617 conditions, 6664 events. 3404/6664 cut-off events. For 657034/657034 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 53644 event pairs, 145 based on Foata normal form. 74/6738 useless extension candidates. Maximal degree in co-relation 91468. Up to 2059 conditions per place. [2022-12-13 19:10:32,671 INFO L137 encePairwiseOnDemand]: 179/187 looper letters, 551 selfloop transitions, 759 changer transitions 21/1331 dead transitions. [2022-12-13 19:10:32,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 507 places, 1331 transitions, 39222 flow [2022-12-13 19:10:32,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-12-13 19:10:32,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2022-12-13 19:10:32,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 4497 transitions. [2022-12-13 19:10:32,675 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42943086325439267 [2022-12-13 19:10:32,675 INFO L72 ComplementDD]: Start complementDD. Operand 56 states and 4497 transitions. [2022-12-13 19:10:32,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 4497 transitions. [2022-12-13 19:10:32,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:10:32,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 56 states and 4497 transitions. [2022-12-13 19:10:32,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 57 states, 56 states have (on average 80.30357142857143) internal successors, (4497), 56 states have internal predecessors, (4497), 0 states have call successors, (0), 0 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 19:10:32,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 57 states, 57 states have (on average 187.0) internal successors, (10659), 57 states have internal predecessors, (10659), 0 states have call successors, (0), 0 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 19:10:32,684 INFO L81 ComplementDD]: Finished complementDD. Result has 57 states, 57 states have (on average 187.0) internal successors, (10659), 57 states have internal predecessors, (10659), 0 states have call successors, (0), 0 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 19:10:32,684 INFO L175 Difference]: Start difference. First operand has 455 places, 1089 transitions, 32515 flow. Second operand 56 states and 4497 transitions. [2022-12-13 19:10:32,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 507 places, 1331 transitions, 39222 flow [2022-12-13 19:10:37,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 1331 transitions, 37803 flow, removed 591 selfloop flow, removed 26 redundant places. [2022-12-13 19:10:37,739 INFO L231 Difference]: Finished difference. Result has 491 places, 1145 transitions, 34915 flow [2022-12-13 19:10:37,740 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=31081, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1086, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=704, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=34915, PETRI_PLACES=491, PETRI_TRANSITIONS=1145} [2022-12-13 19:10:37,740 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 462 predicate places. [2022-12-13 19:10:37,740 INFO L495 AbstractCegarLoop]: Abstraction has has 491 places, 1145 transitions, 34915 flow [2022-12-13 19:10:37,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 76.95652173913044) internal successors, (1770), 23 states have internal predecessors, (1770), 0 states have call successors, (0), 0 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 19:10:37,741 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:10:37,741 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:10:37,746 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-13 19:10:37,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 19:10:37,941 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-12-13 19:10:37,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:10:37,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1085165398, now seen corresponding path program 21 times [2022-12-13 19:10:37,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:10:37,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647095973] [2022-12-13 19:10:37,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:10:37,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:10:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:10:38,124 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:10:38,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:10:38,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647095973] [2022-12-13 19:10:38,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647095973] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:10:38,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734966177] [2022-12-13 19:10:38,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 19:10:38,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:10:38,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:10:38,125 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:10:38,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 19:10:38,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 19:10:38,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:10:38,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 19:10:38,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:10:38,397 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:10:38,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:10:38,675 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:10:38,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734966177] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:10:38,675 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:10:38,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-12-13 19:10:38,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592099197] [2022-12-13 19:10:38,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:10:38,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 19:10:38,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:10:38,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 19:10:38,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-12-13 19:10:38,803 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 187 [2022-12-13 19:10:38,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 491 places, 1145 transitions, 34915 flow. Second operand has 18 states, 18 states have (on average 74.72222222222223) internal successors, (1345), 18 states have internal predecessors, (1345), 0 states have call successors, (0), 0 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 19:10:38,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:10:38,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 187 [2022-12-13 19:10:38,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:10:45,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 19:10:50,367 INFO L130 PetriNetUnfolder]: 4322/8491 cut-off events. [2022-12-13 19:10:50,367 INFO L131 PetriNetUnfolder]: For 981548/981548 co-relation queries the response was YES. [2022-12-13 19:10:50,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125302 conditions, 8491 events. 4322/8491 cut-off events. For 981548/981548 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 71828 event pairs, 372 based on Foata normal form. 50/8541 useless extension candidates. Maximal degree in co-relation 125145. Up to 1859 conditions per place. [2022-12-13 19:10:50,514 INFO L137 encePairwiseOnDemand]: 179/187 looper letters, 793 selfloop transitions, 956 changer transitions 14/1763 dead transitions. [2022-12-13 19:10:50,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 1763 transitions, 56388 flow [2022-12-13 19:10:50,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-12-13 19:10:50,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2022-12-13 19:10:50,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 5294 transitions. [2022-12-13 19:10:50,519 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41632588864422776 [2022-12-13 19:10:50,519 INFO L72 ComplementDD]: Start complementDD. Operand 68 states and 5294 transitions. [2022-12-13 19:10:50,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 5294 transitions. [2022-12-13 19:10:50,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:10:50,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 68 states and 5294 transitions. [2022-12-13 19:10:50,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 69 states, 68 states have (on average 77.8529411764706) internal successors, (5294), 68 states have internal predecessors, (5294), 0 states have call successors, (0), 0 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 19:10:50,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 69 states, 69 states have (on average 187.0) internal successors, (12903), 69 states have internal predecessors, (12903), 0 states have call successors, (0), 0 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 19:10:50,532 INFO L81 ComplementDD]: Finished complementDD. Result has 69 states, 69 states have (on average 187.0) internal successors, (12903), 69 states have internal predecessors, (12903), 0 states have call successors, (0), 0 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 19:10:50,532 INFO L175 Difference]: Start difference. First operand has 491 places, 1145 transitions, 34915 flow. Second operand 68 states and 5294 transitions. [2022-12-13 19:10:50,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 1763 transitions, 56388 flow [2022-12-13 19:10:58,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 527 places, 1763 transitions, 54090 flow, removed 948 selfloop flow, removed 29 redundant places. [2022-12-13 19:10:58,850 INFO L231 Difference]: Finished difference. Result has 543 places, 1487 transitions, 48835 flow [2022-12-13 19:10:58,851 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=33505, PETRI_DIFFERENCE_MINUEND_PLACES=460, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=645, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=68, PETRI_FLOW=48835, PETRI_PLACES=543, PETRI_TRANSITIONS=1487} [2022-12-13 19:10:58,851 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 514 predicate places. [2022-12-13 19:10:58,851 INFO L495 AbstractCegarLoop]: Abstraction has has 543 places, 1487 transitions, 48835 flow [2022-12-13 19:10:58,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 74.72222222222223) internal successors, (1345), 18 states have internal predecessors, (1345), 0 states have call successors, (0), 0 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 19:10:58,852 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:10:58,852 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:10:58,856 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-13 19:10:59,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-13 19:10:59,052 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-12-13 19:10:59,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:10:59,053 INFO L85 PathProgramCache]: Analyzing trace with hash -149787836, now seen corresponding path program 22 times [2022-12-13 19:10:59,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:10:59,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982326530] [2022-12-13 19:10:59,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:10:59,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:10:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:10:59,297 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:10:59,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:10:59,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982326530] [2022-12-13 19:10:59,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982326530] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:10:59,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566398154] [2022-12-13 19:10:59,298 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 19:10:59,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:10:59,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:10:59,299 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:10:59,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6976e042-2772-4c27-a2ab-92940ebc68b3/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 19:10:59,346 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 19:10:59,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:10:59,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 19:10:59,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:10:59,493 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:10:59,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:11:16,026 WARN L233 SmtUtils]: Spent 6.81s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:11:29,447 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:11:29,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566398154] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:11:29,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:11:29,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-12-13 19:11:29,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334239044] [2022-12-13 19:11:29,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:11:29,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 19:11:29,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:11:29,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 19:11:29,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=348, Unknown=9, NotChecked=0, Total=462 [2022-12-13 19:11:31,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:11:34,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:11:34,853 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 187 [2022-12-13 19:11:34,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 1487 transitions, 48835 flow. Second operand has 22 states, 22 states have (on average 76.95454545454545) internal successors, (1693), 22 states have internal predecessors, (1693), 0 states have call successors, (0), 0 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 19:11:34,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:11:34,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 187 [2022-12-13 19:11:34,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:11:55,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:11:58,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:12:00,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:12:02,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:13:24,152 WARN L233 SmtUtils]: Spent 39.15s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:13:26,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:13:28,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:13:30,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:13:32,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:13:34,535 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse9 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296))) (and (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int)) (let ((.cse1 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse0 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse2 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse4 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse1 4294967295))) (or (<= (+ .cse0 1) (+ (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse1)) (< 0 (+ .cse1 4294967295)) (<= (+ .cse0 .cse2 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse1 .cse3)) (<= .cse4 .cse0) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (>= aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296) (<= .cse4 (+ .cse0 .cse2)) (<= .cse4 0))))) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse5 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse8 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse6 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse5 4294967295)) (.cse7 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296))) (or (< c_thread2Thread1of1ForFork1_~i~1 (+ (* (div (+ (- 8589934590) c_thread2Thread1of1ForFork1_~i~1) 4294967296) 4294967296) 8589934590 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) c_thread2Thread1of1ForFork1_~i~1 1) 4294967296))) (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse5 4294967295)) (<= .cse6 c_thread2Thread1of1ForFork1_~i~1) (<= (+ c_thread2Thread1of1ForFork1_~i~1 .cse7 .cse8 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse5 .cse9)) (<= .cse6 (+ c_thread2Thread1of1ForFork1_~i~1 .cse7 .cse8)) (<= (+ c_thread2Thread1of1ForFork1_~i~1 .cse7 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse5 .cse3)) (>= aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296) (<= .cse6 (+ c_thread2Thread1of1ForFork1_~i~1 .cse7)))))) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 Int)) (let ((.cse11 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 4294967296)) (.cse14 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296))) (let ((.cse10 (+ c_thread2Thread1of1ForFork1_~i~1 .cse14 (* 4294967296 aux_div_aux_mod_~M~0_21_32))) (.cse13 (+ c_thread2Thread1of1ForFork1_~i~1 .cse14)) (.cse12 (+ .cse11 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 4294967296))) (or (<= .cse10 (+ .cse11 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 .cse9)) (>= aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 4294967296) (<= .cse12 .cse13) (<= .cse12 .cse10) (< c_thread2Thread1of1ForFork1_~i~1 (+ (* (div (+ (- 8589934591) c_thread2Thread1of1ForFork1_~i~1) 4294967296) 4294967296) (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 4294967295) c_thread2Thread1of1ForFork1_~i~1) 4294967296) 8589934591)) (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse11 4294967296)) (<= .cse13 (+ .cse11 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 .cse3)) (<= .cse12 c_thread2Thread1of1ForFork1_~i~1))))) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse17 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse15 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse16 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse18 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse17 4294967295))) (or (<= (+ .cse15 .cse16 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse17 .cse9)) (< 0 (+ .cse17 4294967295)) (<= .cse18 .cse15) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (>= aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296) (<= (+ .cse15 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse17 .cse3)) (<= .cse18 (+ .cse15 .cse16)) (<= .cse18 0))))) (let ((.cse19 (mod c_~M~0 4294967296))) (or (not (< .cse9 .cse19)) (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse19 (* 4294967296 (div (+ c_thread2Thread1of1ForFork1_~i~1 (- 4294967295)) 4294967296)) 4294967295)) (not (< (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) .cse19)))))) is different from false [2022-12-13 19:13:36,693 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 19:13:38,865 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse4 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296))) (and (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse0 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse3 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse1 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse0 4294967295)) (.cse2 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296))) (or (< c_thread2Thread1of1ForFork1_~i~1 (+ (* (div (+ (- 8589934590) c_thread2Thread1of1ForFork1_~i~1) 4294967296) 4294967296) 8589934590 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) c_thread2Thread1of1ForFork1_~i~1 1) 4294967296))) (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse0 4294967295)) (<= .cse1 c_thread2Thread1of1ForFork1_~i~1) (<= (+ c_thread2Thread1of1ForFork1_~i~1 .cse2 .cse3 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse0 .cse4)) (<= .cse1 (+ c_thread2Thread1of1ForFork1_~i~1 .cse2 .cse3)) (<= (+ c_thread2Thread1of1ForFork1_~i~1 .cse2 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse0 .cse5)) (>= aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296) (<= .cse1 (+ c_thread2Thread1of1ForFork1_~i~1 .cse2)))))) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 Int)) (let ((.cse7 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 4294967296)) (.cse10 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296))) (let ((.cse6 (+ c_thread2Thread1of1ForFork1_~i~1 .cse10 (* 4294967296 aux_div_aux_mod_~M~0_21_32))) (.cse9 (+ c_thread2Thread1of1ForFork1_~i~1 .cse10)) (.cse8 (+ .cse7 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 4294967296))) (or (<= .cse6 (+ .cse7 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 .cse4)) (>= aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 4294967296) (<= .cse8 .cse9) (<= .cse8 .cse6) (< c_thread2Thread1of1ForFork1_~i~1 (+ (* (div (+ (- 8589934591) c_thread2Thread1of1ForFork1_~i~1) 4294967296) 4294967296) (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 4294967295) c_thread2Thread1of1ForFork1_~i~1) 4294967296) 8589934591)) (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse7 4294967296)) (<= .cse9 (+ .cse7 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 .cse5)) (<= .cse8 c_thread2Thread1of1ForFork1_~i~1))))) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse13 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse11 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse12 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse14 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse13 4294967295))) (or (<= (+ .cse11 .cse12 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse13 .cse4)) (< 0 (+ .cse13 4294967295)) (<= .cse14 .cse11) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (>= aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296) (<= (+ .cse11 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse13 .cse5)) (<= .cse14 (+ .cse11 .cse12)) (<= .cse14 0))))) (let ((.cse15 (mod c_~M~0 4294967296))) (or (not (< .cse4 .cse15)) (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse15 (* 4294967296 (div (+ c_thread2Thread1of1ForFork1_~i~1 (- 4294967295)) 4294967296)) 4294967295)) (not (< (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) .cse15)))))) is different from false [2022-12-13 19:13:40,888 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 19:13:42,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:13:44,986 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse5 (mod c_~M~0 4294967296))) (and (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse2 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse0 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse1 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse4 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 4294967295))) (or (<= (+ .cse0 .cse1 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 .cse3)) (< 0 (+ .cse2 4294967295)) (<= .cse4 .cse0) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (>= aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296) (<= (+ .cse0 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296))) (<= .cse4 (+ .cse0 .cse1)) (<= .cse4 0))))) (or (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse5 (* 4294967296 (div (+ c_thread2Thread1of1ForFork1_~i~1 (- 4294967295)) 4294967296)) 4294967295)) (not (< (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) .cse5))) (or (not (< .cse3 .cse5)) (let ((.cse6 (- .cse5))) (and (or (< c_thread2Thread1of1ForFork1_~i~1 (+ (* 4294967296 (div (+ .cse6 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) 4294967296)) (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse5 (* (div (+ (- 8589934591) c_thread2Thread1of1ForFork1_~i~1) 4294967296) 4294967296) 8589934591))) (or (< c_thread2Thread1of1ForFork1_~i~1 (+ (* (div (+ (- 8589934590) c_thread2Thread1of1ForFork1_~i~1) 4294967296) 4294967296) .cse5 8589934590)) (< c_thread2Thread1of1ForFork1_~i~1 (+ 4294967295 (* (div (+ .cse6 c_thread2Thread1of1ForFork1_~i~1 1) 4294967296) 4294967296))))))))) is different from false [2022-12-13 19:13:53,850 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 19:13:55,858 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 19:13:57,906 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 19:13:59,919 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 19:14:01,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:14:04,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:14:06,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:14:08,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:14:10,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:14:12,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:14:14,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:14:16,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:14:18,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:14:25,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:14:27,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:14:30,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:14:32,813 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse0 (mod c_~M~0 4294967296))) (and (< (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) .cse0) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse3 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse1 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse2 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse5 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse3 4294967295))) (or (<= (+ .cse1 .cse2 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse3 .cse4)) (< 0 (+ .cse3 4294967295)) (<= .cse5 .cse1) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (>= aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296) (<= (+ .cse1 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse3 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296))) (<= .cse5 (+ .cse1 .cse2)) (<= .cse5 0))))) (or (not (< .cse4 .cse0)) (let ((.cse6 (- .cse0))) (and (or (< c_thread2Thread1of1ForFork1_~i~1 (+ (* 4294967296 (div (+ .cse6 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) 4294967296)) (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse0 (* (div (+ (- 8589934591) c_thread2Thread1of1ForFork1_~i~1) 4294967296) 4294967296) 8589934591))) (or (< c_thread2Thread1of1ForFork1_~i~1 (+ (* (div (+ (- 8589934590) c_thread2Thread1of1ForFork1_~i~1) 4294967296) 4294967296) .cse0 8589934590)) (< c_thread2Thread1of1ForFork1_~i~1 (+ 4294967295 (* (div (+ .cse6 c_thread2Thread1of1ForFork1_~i~1 1) 4294967296) 4294967296))))))))) is different from false [2022-12-13 19:14:34,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:14:36,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:14:39,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:15:38,514 WARN L233 SmtUtils]: Spent 28.01s on a formula simplification. DAG size of input: 66 DAG size of output: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:15:40,802 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse19 (* (div c_~M~0 4294967296) 4294967296)) (.cse11 (= c_thread2Thread1of1ForFork1_~i~1 0)) (.cse10 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse17 (* (div (+ (- 8589934591) c_thread2Thread1of1ForFork1_~i~1) 4294967296) 4294967296)) (.cse5 (* (div (+ (- 8589934590) c_thread2Thread1of1ForFork1_~i~1) 4294967296) 4294967296)) (.cse12 (mod c_~M~0 4294967296))) (and (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int)) (let ((.cse1 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse0 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse2 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse4 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse1 4294967295))) (or (<= (+ .cse0 1) (+ (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse1)) (< 0 (+ .cse1 4294967295)) (<= (+ .cse0 .cse2 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse1 .cse3)) (<= .cse4 .cse0) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (>= aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296) (<= .cse4 (+ .cse0 .cse2)) (<= .cse4 0))))) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse6 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse9 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse7 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse6 4294967295)) (.cse8 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296))) (or (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse5 8589934590 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) c_thread2Thread1of1ForFork1_~i~1 1) 4294967296))) (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse6 4294967295)) (<= .cse7 c_thread2Thread1of1ForFork1_~i~1) (<= (+ c_thread2Thread1of1ForFork1_~i~1 .cse8 .cse9 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse6 .cse10)) (<= .cse7 (+ c_thread2Thread1of1ForFork1_~i~1 .cse8 .cse9)) (<= (+ c_thread2Thread1of1ForFork1_~i~1 .cse8 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse6 .cse3)) (>= aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296) (<= .cse7 (+ c_thread2Thread1of1ForFork1_~i~1 .cse8)))))) (or (<= (+ c_thread2Thread1of1ForFork1_~i~1 1) c_thread1Thread1of1ForFork0_~i~0) .cse11) (< 2 .cse12) (or (<= 1 c_thread2Thread1of1ForFork1_~i~1) .cse11) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 Int)) (let ((.cse14 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 4294967296)) (.cse18 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296))) (let ((.cse13 (+ c_thread2Thread1of1ForFork1_~i~1 .cse18 (* 4294967296 aux_div_aux_mod_~M~0_21_32))) (.cse16 (+ c_thread2Thread1of1ForFork1_~i~1 .cse18)) (.cse15 (+ .cse14 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 4294967296))) (or (<= .cse13 (+ .cse14 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 .cse10)) (>= aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 4294967296) (<= .cse15 .cse16) (<= .cse15 .cse13) (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse17 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 4294967295) c_thread2Thread1of1ForFork1_~i~1) 4294967296) 8589934591)) (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse14 4294967296)) (<= .cse16 (+ .cse14 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 .cse3)) (<= .cse15 c_thread2Thread1of1ForFork1_~i~1))))) (or (<= (+ 2 .cse19) c_~M~0) (not .cse11)) (<= (div c_thread1Thread1of1ForFork0_~i~0 4294967296) 0) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse22 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse20 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse21 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse23 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse22 4294967295))) (or (<= (+ .cse20 .cse21 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse22 .cse10)) (< 0 (+ .cse22 4294967295)) (<= .cse23 .cse20) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (>= aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296) (<= (+ .cse20 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse22 .cse3)) (<= .cse23 (+ .cse20 .cse21)) (<= .cse23 0))))) (<= (+ .cse19 1) c_~M~0) (or (= c_thread2Thread1of1ForFork1_~i~1 1) .cse11) (or (not (< .cse10 .cse12)) (let ((.cse24 (- .cse12))) (and (or (< c_thread2Thread1of1ForFork1_~i~1 (+ (* 4294967296 (div (+ .cse24 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) 4294967296)) (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse12 .cse17 8589934591))) (or (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse5 .cse12 8589934590)) (< c_thread2Thread1of1ForFork1_~i~1 (+ 4294967295 (* (div (+ .cse24 c_thread2Thread1of1ForFork1_~i~1 1) 4294967296) 4294967296))))))))) is different from false [2022-12-13 19:15:42,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:15:45,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:16:27,170 WARN L233 SmtUtils]: Spent 13.99s on a formula simplification. DAG size of input: 50 DAG size of output: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:16:29,606 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse5 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse12 (* (div c_~M~0 4294967296) 4294967296)) (.cse6 (= c_thread2Thread1of1ForFork1_~i~1 0))) (and (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse0 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse3 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse1 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse0 4294967295)) (.cse2 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296))) (or (< c_thread2Thread1of1ForFork1_~i~1 (+ (* (div (+ (- 8589934590) c_thread2Thread1of1ForFork1_~i~1) 4294967296) 4294967296) 8589934590 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) c_thread2Thread1of1ForFork1_~i~1 1) 4294967296))) (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse0 4294967295)) (<= .cse1 c_thread2Thread1of1ForFork1_~i~1) (<= (+ c_thread2Thread1of1ForFork1_~i~1 .cse2 .cse3 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse0 .cse4)) (<= .cse1 (+ c_thread2Thread1of1ForFork1_~i~1 .cse2 .cse3)) (<= (+ c_thread2Thread1of1ForFork1_~i~1 .cse2 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse0 .cse5)) (>= aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296) (<= .cse1 (+ c_thread2Thread1of1ForFork1_~i~1 .cse2)))))) (or (<= (+ c_thread2Thread1of1ForFork1_~i~1 1) c_thread1Thread1of1ForFork0_~i~0) .cse6) (< 2 (mod c_~M~0 4294967296)) (or (<= 1 c_thread2Thread1of1ForFork1_~i~1) .cse6) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 Int)) (let ((.cse8 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 4294967296)) (.cse11 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296))) (let ((.cse7 (+ c_thread2Thread1of1ForFork1_~i~1 .cse11 (* 4294967296 aux_div_aux_mod_~M~0_21_32))) (.cse10 (+ c_thread2Thread1of1ForFork1_~i~1 .cse11)) (.cse9 (+ .cse8 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 4294967296))) (or (<= .cse7 (+ .cse8 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 .cse4)) (>= aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 4294967296) (<= .cse9 .cse10) (<= .cse9 .cse7) (< c_thread2Thread1of1ForFork1_~i~1 (+ (* (div (+ (- 8589934591) c_thread2Thread1of1ForFork1_~i~1) 4294967296) 4294967296) (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 4294967295) c_thread2Thread1of1ForFork1_~i~1) 4294967296) 8589934591)) (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse8 4294967296)) (<= .cse10 (+ .cse8 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 .cse5)) (<= .cse9 c_thread2Thread1of1ForFork1_~i~1))))) (or (<= (+ 2 .cse12) c_~M~0) (not .cse6)) (<= (div c_thread1Thread1of1ForFork0_~i~0 4294967296) 0) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse15 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse13 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse14 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse16 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse15 4294967295))) (or (<= (+ .cse13 .cse14 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse15 .cse4)) (< 0 (+ .cse15 4294967295)) (<= .cse16 .cse13) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (>= aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296) (<= (+ .cse13 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse15 .cse5)) (<= .cse16 (+ .cse13 .cse14)) (<= .cse16 0))))) (<= (+ .cse12 1) c_~M~0) (or (= c_thread2Thread1of1ForFork1_~i~1 1) .cse6))) is different from false [2022-12-13 19:16:31,812 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse2 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse0 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse1 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse3 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 4294967295))) (or (<= (+ .cse0 .cse1 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296))) (< 0 (+ .cse2 4294967295)) (<= .cse3 .cse0) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (>= aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296) (<= (+ .cse0 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296))) (<= .cse3 (+ .cse0 .cse1)) (<= .cse3 0))))) (let ((.cse4 (mod c_~M~0 4294967296))) (or (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse4 (* 4294967296 (div (+ c_thread2Thread1of1ForFork1_~i~1 (- 4294967295)) 4294967296)) 4294967295)) (not (< (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) .cse4))))) is different from false [2022-12-13 19:16:34,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:16:36,220 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse7 (* (div c_~M~0 4294967296) 4294967296)) (.cse5 (= c_thread2Thread1of1ForFork1_~i~1 0)) (.cse11 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse6 (mod c_~M~0 4294967296))) (and (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int)) (let ((.cse1 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse0 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse2 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse4 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse1 4294967295))) (or (<= (+ .cse0 1) (+ (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse1)) (< 0 (+ .cse1 4294967295)) (<= (+ .cse0 .cse2 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse1 .cse3)) (<= .cse4 .cse0) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (>= aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296) (<= .cse4 (+ .cse0 .cse2)) (<= .cse4 0))))) (or (<= (+ c_thread2Thread1of1ForFork1_~i~1 1) c_thread1Thread1of1ForFork0_~i~0) .cse5) (< 2 .cse6) (or (<= 1 c_thread2Thread1of1ForFork1_~i~1) .cse5) (or (<= (+ 2 .cse7) c_~M~0) (not .cse5)) (<= (div c_thread1Thread1of1ForFork0_~i~0 4294967296) 0) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse10 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse8 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse9 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse12 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse10 4294967295))) (or (<= (+ .cse8 .cse9 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse10 .cse11)) (< 0 (+ .cse10 4294967295)) (<= .cse12 .cse8) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (>= aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296) (<= (+ .cse8 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse10 .cse3)) (<= .cse12 (+ .cse8 .cse9)) (<= .cse12 0))))) (<= (+ .cse7 1) c_~M~0) (or (= c_thread2Thread1of1ForFork1_~i~1 1) .cse5) (or (not (< .cse11 .cse6)) (let ((.cse13 (- .cse6))) (and (or (< c_thread2Thread1of1ForFork1_~i~1 (+ (* 4294967296 (div (+ .cse13 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) 4294967296)) (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse6 (* (div (+ (- 8589934591) c_thread2Thread1of1ForFork1_~i~1) 4294967296) 4294967296) 8589934591))) (or (< c_thread2Thread1of1ForFork1_~i~1 (+ (* (div (+ (- 8589934590) c_thread2Thread1of1ForFork1_~i~1) 4294967296) 4294967296) .cse6 8589934590)) (< c_thread2Thread1of1ForFork1_~i~1 (+ 4294967295 (* (div (+ .cse13 c_thread2Thread1of1ForFork1_~i~1 1) 4294967296) 4294967296))))))))) is different from false [2022-12-13 19:16:38,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:16:40,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:17:12,206 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 19:17:14,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:17:16,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:17:18,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:17:21,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:17:23,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:17:25,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:17:27,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:17:56,119 WARN L233 SmtUtils]: Spent 7.90s on a formula simplification. DAG size of input: 59 DAG size of output: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:17:58,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:18:00,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:18:02,376 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296))) (and (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int)) (let ((.cse1 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse0 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse2 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse4 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse1 4294967295))) (or (<= (+ .cse0 1) (+ (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse1)) (< 0 (+ .cse1 4294967295)) (<= (+ .cse0 .cse2 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse1 .cse3)) (<= .cse4 .cse0) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (>= aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296) (<= .cse4 (+ .cse0 .cse2)) (<= .cse4 0))))) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse7 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse5 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse6 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse8 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse7 4294967295))) (or (<= (+ .cse5 .cse6 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse7 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296))) (< 0 (+ .cse7 4294967295)) (<= .cse8 .cse5) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (>= aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296) (<= (+ .cse5 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse7 .cse3)) (<= .cse8 (+ .cse5 .cse6)) (<= .cse8 0))))) (let ((.cse9 (mod c_~M~0 4294967296))) (or (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse9 (* 4294967296 (div (+ c_thread2Thread1of1ForFork1_~i~1 (- 4294967295)) 4294967296)) 4294967295)) (not (< (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) .cse9)))))) is different from false [2022-12-13 19:18:04,425 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296))) (and (<= (+ 2 c_thread2Thread1of1ForFork1_~i~1 (* (div c_~M~0 4294967296) 4294967296)) c_~M~0) (or (<= 1 c_thread2Thread1of1ForFork1_~i~1) (= c_thread2Thread1of1ForFork1_~i~1 0)) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse2 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse0 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse1 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse4 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 4294967295))) (or (<= (+ .cse0 .cse1 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 .cse3)) (< 0 (+ .cse2 4294967295)) (<= .cse4 .cse0) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (>= aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296) (<= (+ .cse0 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296))) (<= .cse4 (+ .cse0 .cse1)) (<= .cse4 0))))) (let ((.cse5 (mod c_~M~0 4294967296))) (or (not (< .cse3 .cse5)) (let ((.cse6 (- .cse5))) (and (or (< c_thread2Thread1of1ForFork1_~i~1 (+ (* 4294967296 (div (+ .cse6 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) 4294967296)) (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse5 (* (div (+ (- 8589934591) c_thread2Thread1of1ForFork1_~i~1) 4294967296) 4294967296) 8589934591))) (or (< c_thread2Thread1of1ForFork1_~i~1 (+ (* (div (+ (- 8589934590) c_thread2Thread1of1ForFork1_~i~1) 4294967296) 4294967296) .cse5 8589934590)) (< c_thread2Thread1of1ForFork1_~i~1 (+ 4294967295 (* (div (+ .cse6 c_thread2Thread1of1ForFork1_~i~1 1) 4294967296) 4294967296)))))))))) is different from false [2022-12-13 19:18:13,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:18:15,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:18:17,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:18:19,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:18:21,485 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296))) (and (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse2 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse0 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse1 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse4 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 4294967295))) (or (<= (+ .cse0 .cse1 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 .cse3)) (< 0 (+ .cse2 4294967295)) (<= .cse4 .cse0) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (>= aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296) (<= (+ .cse0 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296))) (<= .cse4 (+ .cse0 .cse1)) (<= .cse4 0))))) (let ((.cse5 (mod c_~M~0 4294967296))) (or (not (< .cse3 .cse5)) (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse5 (* 4294967296 (div (+ c_thread2Thread1of1ForFork1_~i~1 (- 4294967295)) 4294967296)) 4294967295)) (not (< (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) .cse5)))))) is different from false [2022-12-13 19:18:23,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:18:25,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:18:27,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:18:48,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:18:50,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:18:52,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:18:55,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:18:57,178 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (mod c_~M~0 4294967296))) (let ((.cse0 (< (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) .cse6)) (.cse4 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296))) (and .cse0 (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse3 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse1 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse2 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse5 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse3 4294967295))) (or (<= (+ .cse1 .cse2 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse3 .cse4)) (< 0 (+ .cse3 4294967295)) (<= .cse5 .cse1) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (>= aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296) (<= (+ .cse1 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse3 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296))) (<= .cse5 (+ .cse1 .cse2)) (<= .cse5 0))))) (or (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse6 (* 4294967296 (div (+ c_thread2Thread1of1ForFork1_~i~1 (- 4294967295)) 4294967296)) 4294967295)) (not .cse0)) (or (not (< .cse4 .cse6)) (let ((.cse7 (- .cse6))) (and (or (< c_thread2Thread1of1ForFork1_~i~1 (+ (* 4294967296 (div (+ .cse7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) 4294967296)) (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse6 (* (div (+ (- 8589934591) c_thread2Thread1of1ForFork1_~i~1) 4294967296) 4294967296) 8589934591))) (or (< c_thread2Thread1of1ForFork1_~i~1 (+ (* (div (+ (- 8589934590) c_thread2Thread1of1ForFork1_~i~1) 4294967296) 4294967296) .cse6 8589934590)) (< c_thread2Thread1of1ForFork1_~i~1 (+ 4294967295 (* (div (+ .cse7 c_thread2Thread1of1ForFork1_~i~1 1) 4294967296) 4294967296)))))))))) is different from false [2022-12-13 19:18:59,203 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 19:19:01,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:19:03,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:19:05,364 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 19:19:07,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:19:09,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:19:11,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:19:13,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:19:15,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:19:17,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:19:19,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:19:21,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:19:23,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:19:25,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:19:27,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:19:30,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:19:32,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:19:34,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:19:36,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:20:05,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:20:07,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:20:09,504 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 19:20:11,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 19:20:13,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:20:15,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:20:17,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:20:20,132 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse9 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse5 (mod c_~M~0 4294967296))) (and (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int)) (let ((.cse1 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse0 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse2 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse4 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse1 4294967295))) (or (<= (+ .cse0 1) (+ (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse1)) (< 0 (+ .cse1 4294967295)) (<= (+ .cse0 .cse2 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse1 .cse3)) (<= .cse4 .cse0) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (>= aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296) (<= .cse4 (+ .cse0 .cse2)) (<= .cse4 0))))) (or (= c_thread2Thread1of1ForFork1_~i~1 1) (= c_thread2Thread1of1ForFork1_~i~1 0) (= 2 c_thread2Thread1of1ForFork1_~i~1)) (< 2 .cse5) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse8 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse6 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse7 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse10 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse8 4294967295))) (or (<= (+ .cse6 .cse7 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse8 .cse9)) (< 0 (+ .cse8 4294967295)) (<= .cse10 .cse6) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (>= aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296) (<= (+ .cse6 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse8 .cse3)) (<= .cse10 (+ .cse6 .cse7)) (<= .cse10 0))))) (or (not (< .cse9 .cse5)) (let ((.cse11 (- .cse5))) (and (or (< c_thread2Thread1of1ForFork1_~i~1 (+ (* 4294967296 (div (+ .cse11 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) 4294967296)) (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse5 (* (div (+ (- 8589934591) c_thread2Thread1of1ForFork1_~i~1) 4294967296) 4294967296) 8589934591))) (or (< c_thread2Thread1of1ForFork1_~i~1 (+ (* (div (+ (- 8589934590) c_thread2Thread1of1ForFork1_~i~1) 4294967296) 4294967296) .cse5 8589934590)) (< c_thread2Thread1of1ForFork1_~i~1 (+ 4294967295 (* (div (+ .cse11 c_thread2Thread1of1ForFork1_~i~1 1) 4294967296) 4294967296))))))))) is different from false [2022-12-13 19:20:22,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:20:24,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:20:26,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:20:28,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:20:30,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:20:32,481 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* (div c_~M~0 4294967296) 4294967296)) (.cse0 (= c_thread2Thread1of1ForFork1_~i~1 0)) (.cse6 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse1 (mod c_~M~0 4294967296))) (and (or (<= (+ c_thread2Thread1of1ForFork1_~i~1 1) c_thread1Thread1of1ForFork0_~i~0) .cse0) (< 2 .cse1) (or (<= 1 c_thread2Thread1of1ForFork1_~i~1) .cse0) (or (<= (+ 2 .cse2) c_~M~0) (not .cse0)) (<= (div c_thread1Thread1of1ForFork0_~i~0 4294967296) 0) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse5 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse3 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse4 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse7 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse5 4294967295))) (or (<= (+ .cse3 .cse4 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse5 .cse6)) (< 0 (+ .cse5 4294967295)) (<= .cse7 .cse3) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (>= aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296) (<= (+ .cse3 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse5 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296))) (<= .cse7 (+ .cse3 .cse4)) (<= .cse7 0))))) (<= (+ .cse2 1) c_~M~0) (or (= c_thread2Thread1of1ForFork1_~i~1 1) .cse0) (or (not (< .cse6 .cse1)) (let ((.cse8 (- .cse1))) (and (or (< c_thread2Thread1of1ForFork1_~i~1 (+ (* 4294967296 (div (+ .cse8 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) 4294967296)) (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse1 (* (div (+ (- 8589934591) c_thread2Thread1of1ForFork1_~i~1) 4294967296) 4294967296) 8589934591))) (or (< c_thread2Thread1of1ForFork1_~i~1 (+ (* (div (+ (- 8589934590) c_thread2Thread1of1ForFork1_~i~1) 4294967296) 4294967296) .cse1 8589934590)) (< c_thread2Thread1of1ForFork1_~i~1 (+ 4294967295 (* (div (+ .cse8 c_thread2Thread1of1ForFork1_~i~1 1) 4294967296) 4294967296))))))))) is different from false [2022-12-13 19:20:34,500 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 19:20:36,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:20:38,550 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 19:20:51,425 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse5 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse12 (* (div (+ (- 8589934591) c_thread2Thread1of1ForFork1_~i~1) 4294967296) 4294967296)) (.cse0 (* (div (+ (- 8589934590) c_thread2Thread1of1ForFork1_~i~1) 4294967296) 4294967296)) (.cse7 (mod c_~M~0 4294967296))) (and (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse1 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse4 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse2 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse1 4294967295)) (.cse3 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296))) (or (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse0 8589934590 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) c_thread2Thread1of1ForFork1_~i~1 1) 4294967296))) (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse1 4294967295)) (<= .cse2 c_thread2Thread1of1ForFork1_~i~1) (<= (+ c_thread2Thread1of1ForFork1_~i~1 .cse3 .cse4 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse1 .cse5)) (<= .cse2 (+ c_thread2Thread1of1ForFork1_~i~1 .cse3 .cse4)) (<= (+ c_thread2Thread1of1ForFork1_~i~1 .cse3 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse1 .cse6)) (>= aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296) (<= .cse2 (+ c_thread2Thread1of1ForFork1_~i~1 .cse3)))))) (or (= c_thread2Thread1of1ForFork1_~i~1 1) (= c_thread2Thread1of1ForFork1_~i~1 0) (= 2 c_thread2Thread1of1ForFork1_~i~1)) (< 2 .cse7) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 Int)) (let ((.cse9 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 4294967296)) (.cse13 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296))) (let ((.cse8 (+ c_thread2Thread1of1ForFork1_~i~1 .cse13 (* 4294967296 aux_div_aux_mod_~M~0_21_32))) (.cse11 (+ c_thread2Thread1of1ForFork1_~i~1 .cse13)) (.cse10 (+ .cse9 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 4294967296))) (or (<= .cse8 (+ .cse9 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 .cse5)) (>= aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 4294967296) (<= .cse10 .cse11) (<= .cse10 .cse8) (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse12 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 4294967295) c_thread2Thread1of1ForFork1_~i~1) 4294967296) 8589934591)) (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse9 4294967296)) (<= .cse11 (+ .cse9 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_93 .cse6)) (<= .cse10 c_thread2Thread1of1ForFork1_~i~1))))) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse16 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse14 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse15 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse17 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse16 4294967295))) (or (<= (+ .cse14 .cse15 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse16 .cse5)) (< 0 (+ .cse16 4294967295)) (<= .cse17 .cse14) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (>= aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296) (<= (+ .cse14 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse16 .cse6)) (<= .cse17 (+ .cse14 .cse15)) (<= .cse17 0))))) (or (not (< .cse5 .cse7)) (let ((.cse18 (- .cse7))) (and (or (< c_thread2Thread1of1ForFork1_~i~1 (+ (* 4294967296 (div (+ .cse18 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) 4294967296)) (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse7 .cse12 8589934591))) (or (< c_thread2Thread1of1ForFork1_~i~1 (+ .cse0 .cse7 8589934590)) (< c_thread2Thread1of1ForFork1_~i~1 (+ 4294967295 (* (div (+ .cse18 c_thread2Thread1of1ForFork1_~i~1 1) 4294967296) 4294967296))))))))) is different from false [2022-12-13 19:21:27,741 WARN L233 SmtUtils]: Spent 15.11s on a formula simplification. DAG size of input: 51 DAG size of output: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:21:30,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:21:32,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:21:34,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:21:36,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:21:38,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:21:41,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:21:43,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:21:45,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:23:06,678 WARN L233 SmtUtils]: Spent 36.68s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)