./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/chl-word-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-word-trans.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 73462fb8dbdc39f07edabdd79150cbad579fbba379eb033cd2e89802bbb8b9a6 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 18:58:14,516 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 18:58:14,518 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 18:58:14,557 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 18:58:14,557 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 18:58:14,558 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 18:58:14,560 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 18:58:14,562 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 18:58:14,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 18:58:14,565 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 18:58:14,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 18:58:14,568 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 18:58:14,568 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 18:58:14,569 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 18:58:14,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 18:58:14,572 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 18:58:14,573 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 18:58:14,574 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 18:58:14,576 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 18:58:14,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 18:58:14,580 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 18:58:14,581 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 18:58:14,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 18:58:14,583 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 18:58:14,587 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 18:58:14,587 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 18:58:14,588 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 18:58:14,589 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 18:58:14,589 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 18:58:14,590 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 18:58:14,591 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 18:58:14,591 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 18:58:14,592 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 18:58:14,593 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 18:58:14,594 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 18:58:14,594 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 18:58:14,595 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 18:58:14,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 18:58:14,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 18:58:14,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 18:58:14,597 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 18:58:14,597 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 18:58:14,620 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 18:58:14,621 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 18:58:14,621 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 18:58:14,621 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 18:58:14,621 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 18:58:14,622 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 18:58:14,622 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 18:58:14,622 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 18:58:14,622 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 18:58:14,623 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 18:58:14,623 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 18:58:14,623 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 18:58:14,623 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 18:58:14,623 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 18:58:14,623 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 18:58:14,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 18:58:14,624 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 18:58:14,624 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 18:58:14,624 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 18:58:14,624 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 18:58:14,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 18:58:14,624 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 18:58:14,624 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 18:58:14,625 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 18:58:14,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 18:58:14,625 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 18:58:14,625 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 18:58:14,625 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 18:58:14,625 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 18:58:14,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 18:58:14,625 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 18:58:14,626 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 18:58:14,626 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 18:58:14,626 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 18:58:14,626 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/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_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa 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 ! call(reach_error())) ) 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 -> 73462fb8dbdc39f07edabdd79150cbad579fbba379eb033cd2e89802bbb8b9a6 [2021-12-06 18:58:14,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 18:58:14,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 18:58:14,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 18:58:14,826 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 18:58:14,826 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 18:58:14,827 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2021-12-06 18:58:14,867 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/data/298e9fdae/bef5ecf496a0418a96227f24c747c2f8/FLAG1e582e754 [2021-12-06 18:58:15,263 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 18:58:15,264 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2021-12-06 18:58:15,269 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/data/298e9fdae/bef5ecf496a0418a96227f24c747c2f8/FLAG1e582e754 [2021-12-06 18:58:15,278 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/data/298e9fdae/bef5ecf496a0418a96227f24c747c2f8 [2021-12-06 18:58:15,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 18:58:15,281 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 18:58:15,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 18:58:15,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 18:58:15,285 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 18:58:15,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:58:15" (1/1) ... [2021-12-06 18:58:15,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6148f50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:58:15, skipping insertion in model container [2021-12-06 18:58:15,286 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:58:15" (1/1) ... [2021-12-06 18:58:15,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 18:58:15,306 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 18:58:15,429 WARN L230 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_bf303163-74ea-49e5-9fc6-64748b62ddcc/sv-benchmarks/c/weaver/chl-word-trans.wvr.c[3292,3305] [2021-12-06 18:58:15,435 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 18:58:15,440 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 18:58:15,461 WARN L230 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_bf303163-74ea-49e5-9fc6-64748b62ddcc/sv-benchmarks/c/weaver/chl-word-trans.wvr.c[3292,3305] [2021-12-06 18:58:15,464 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 18:58:15,475 INFO L208 MainTranslator]: Completed translation [2021-12-06 18:58:15,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:58:15 WrapperNode [2021-12-06 18:58:15,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 18:58:15,476 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 18:58:15,477 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 18:58:15,477 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 18:58:15,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:58:15" (1/1) ... [2021-12-06 18:58:15,489 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:58:15" (1/1) ... [2021-12-06 18:58:15,508 INFO L137 Inliner]: procedures = 25, calls = 44, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 172 [2021-12-06 18:58:15,508 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 18:58:15,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 18:58:15,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 18:58:15,509 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 18:58:15,515 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:58:15" (1/1) ... [2021-12-06 18:58:15,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:58:15" (1/1) ... [2021-12-06 18:58:15,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:58:15" (1/1) ... [2021-12-06 18:58:15,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:58:15" (1/1) ... [2021-12-06 18:58:15,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:58:15" (1/1) ... [2021-12-06 18:58:15,532 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:58:15" (1/1) ... [2021-12-06 18:58:15,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:58:15" (1/1) ... [2021-12-06 18:58:15,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 18:58:15,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 18:58:15,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 18:58:15,538 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 18:58:15,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:58:15" (1/1) ... [2021-12-06 18:58:15,545 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 18:58:15,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:58:15,565 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 18:58:15,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 18:58:15,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 18:58:15,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-06 18:58:15,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 18:58:15,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-06 18:58:15,594 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-12-06 18:58:15,594 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-12-06 18:58:15,594 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-12-06 18:58:15,594 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-12-06 18:58:15,594 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-12-06 18:58:15,595 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-12-06 18:58:15,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 18:58:15,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-06 18:58:15,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 18:58:15,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 18:58:15,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 18:58:15,596 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-06 18:58:15,668 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 18:58:15,669 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 18:58:15,961 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 18:58:15,971 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 18:58:15,971 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-06 18:58:15,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:58:15 BoogieIcfgContainer [2021-12-06 18:58:15,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 18:58:15,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 18:58:15,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 18:58:15,976 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 18:58:15,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:58:15" (1/3) ... [2021-12-06 18:58:15,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@723fb9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:58:15, skipping insertion in model container [2021-12-06 18:58:15,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:58:15" (2/3) ... [2021-12-06 18:58:15,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@723fb9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:58:15, skipping insertion in model container [2021-12-06 18:58:15,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:58:15" (3/3) ... [2021-12-06 18:58:15,978 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-word-trans.wvr.c [2021-12-06 18:58:15,989 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-06 18:58:15,990 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 18:58:15,990 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 18:58:15,990 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-06 18:58:16,023 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~stop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,023 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~stop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,023 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,023 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,024 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,024 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,024 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,024 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,024 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,025 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,025 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,025 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,025 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~stop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,025 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~stop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,026 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~stop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,026 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~stop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,026 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,026 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,026 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,026 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,027 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,027 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,027 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,027 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,027 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,027 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,028 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,028 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,028 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,028 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,028 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,028 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,029 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,029 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,029 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,029 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,029 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,029 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,029 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,030 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,030 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,030 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,030 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,030 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,030 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,031 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,031 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,031 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,031 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,031 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,031 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,032 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,032 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,032 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,032 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,032 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,032 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,032 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,033 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,033 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,033 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,033 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,033 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,033 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,034 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,034 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,034 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,034 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,034 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,034 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,034 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,035 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,035 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,035 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,035 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,035 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,035 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,036 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,036 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,036 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,036 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,036 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,037 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,037 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,037 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,037 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,037 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~stop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,037 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~stop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,038 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~stop~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,038 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~stop~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,038 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,039 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,039 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,039 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,039 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,039 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,040 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,040 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,040 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,040 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,040 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~stop~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,040 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~stop~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,040 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~stop~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,041 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~stop~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,041 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,041 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,041 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,041 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,041 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,041 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,042 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,042 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,042 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,042 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,042 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,042 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,043 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,044 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,044 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,044 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,044 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,044 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,044 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,044 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,045 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,045 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,045 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,045 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,045 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,045 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,045 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,046 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,046 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,046 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,046 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,046 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,046 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,046 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,047 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,047 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,047 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,047 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,047 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,047 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,047 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,048 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,048 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,048 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,048 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,048 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,048 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,048 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,049 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,049 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,049 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,049 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,049 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,049 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,049 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,050 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,050 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,050 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,050 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,050 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,050 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,050 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,051 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,051 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,051 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~stop~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,051 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~stop~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,052 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~stop~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,052 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~stop~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,052 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,052 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,052 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,053 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,053 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,053 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,053 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,053 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,053 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,053 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,053 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~stop~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,054 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~stop~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,054 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~stop~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,054 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~stop~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,054 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,054 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,054 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,054 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,055 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,055 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,055 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,055 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,055 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,055 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,055 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,056 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,056 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,056 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,056 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,056 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,056 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,056 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,057 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,057 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,057 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,057 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,057 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,057 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,057 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,057 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,058 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,058 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,058 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,058 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,058 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,058 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,058 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,059 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,059 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,059 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,059 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,059 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,059 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,059 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,059 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,060 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,060 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,060 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,060 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,060 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,060 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,060 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,061 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,061 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,061 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,061 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,061 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,061 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,061 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,061 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,062 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,062 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,062 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,062 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,062 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,062 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,062 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,062 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,063 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,063 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,063 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,063 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,063 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,063 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,063 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~stop~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,063 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~stop~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,066 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,067 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,067 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,067 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,067 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,067 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~stop~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,067 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,068 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,068 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,068 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,068 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,071 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,071 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,071 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,071 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,071 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,072 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,072 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,072 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,072 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,072 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~stop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,072 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,073 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,073 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,073 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,073 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,074 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~stop~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,074 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,074 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,074 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,074 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,075 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,075 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:58:16,077 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-12-06 18:58:16,118 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 18:58:16,124 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 18:58:16,124 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-12-06 18:58:16,136 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 308 places, 332 transitions, 688 flow [2021-12-06 18:58:16,217 INFO L129 PetriNetUnfolder]: 34/329 cut-off events. [2021-12-06 18:58:16,217 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-06 18:58:16,222 INFO L84 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 329 events. 34/329 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 506 event pairs, 0 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 261. Up to 3 conditions per place. [2021-12-06 18:58:16,223 INFO L82 GeneralOperation]: Start removeDead. Operand has 308 places, 332 transitions, 688 flow [2021-12-06 18:58:16,230 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 294 places, 318 transitions, 654 flow [2021-12-06 18:58:16,280 INFO L129 PetriNetUnfolder]: 34/317 cut-off events. [2021-12-06 18:58:16,280 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-06 18:58:16,280 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:58:16,280 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:58:16,281 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 18:58:16,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:58:16,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1152647938, now seen corresponding path program 1 times [2021-12-06 18:58:16,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:58:16,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639532808] [2021-12-06 18:58:16,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:16,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:58:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:16,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:58:16,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:58:16,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639532808] [2021-12-06 18:58:16,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639532808] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:58:16,516 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:58:16,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 18:58:16,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019723247] [2021-12-06 18:58:16,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:58:16,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-06 18:58:16,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:58:16,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-06 18:58:16,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-06 18:58:16,551 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 332 [2021-12-06 18:58:16,556 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 318 transitions, 654 flow. Second operand has 2 states, 2 states have (on average 316.5) internal successors, (633), 2 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:16,556 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:58:16,556 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 332 [2021-12-06 18:58:16,557 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:58:16,635 INFO L129 PetriNetUnfolder]: 21/305 cut-off events. [2021-12-06 18:58:16,635 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-12-06 18:58:16,637 INFO L84 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 305 events. 21/305 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 505 event pairs, 0 based on Foata normal form. 19/296 useless extension candidates. Maximal degree in co-relation 252. Up to 7 conditions per place. [2021-12-06 18:58:16,640 INFO L132 encePairwiseOnDemand]: 319/332 looper letters, 6 selfloop transitions, 0 changer transitions 7/305 dead transitions. [2021-12-06 18:58:16,641 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 305 transitions, 640 flow [2021-12-06 18:58:16,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-06 18:58:16,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-12-06 18:58:16,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 643 transitions. [2021-12-06 18:58:16,657 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9683734939759037 [2021-12-06 18:58:16,658 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 643 transitions. [2021-12-06 18:58:16,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 643 transitions. [2021-12-06 18:58:16,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:58:16,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 643 transitions. [2021-12-06 18:58:16,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 321.5) internal successors, (643), 2 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:16,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 332.0) internal successors, (996), 3 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:16,679 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 332.0) internal successors, (996), 3 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:16,681 INFO L186 Difference]: Start difference. First operand has 294 places, 318 transitions, 654 flow. Second operand 2 states and 643 transitions. [2021-12-06 18:58:16,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 305 transitions, 640 flow [2021-12-06 18:58:16,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 305 transitions, 628 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-12-06 18:58:16,692 INFO L242 Difference]: Finished difference. Result has 289 places, 298 transitions, 602 flow [2021-12-06 18:58:16,695 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=602, PETRI_PLACES=289, PETRI_TRANSITIONS=298} [2021-12-06 18:58:16,698 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, -5 predicate places. [2021-12-06 18:58:16,698 INFO L470 AbstractCegarLoop]: Abstraction has has 289 places, 298 transitions, 602 flow [2021-12-06 18:58:16,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 316.5) internal successors, (633), 2 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:16,699 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:58:16,699 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:58:16,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 18:58:16,700 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 18:58:16,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:58:16,700 INFO L85 PathProgramCache]: Analyzing trace with hash 694363901, now seen corresponding path program 1 times [2021-12-06 18:58:16,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:58:16,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511881971] [2021-12-06 18:58:16,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:16,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:58:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:16,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:58:16,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:58:16,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511881971] [2021-12-06 18:58:16,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511881971] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:58:16,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:58:16,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 18:58:16,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560340699] [2021-12-06 18:58:16,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:58:16,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 18:58:16,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:58:16,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 18:58:16,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 18:58:16,874 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 332 [2021-12-06 18:58:16,875 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 298 transitions, 602 flow. Second operand has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:16,875 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:58:16,875 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 332 [2021-12-06 18:58:16,875 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:58:16,966 INFO L129 PetriNetUnfolder]: 40/413 cut-off events. [2021-12-06 18:58:16,966 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-12-06 18:58:16,968 INFO L84 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 413 events. 40/413 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1188 event pairs, 6 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 460. Up to 22 conditions per place. [2021-12-06 18:58:16,971 INFO L132 encePairwiseOnDemand]: 329/332 looper letters, 14 selfloop transitions, 2 changer transitions 0/304 dead transitions. [2021-12-06 18:58:16,971 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 304 transitions, 651 flow [2021-12-06 18:58:16,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 18:58:16,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-06 18:58:16,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 941 transitions. [2021-12-06 18:58:16,974 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9447791164658634 [2021-12-06 18:58:16,974 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 941 transitions. [2021-12-06 18:58:16,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 941 transitions. [2021-12-06 18:58:16,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:58:16,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 941 transitions. [2021-12-06 18:58:16,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 313.6666666666667) internal successors, (941), 3 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:16,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:16,982 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:16,982 INFO L186 Difference]: Start difference. First operand has 289 places, 298 transitions, 602 flow. Second operand 3 states and 941 transitions. [2021-12-06 18:58:16,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 304 transitions, 651 flow [2021-12-06 18:58:16,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 304 transitions, 651 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-06 18:58:16,988 INFO L242 Difference]: Finished difference. Result has 285 places, 298 transitions, 610 flow [2021-12-06 18:58:16,989 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=610, PETRI_PLACES=285, PETRI_TRANSITIONS=298} [2021-12-06 18:58:16,989 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, -9 predicate places. [2021-12-06 18:58:16,989 INFO L470 AbstractCegarLoop]: Abstraction has has 285 places, 298 transitions, 610 flow [2021-12-06 18:58:16,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:16,990 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:58:16,991 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:58:16,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 18:58:16,991 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 18:58:16,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:58:16,991 INFO L85 PathProgramCache]: Analyzing trace with hash -391066335, now seen corresponding path program 1 times [2021-12-06 18:58:16,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:58:16,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023111364] [2021-12-06 18:58:16,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:16,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:58:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:17,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:58:17,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:58:17,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023111364] [2021-12-06 18:58:17,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023111364] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:58:17,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:58:17,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 18:58:17,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816724813] [2021-12-06 18:58:17,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:58:17,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 18:58:17,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:58:17,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 18:58:17,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 18:58:17,076 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 332 [2021-12-06 18:58:17,077 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 298 transitions, 610 flow. Second operand has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:17,077 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:58:17,077 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 332 [2021-12-06 18:58:17,077 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:58:17,184 INFO L129 PetriNetUnfolder]: 49/489 cut-off events. [2021-12-06 18:58:17,184 INFO L130 PetriNetUnfolder]: For 21/25 co-relation queries the response was YES. [2021-12-06 18:58:17,187 INFO L84 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 489 events. 49/489 cut-off events. For 21/25 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1590 event pairs, 9 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 549. Up to 31 conditions per place. [2021-12-06 18:58:17,189 INFO L132 encePairwiseOnDemand]: 329/332 looper letters, 13 selfloop transitions, 2 changer transitions 0/303 dead transitions. [2021-12-06 18:58:17,189 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 303 transitions, 654 flow [2021-12-06 18:58:17,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 18:58:17,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-06 18:58:17,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 940 transitions. [2021-12-06 18:58:17,198 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9437751004016064 [2021-12-06 18:58:17,198 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 940 transitions. [2021-12-06 18:58:17,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 940 transitions. [2021-12-06 18:58:17,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:58:17,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 940 transitions. [2021-12-06 18:58:17,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:17,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:17,204 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:17,204 INFO L186 Difference]: Start difference. First operand has 285 places, 298 transitions, 610 flow. Second operand 3 states and 940 transitions. [2021-12-06 18:58:17,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 303 transitions, 654 flow [2021-12-06 18:58:17,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 303 transitions, 650 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-06 18:58:17,209 INFO L242 Difference]: Finished difference. Result has 286 places, 298 transitions, 614 flow [2021-12-06 18:58:17,210 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=614, PETRI_PLACES=286, PETRI_TRANSITIONS=298} [2021-12-06 18:58:17,210 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, -8 predicate places. [2021-12-06 18:58:17,210 INFO L470 AbstractCegarLoop]: Abstraction has has 286 places, 298 transitions, 614 flow [2021-12-06 18:58:17,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:17,211 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:58:17,212 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:58:17,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 18:58:17,212 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 18:58:17,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:58:17,212 INFO L85 PathProgramCache]: Analyzing trace with hash -453812997, now seen corresponding path program 1 times [2021-12-06 18:58:17,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:58:17,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648503760] [2021-12-06 18:58:17,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:17,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:58:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:17,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:58:17,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:58:17,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648503760] [2021-12-06 18:58:17,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648503760] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:58:17,298 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:58:17,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 18:58:17,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935427032] [2021-12-06 18:58:17,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:58:17,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 18:58:17,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:58:17,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 18:58:17,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 18:58:17,301 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 332 [2021-12-06 18:58:17,302 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 298 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:17,302 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:58:17,303 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 332 [2021-12-06 18:58:17,303 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:58:17,380 INFO L129 PetriNetUnfolder]: 54/498 cut-off events. [2021-12-06 18:58:17,381 INFO L130 PetriNetUnfolder]: For 45/57 co-relation queries the response was YES. [2021-12-06 18:58:17,382 INFO L84 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 498 events. 54/498 cut-off events. For 45/57 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1762 event pairs, 14 based on Foata normal form. 0/458 useless extension candidates. Maximal degree in co-relation 589. Up to 53 conditions per place. [2021-12-06 18:58:17,385 INFO L132 encePairwiseOnDemand]: 329/332 looper letters, 12 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2021-12-06 18:58:17,385 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 302 transitions, 653 flow [2021-12-06 18:58:17,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 18:58:17,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-06 18:58:17,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 939 transitions. [2021-12-06 18:58:17,387 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9427710843373494 [2021-12-06 18:58:17,387 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 939 transitions. [2021-12-06 18:58:17,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 939 transitions. [2021-12-06 18:58:17,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:58:17,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 939 transitions. [2021-12-06 18:58:17,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 313.0) internal successors, (939), 3 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:17,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:17,393 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:17,393 INFO L186 Difference]: Start difference. First operand has 286 places, 298 transitions, 614 flow. Second operand 3 states and 939 transitions. [2021-12-06 18:58:17,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 302 transitions, 653 flow [2021-12-06 18:58:17,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 302 transitions, 649 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-06 18:58:17,399 INFO L242 Difference]: Finished difference. Result has 287 places, 298 transitions, 618 flow [2021-12-06 18:58:17,399 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=618, PETRI_PLACES=287, PETRI_TRANSITIONS=298} [2021-12-06 18:58:17,400 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, -7 predicate places. [2021-12-06 18:58:17,400 INFO L470 AbstractCegarLoop]: Abstraction has has 287 places, 298 transitions, 618 flow [2021-12-06 18:58:17,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:17,401 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:58:17,401 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:58:17,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 18:58:17,401 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 18:58:17,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:58:17,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1308435147, now seen corresponding path program 1 times [2021-12-06 18:58:17,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:58:17,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672617407] [2021-12-06 18:58:17,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:17,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:58:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:17,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:58:17,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:58:17,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672617407] [2021-12-06 18:58:17,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672617407] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:58:17,640 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:58:17,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-06 18:58:17,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108132948] [2021-12-06 18:58:17,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:58:17,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-06 18:58:17,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:58:17,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-06 18:58:17,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2021-12-06 18:58:17,649 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 332 [2021-12-06 18:58:17,655 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 298 transitions, 618 flow. Second operand has 15 states, 15 states have (on average 230.4) internal successors, (3456), 15 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:17,655 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:58:17,655 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 332 [2021-12-06 18:58:17,655 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:58:19,009 INFO L129 PetriNetUnfolder]: 1854/7062 cut-off events. [2021-12-06 18:58:19,009 INFO L130 PetriNetUnfolder]: For 398/398 co-relation queries the response was YES. [2021-12-06 18:58:19,038 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10152 conditions, 7062 events. 1854/7062 cut-off events. For 398/398 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 70782 event pairs, 898 based on Foata normal form. 8/6074 useless extension candidates. Maximal degree in co-relation 10145. Up to 1205 conditions per place. [2021-12-06 18:58:19,077 INFO L132 encePairwiseOnDemand]: 311/332 looper letters, 128 selfloop transitions, 20 changer transitions 8/369 dead transitions. [2021-12-06 18:58:19,078 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 369 transitions, 1085 flow [2021-12-06 18:58:19,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-06 18:58:19,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-12-06 18:58:19,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4677 transitions. [2021-12-06 18:58:19,090 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.704367469879518 [2021-12-06 18:58:19,091 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 4677 transitions. [2021-12-06 18:58:19,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 4677 transitions. [2021-12-06 18:58:19,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:58:19,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 4677 transitions. [2021-12-06 18:58:19,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 233.85) internal successors, (4677), 20 states have internal predecessors, (4677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:19,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 332.0) internal successors, (6972), 21 states have internal predecessors, (6972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:19,134 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 332.0) internal successors, (6972), 21 states have internal predecessors, (6972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:19,134 INFO L186 Difference]: Start difference. First operand has 287 places, 298 transitions, 618 flow. Second operand 20 states and 4677 transitions. [2021-12-06 18:58:19,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 369 transitions, 1085 flow [2021-12-06 18:58:19,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 369 transitions, 1081 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-06 18:58:19,144 INFO L242 Difference]: Finished difference. Result has 310 places, 304 transitions, 690 flow [2021-12-06 18:58:19,145 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=690, PETRI_PLACES=310, PETRI_TRANSITIONS=304} [2021-12-06 18:58:19,146 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 16 predicate places. [2021-12-06 18:58:19,146 INFO L470 AbstractCegarLoop]: Abstraction has has 310 places, 304 transitions, 690 flow [2021-12-06 18:58:19,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 230.4) internal successors, (3456), 15 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:19,148 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:58:19,148 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:58:19,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 18:58:19,148 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 18:58:19,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:58:19,149 INFO L85 PathProgramCache]: Analyzing trace with hash 657718579, now seen corresponding path program 2 times [2021-12-06 18:58:19,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:58:19,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549698359] [2021-12-06 18:58:19,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:19,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:58:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:19,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:58:19,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:58:19,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549698359] [2021-12-06 18:58:19,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549698359] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:58:19,344 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:58:19,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-06 18:58:19,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214633937] [2021-12-06 18:58:19,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:58:19,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-06 18:58:19,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:58:19,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-06 18:58:19,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-12-06 18:58:19,348 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 332 [2021-12-06 18:58:19,350 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 304 transitions, 690 flow. Second operand has 14 states, 14 states have (on average 235.5) internal successors, (3297), 14 states have internal predecessors, (3297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:19,351 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:58:19,351 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 332 [2021-12-06 18:58:19,351 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:58:21,142 INFO L129 PetriNetUnfolder]: 2738/11876 cut-off events. [2021-12-06 18:58:21,143 INFO L130 PetriNetUnfolder]: For 2141/2301 co-relation queries the response was YES. [2021-12-06 18:58:21,188 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18059 conditions, 11876 events. 2738/11876 cut-off events. For 2141/2301 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 137211 event pairs, 838 based on Foata normal form. 34/10397 useless extension candidates. Maximal degree in co-relation 18046. Up to 1406 conditions per place. [2021-12-06 18:58:21,221 INFO L132 encePairwiseOnDemand]: 309/332 looper letters, 150 selfloop transitions, 27 changer transitions 5/400 dead transitions. [2021-12-06 18:58:21,221 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 400 transitions, 1333 flow [2021-12-06 18:58:21,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-06 18:58:21,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-12-06 18:58:21,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4787 transitions. [2021-12-06 18:58:21,231 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.720933734939759 [2021-12-06 18:58:21,231 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 4787 transitions. [2021-12-06 18:58:21,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 4787 transitions. [2021-12-06 18:58:21,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:58:21,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 4787 transitions. [2021-12-06 18:58:21,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 239.35) internal successors, (4787), 20 states have internal predecessors, (4787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:21,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 332.0) internal successors, (6972), 21 states have internal predecessors, (6972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:21,256 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 332.0) internal successors, (6972), 21 states have internal predecessors, (6972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:21,256 INFO L186 Difference]: Start difference. First operand has 310 places, 304 transitions, 690 flow. Second operand 20 states and 4787 transitions. [2021-12-06 18:58:21,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 400 transitions, 1333 flow [2021-12-06 18:58:21,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 400 transitions, 1297 flow, removed 5 selfloop flow, removed 11 redundant places. [2021-12-06 18:58:21,272 INFO L242 Difference]: Finished difference. Result has 328 places, 320 transitions, 827 flow [2021-12-06 18:58:21,272 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=827, PETRI_PLACES=328, PETRI_TRANSITIONS=320} [2021-12-06 18:58:21,273 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 34 predicate places. [2021-12-06 18:58:21,273 INFO L470 AbstractCegarLoop]: Abstraction has has 328 places, 320 transitions, 827 flow [2021-12-06 18:58:21,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 235.5) internal successors, (3297), 14 states have internal predecessors, (3297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:21,275 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:58:21,275 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:58:21,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 18:58:21,275 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 18:58:21,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:58:21,275 INFO L85 PathProgramCache]: Analyzing trace with hash 21394965, now seen corresponding path program 1 times [2021-12-06 18:58:21,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:58:21,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936185398] [2021-12-06 18:58:21,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:21,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:58:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:21,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:58:21,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:58:21,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936185398] [2021-12-06 18:58:21,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936185398] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:58:21,340 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:58:21,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 18:58:21,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265209253] [2021-12-06 18:58:21,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:58:21,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 18:58:21,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:58:21,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 18:58:21,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 18:58:21,342 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 332 [2021-12-06 18:58:21,344 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 320 transitions, 827 flow. Second operand has 6 states, 6 states have (on average 276.3333333333333) internal successors, (1658), 6 states have internal predecessors, (1658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:21,344 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:58:21,344 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 332 [2021-12-06 18:58:21,344 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:58:21,874 INFO L129 PetriNetUnfolder]: 535/3325 cut-off events. [2021-12-06 18:58:21,874 INFO L130 PetriNetUnfolder]: For 1175/1294 co-relation queries the response was YES. [2021-12-06 18:58:21,890 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5465 conditions, 3325 events. 535/3325 cut-off events. For 1175/1294 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 32447 event pairs, 252 based on Foata normal form. 46/3032 useless extension candidates. Maximal degree in co-relation 5442. Up to 1062 conditions per place. [2021-12-06 18:58:21,898 INFO L132 encePairwiseOnDemand]: 326/332 looper letters, 47 selfloop transitions, 3 changer transitions 7/332 dead transitions. [2021-12-06 18:58:21,898 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 332 transitions, 978 flow [2021-12-06 18:58:21,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 18:58:21,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-06 18:58:21,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1944 transitions. [2021-12-06 18:58:21,902 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8364888123924269 [2021-12-06 18:58:21,902 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1944 transitions. [2021-12-06 18:58:21,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1944 transitions. [2021-12-06 18:58:21,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:58:21,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1944 transitions. [2021-12-06 18:58:21,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 277.7142857142857) internal successors, (1944), 7 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:21,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:21,910 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:21,910 INFO L186 Difference]: Start difference. First operand has 328 places, 320 transitions, 827 flow. Second operand 7 states and 1944 transitions. [2021-12-06 18:58:21,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 332 transitions, 978 flow [2021-12-06 18:58:21,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 332 transitions, 964 flow, removed 3 selfloop flow, removed 5 redundant places. [2021-12-06 18:58:21,919 INFO L242 Difference]: Finished difference. Result has 332 places, 322 transitions, 840 flow [2021-12-06 18:58:21,920 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=840, PETRI_PLACES=332, PETRI_TRANSITIONS=322} [2021-12-06 18:58:21,920 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 38 predicate places. [2021-12-06 18:58:21,920 INFO L470 AbstractCegarLoop]: Abstraction has has 332 places, 322 transitions, 840 flow [2021-12-06 18:58:21,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 276.3333333333333) internal successors, (1658), 6 states have internal predecessors, (1658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:21,921 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:58:21,921 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:58:21,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 18:58:21,921 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 18:58:21,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:58:21,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1011075523, now seen corresponding path program 1 times [2021-12-06 18:58:21,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:58:21,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820630170] [2021-12-06 18:58:21,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:21,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:58:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:21,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:58:21,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:58:21,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820630170] [2021-12-06 18:58:21,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820630170] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:58:21,966 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:58:21,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:58:21,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388619250] [2021-12-06 18:58:21,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:58:21,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:58:21,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:58:21,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:58:21,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:58:21,968 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2021-12-06 18:58:21,969 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 322 transitions, 840 flow. Second operand has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:21,969 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:58:21,969 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2021-12-06 18:58:21,969 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:58:23,949 INFO L129 PetriNetUnfolder]: 2446/15676 cut-off events. [2021-12-06 18:58:23,949 INFO L130 PetriNetUnfolder]: For 1988/2131 co-relation queries the response was YES. [2021-12-06 18:58:24,078 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22685 conditions, 15676 events. 2446/15676 cut-off events. For 1988/2131 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 207348 event pairs, 1036 based on Foata normal form. 33/13521 useless extension candidates. Maximal degree in co-relation 22659. Up to 1975 conditions per place. [2021-12-06 18:58:24,109 INFO L132 encePairwiseOnDemand]: 323/332 looper letters, 50 selfloop transitions, 8 changer transitions 2/358 dead transitions. [2021-12-06 18:58:24,109 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 358 transitions, 1044 flow [2021-12-06 18:58:24,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:58:24,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-06 18:58:24,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1534 transitions. [2021-12-06 18:58:24,113 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9240963855421687 [2021-12-06 18:58:24,113 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1534 transitions. [2021-12-06 18:58:24,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1534 transitions. [2021-12-06 18:58:24,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:58:24,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1534 transitions. [2021-12-06 18:58:24,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 306.8) internal successors, (1534), 5 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) [2021-12-06 18:58:24,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:24,119 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:24,119 INFO L186 Difference]: Start difference. First operand has 332 places, 322 transitions, 840 flow. Second operand 5 states and 1534 transitions. [2021-12-06 18:58:24,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 358 transitions, 1044 flow [2021-12-06 18:58:24,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 358 transitions, 1039 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-12-06 18:58:24,186 INFO L242 Difference]: Finished difference. Result has 334 places, 330 transitions, 901 flow [2021-12-06 18:58:24,187 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=901, PETRI_PLACES=334, PETRI_TRANSITIONS=330} [2021-12-06 18:58:24,187 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 40 predicate places. [2021-12-06 18:58:24,188 INFO L470 AbstractCegarLoop]: Abstraction has has 334 places, 330 transitions, 901 flow [2021-12-06 18:58:24,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:24,188 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:58:24,188 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:58:24,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 18:58:24,189 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 18:58:24,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:58:24,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1397619985, now seen corresponding path program 2 times [2021-12-06 18:58:24,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:58:24,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170608941] [2021-12-06 18:58:24,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:24,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:58:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:24,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:58:24,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:58:24,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170608941] [2021-12-06 18:58:24,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170608941] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:58:24,235 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:58:24,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:58:24,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14315590] [2021-12-06 18:58:24,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:58:24,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:58:24,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:58:24,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:58:24,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:58:24,238 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2021-12-06 18:58:24,238 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 330 transitions, 901 flow. Second operand has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:24,238 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:58:24,238 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2021-12-06 18:58:24,238 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:58:27,216 INFO L129 PetriNetUnfolder]: 3414/22884 cut-off events. [2021-12-06 18:58:27,216 INFO L130 PetriNetUnfolder]: For 4132/4293 co-relation queries the response was YES. [2021-12-06 18:58:27,321 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33180 conditions, 22884 events. 3414/22884 cut-off events. For 4132/4293 co-relation queries the response was YES. Maximal size of possible extension queue 904. Compared 329915 event pairs, 784 based on Foata normal form. 94/21163 useless extension candidates. Maximal degree in co-relation 33153. Up to 1620 conditions per place. [2021-12-06 18:58:27,363 INFO L132 encePairwiseOnDemand]: 323/332 looper letters, 53 selfloop transitions, 16 changer transitions 5/372 dead transitions. [2021-12-06 18:58:27,363 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 372 transitions, 1207 flow [2021-12-06 18:58:27,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:58:27,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-06 18:58:27,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1534 transitions. [2021-12-06 18:58:27,366 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9240963855421687 [2021-12-06 18:58:27,366 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1534 transitions. [2021-12-06 18:58:27,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1534 transitions. [2021-12-06 18:58:27,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:58:27,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1534 transitions. [2021-12-06 18:58:27,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 306.8) internal successors, (1534), 5 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) [2021-12-06 18:58:27,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:27,372 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:27,372 INFO L186 Difference]: Start difference. First operand has 334 places, 330 transitions, 901 flow. Second operand 5 states and 1534 transitions. [2021-12-06 18:58:27,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 372 transitions, 1207 flow [2021-12-06 18:58:27,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 372 transitions, 1207 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-06 18:58:27,446 INFO L242 Difference]: Finished difference. Result has 341 places, 343 transitions, 1045 flow [2021-12-06 18:58:27,447 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1045, PETRI_PLACES=341, PETRI_TRANSITIONS=343} [2021-12-06 18:58:27,447 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 47 predicate places. [2021-12-06 18:58:27,448 INFO L470 AbstractCegarLoop]: Abstraction has has 341 places, 343 transitions, 1045 flow [2021-12-06 18:58:27,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:27,448 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:58:27,448 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:58:27,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 18:58:27,448 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 18:58:27,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:58:27,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1000769613, now seen corresponding path program 3 times [2021-12-06 18:58:27,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:58:27,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031091534] [2021-12-06 18:58:27,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:27,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:58:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:27,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:58:27,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:58:27,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031091534] [2021-12-06 18:58:27,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031091534] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:58:27,487 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:58:27,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:58:27,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348516706] [2021-12-06 18:58:27,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:58:27,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:58:27,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:58:27,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:58:27,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:58:27,489 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2021-12-06 18:58:27,490 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 343 transitions, 1045 flow. Second operand has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:27,490 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:58:27,490 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2021-12-06 18:58:27,490 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:58:30,179 INFO L129 PetriNetUnfolder]: 2961/21481 cut-off events. [2021-12-06 18:58:30,179 INFO L130 PetriNetUnfolder]: For 10353/10813 co-relation queries the response was YES. [2021-12-06 18:58:30,305 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34174 conditions, 21481 events. 2961/21481 cut-off events. For 10353/10813 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 310236 event pairs, 700 based on Foata normal form. 66/20125 useless extension candidates. Maximal degree in co-relation 34143. Up to 1546 conditions per place. [2021-12-06 18:58:30,344 INFO L132 encePairwiseOnDemand]: 324/332 looper letters, 63 selfloop transitions, 14 changer transitions 10/385 dead transitions. [2021-12-06 18:58:30,344 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 385 transitions, 1440 flow [2021-12-06 18:58:30,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:58:30,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-06 18:58:30,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1533 transitions. [2021-12-06 18:58:30,348 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9234939759036145 [2021-12-06 18:58:30,348 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1533 transitions. [2021-12-06 18:58:30,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1533 transitions. [2021-12-06 18:58:30,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:58:30,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1533 transitions. [2021-12-06 18:58:30,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 306.6) internal successors, (1533), 5 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:30,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:30,353 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:30,353 INFO L186 Difference]: Start difference. First operand has 341 places, 343 transitions, 1045 flow. Second operand 5 states and 1533 transitions. [2021-12-06 18:58:30,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 385 transitions, 1440 flow [2021-12-06 18:58:30,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 385 transitions, 1424 flow, removed 8 selfloop flow, removed 0 redundant places. [2021-12-06 18:58:30,414 INFO L242 Difference]: Finished difference. Result has 349 places, 347 transitions, 1139 flow [2021-12-06 18:58:30,415 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1139, PETRI_PLACES=349, PETRI_TRANSITIONS=347} [2021-12-06 18:58:30,415 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 55 predicate places. [2021-12-06 18:58:30,415 INFO L470 AbstractCegarLoop]: Abstraction has has 349 places, 347 transitions, 1139 flow [2021-12-06 18:58:30,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:30,416 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:58:30,416 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:58:30,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 18:58:30,416 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 18:58:30,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:58:30,416 INFO L85 PathProgramCache]: Analyzing trace with hash -251181307, now seen corresponding path program 1 times [2021-12-06 18:58:30,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:58:30,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899487829] [2021-12-06 18:58:30,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:30,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:58:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:30,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:58:30,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:58:30,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899487829] [2021-12-06 18:58:30,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899487829] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:58:30,483 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:58:30,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 18:58:30,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319723108] [2021-12-06 18:58:30,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:58:30,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 18:58:30,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:58:30,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 18:58:30,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 18:58:30,485 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 332 [2021-12-06 18:58:30,486 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 347 transitions, 1139 flow. Second operand has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:30,486 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:58:30,487 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 332 [2021-12-06 18:58:30,487 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:58:36,485 INFO L129 PetriNetUnfolder]: 11086/40097 cut-off events. [2021-12-06 18:58:36,485 INFO L130 PetriNetUnfolder]: For 24901/27845 co-relation queries the response was YES. [2021-12-06 18:58:36,782 INFO L84 FinitePrefix]: Finished finitePrefix Result has 77071 conditions, 40097 events. 11086/40097 cut-off events. For 24901/27845 co-relation queries the response was YES. Maximal size of possible extension queue 2048. Compared 577971 event pairs, 5119 based on Foata normal form. 902/38316 useless extension candidates. Maximal degree in co-relation 77036. Up to 13781 conditions per place. [2021-12-06 18:58:36,877 INFO L132 encePairwiseOnDemand]: 318/332 looper letters, 74 selfloop transitions, 28 changer transitions 4/394 dead transitions. [2021-12-06 18:58:36,878 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 394 transitions, 1549 flow [2021-12-06 18:58:36,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 18:58:36,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-06 18:58:36,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1916 transitions. [2021-12-06 18:58:36,882 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8244406196213425 [2021-12-06 18:58:36,882 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1916 transitions. [2021-12-06 18:58:36,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1916 transitions. [2021-12-06 18:58:36,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:58:36,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1916 transitions. [2021-12-06 18:58:36,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 273.7142857142857) internal successors, (1916), 7 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:36,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:36,890 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:36,890 INFO L186 Difference]: Start difference. First operand has 349 places, 347 transitions, 1139 flow. Second operand 7 states and 1916 transitions. [2021-12-06 18:58:36,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 394 transitions, 1549 flow [2021-12-06 18:58:37,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 394 transitions, 1545 flow, removed 2 selfloop flow, removed 0 redundant places. [2021-12-06 18:58:37,112 INFO L242 Difference]: Finished difference. Result has 360 places, 372 transitions, 1396 flow [2021-12-06 18:58:37,112 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1396, PETRI_PLACES=360, PETRI_TRANSITIONS=372} [2021-12-06 18:58:37,113 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 66 predicate places. [2021-12-06 18:58:37,113 INFO L470 AbstractCegarLoop]: Abstraction has has 360 places, 372 transitions, 1396 flow [2021-12-06 18:58:37,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:37,113 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:58:37,113 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:58:37,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 18:58:37,114 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 18:58:37,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:58:37,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1558383555, now seen corresponding path program 2 times [2021-12-06 18:58:37,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:58:37,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033780834] [2021-12-06 18:58:37,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:37,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:58:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:37,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:58:37,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:58:37,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033780834] [2021-12-06 18:58:37,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033780834] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:58:37,187 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:58:37,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 18:58:37,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124307880] [2021-12-06 18:58:37,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:58:37,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 18:58:37,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:58:37,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 18:58:37,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 18:58:37,191 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 332 [2021-12-06 18:58:37,192 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 372 transitions, 1396 flow. Second operand has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:37,192 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:58:37,192 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 332 [2021-12-06 18:58:37,193 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:58:43,480 INFO L129 PetriNetUnfolder]: 11116/40369 cut-off events. [2021-12-06 18:58:43,481 INFO L130 PetriNetUnfolder]: For 64590/76461 co-relation queries the response was YES. [2021-12-06 18:58:43,807 INFO L84 FinitePrefix]: Finished finitePrefix Result has 98980 conditions, 40369 events. 11116/40369 cut-off events. For 64590/76461 co-relation queries the response was YES. Maximal size of possible extension queue 2081. Compared 584882 event pairs, 4963 based on Foata normal form. 2158/39912 useless extension candidates. Maximal degree in co-relation 98939. Up to 11666 conditions per place. [2021-12-06 18:58:43,896 INFO L132 encePairwiseOnDemand]: 324/332 looper letters, 118 selfloop transitions, 6 changer transitions 4/416 dead transitions. [2021-12-06 18:58:43,896 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 416 transitions, 1980 flow [2021-12-06 18:58:43,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 18:58:43,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-12-06 18:58:43,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2177 transitions. [2021-12-06 18:58:43,900 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8196536144578314 [2021-12-06 18:58:43,900 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2177 transitions. [2021-12-06 18:58:43,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2177 transitions. [2021-12-06 18:58:43,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:58:43,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2177 transitions. [2021-12-06 18:58:43,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 272.125) internal successors, (2177), 8 states have internal predecessors, (2177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:43,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 332.0) internal successors, (2988), 9 states have internal predecessors, (2988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:43,908 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 332.0) internal successors, (2988), 9 states have internal predecessors, (2988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:43,908 INFO L186 Difference]: Start difference. First operand has 360 places, 372 transitions, 1396 flow. Second operand 8 states and 2177 transitions. [2021-12-06 18:58:43,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 416 transitions, 1980 flow [2021-12-06 18:58:44,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 416 transitions, 1970 flow, removed 5 selfloop flow, removed 2 redundant places. [2021-12-06 18:58:44,663 INFO L242 Difference]: Finished difference. Result has 366 places, 372 transitions, 1408 flow [2021-12-06 18:58:44,664 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1408, PETRI_PLACES=366, PETRI_TRANSITIONS=372} [2021-12-06 18:58:44,664 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 72 predicate places. [2021-12-06 18:58:44,664 INFO L470 AbstractCegarLoop]: Abstraction has has 366 places, 372 transitions, 1408 flow [2021-12-06 18:58:44,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:44,665 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:58:44,665 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:58:44,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 18:58:44,666 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 18:58:44,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:58:44,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1607924253, now seen corresponding path program 1 times [2021-12-06 18:58:44,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:58:44,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563288880] [2021-12-06 18:58:44,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:44,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:58:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:44,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:58:44,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:58:44,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563288880] [2021-12-06 18:58:44,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563288880] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:58:44,711 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:58:44,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:58:44,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705367455] [2021-12-06 18:58:44,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:58:44,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:58:44,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:58:44,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:58:44,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:58:44,714 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2021-12-06 18:58:44,715 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 372 transitions, 1408 flow. Second operand has 4 states, 4 states have (on average 298.25) internal successors, (1193), 4 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:44,715 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:58:44,715 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2021-12-06 18:58:44,715 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:58:49,894 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([930] thread3EXIT-->L125-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem39#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} AuxVars[] AssignedVars[][377], [Black: 500#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 499#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), Black: 321#(= thread2Thread1of1ForFork2_~stop~1 0), 479#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), Black: 326#(= thread3Thread1of1ForFork0_~stop~2 0), Black: 452#(and (= |thread3Thread1of1ForFork0_#t~ite21| 1) (= ~res3~0 1)), 345#(and (<= 0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 447#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 448#(= ~res3~0 1), 94#L125-2true, 534#true, Black: 519#(<= (+ ~res2~0 1) 0), Black: 529#(and (<= (+ ~res2~0 1) 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 527#(and (<= (+ ~res2~0 1) 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 466#(<= (+ ~count3~0 1) ~count1~0), Black: 465#(<= (+ ~count2~0 1) ~count1~0), Black: 468#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count3~0 1) ~count1~0)), Black: 477#(<= ~count1~0 ~count2~0), 463#true, Black: 476#(<= ~count1~0 ~count3~0), Black: 488#(<= (+ ~count3~0 1) ~count1~0), 311#true, Black: 485#true, Black: 490#(and (<= ~count3~0 ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), 497#true, Black: 395#(<= ~res1~0 0), 516#true, Black: 417#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 407#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 425#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), 487#(<= ~count3~0 ~count2~0), Black: 399#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 423#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 415#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 413#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~res1~0 0)), Black: 361#(and (<= 0 ~n1~0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))), Black: 419#(and (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 370#(and (<= 0 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 401#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 372#(and (<= ~res2~0 ~res3~0) (<= 0 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 316#(= thread1Thread1of1ForFork1_~stop~0 0), Black: 504#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0))]) [2021-12-06 18:58:49,895 INFO L384 tUnfolder$Statistics]: this new event has 222 ancestors and is not cut-off event [2021-12-06 18:58:49,895 INFO L387 tUnfolder$Statistics]: existing Event has 224 ancestors and is not cut-off event [2021-12-06 18:58:49,895 INFO L387 tUnfolder$Statistics]: existing Event has 223 ancestors and is not cut-off event [2021-12-06 18:58:49,895 INFO L387 tUnfolder$Statistics]: existing Event has 222 ancestors and is not cut-off event [2021-12-06 18:58:49,901 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([930] thread3EXIT-->L125-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem39#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} AuxVars[] AssignedVars[][377], [Black: 500#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 499#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), Black: 321#(= thread2Thread1of1ForFork2_~stop~1 0), 479#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), Black: 326#(= thread3Thread1of1ForFork0_~stop~2 0), Black: 452#(and (= |thread3Thread1of1ForFork0_#t~ite21| 1) (= ~res3~0 1)), Black: 447#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 448#(= ~res3~0 1), 94#L125-2true, 534#true, Black: 519#(<= (+ ~res2~0 1) 0), Black: 529#(and (<= (+ ~res2~0 1) 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 527#(and (<= (+ ~res2~0 1) 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 466#(<= (+ ~count3~0 1) ~count1~0), Black: 465#(<= (+ ~count2~0 1) ~count1~0), Black: 468#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count3~0 1) ~count1~0)), Black: 477#(<= ~count1~0 ~count2~0), 463#true, Black: 476#(<= ~count1~0 ~count3~0), Black: 488#(<= (+ ~count3~0 1) ~count1~0), 311#true, Black: 485#true, Black: 490#(and (<= ~count3~0 ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), 497#true, Black: 395#(<= ~res1~0 0), 516#true, Black: 417#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 407#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), 487#(<= ~count3~0 ~count2~0), Black: 425#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 399#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 423#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 415#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 413#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~res1~0 0)), Black: 361#(and (<= 0 ~n1~0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))), Black: 419#(and (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 370#(and (<= 0 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 401#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 372#(and (<= ~res2~0 ~res3~0) (<= 0 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 345#(and (<= 0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 316#(= thread1Thread1of1ForFork1_~stop~0 0), Black: 504#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0))]) [2021-12-06 18:58:49,901 INFO L384 tUnfolder$Statistics]: this new event has 229 ancestors and is not cut-off event [2021-12-06 18:58:49,901 INFO L387 tUnfolder$Statistics]: existing Event has 231 ancestors and is not cut-off event [2021-12-06 18:58:49,901 INFO L387 tUnfolder$Statistics]: existing Event has 230 ancestors and is not cut-off event [2021-12-06 18:58:49,901 INFO L387 tUnfolder$Statistics]: existing Event has 229 ancestors and is not cut-off event [2021-12-06 18:58:49,903 INFO L129 PetriNetUnfolder]: 5800/35774 cut-off events. [2021-12-06 18:58:49,903 INFO L130 PetriNetUnfolder]: For 33536/36818 co-relation queries the response was YES. [2021-12-06 18:58:50,244 INFO L84 FinitePrefix]: Finished finitePrefix Result has 70717 conditions, 35774 events. 5800/35774 cut-off events. For 33536/36818 co-relation queries the response was YES. Maximal size of possible extension queue 1475. Compared 563638 event pairs, 2283 based on Foata normal form. 414/33514 useless extension candidates. Maximal degree in co-relation 70674. Up to 4496 conditions per place. [2021-12-06 18:58:50,310 INFO L132 encePairwiseOnDemand]: 327/332 looper letters, 53 selfloop transitions, 3 changer transitions 9/388 dead transitions. [2021-12-06 18:58:50,310 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 388 transitions, 1604 flow [2021-12-06 18:58:50,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 18:58:50,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-06 18:58:50,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1220 transitions. [2021-12-06 18:58:50,313 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9186746987951807 [2021-12-06 18:58:50,313 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1220 transitions. [2021-12-06 18:58:50,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1220 transitions. [2021-12-06 18:58:50,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:58:50,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1220 transitions. [2021-12-06 18:58:50,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 305.0) internal successors, (1220), 4 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:50,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:50,317 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:50,317 INFO L186 Difference]: Start difference. First operand has 366 places, 372 transitions, 1408 flow. Second operand 4 states and 1220 transitions. [2021-12-06 18:58:50,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 388 transitions, 1604 flow [2021-12-06 18:58:50,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 388 transitions, 1595 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-12-06 18:58:50,934 INFO L242 Difference]: Finished difference. Result has 365 places, 372 transitions, 1416 flow [2021-12-06 18:58:50,935 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1399, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1416, PETRI_PLACES=365, PETRI_TRANSITIONS=372} [2021-12-06 18:58:50,935 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 71 predicate places. [2021-12-06 18:58:50,935 INFO L470 AbstractCegarLoop]: Abstraction has has 365 places, 372 transitions, 1416 flow [2021-12-06 18:58:50,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.25) internal successors, (1193), 4 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:50,936 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:58:50,936 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:58:50,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-06 18:58:50,936 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 18:58:50,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:58:50,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1575583207, now seen corresponding path program 2 times [2021-12-06 18:58:50,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:58:50,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993221506] [2021-12-06 18:58:50,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:50,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:58:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:50,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:58:50,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:58:50,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993221506] [2021-12-06 18:58:50,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993221506] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:58:50,970 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:58:50,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:58:50,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825068397] [2021-12-06 18:58:50,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:58:50,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:58:50,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:58:50,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:58:50,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:58:50,972 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2021-12-06 18:58:50,972 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 372 transitions, 1416 flow. Second operand has 4 states, 4 states have (on average 298.25) internal successors, (1193), 4 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:50,972 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:58:50,972 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2021-12-06 18:58:50,973 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:58:56,142 INFO L129 PetriNetUnfolder]: 5583/34351 cut-off events. [2021-12-06 18:58:56,142 INFO L130 PetriNetUnfolder]: For 33274/36455 co-relation queries the response was YES. [2021-12-06 18:58:56,422 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67471 conditions, 34351 events. 5583/34351 cut-off events. For 33274/36455 co-relation queries the response was YES. Maximal size of possible extension queue 1318. Compared 530379 event pairs, 1655 based on Foata normal form. 352/32231 useless extension candidates. Maximal degree in co-relation 67428. Up to 3987 conditions per place. [2021-12-06 18:58:56,470 INFO L132 encePairwiseOnDemand]: 327/332 looper letters, 51 selfloop transitions, 8 changer transitions 11/385 dead transitions. [2021-12-06 18:58:56,470 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 385 transitions, 1594 flow [2021-12-06 18:58:56,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 18:58:56,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-06 18:58:56,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1218 transitions. [2021-12-06 18:58:56,473 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9171686746987951 [2021-12-06 18:58:56,473 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1218 transitions. [2021-12-06 18:58:56,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1218 transitions. [2021-12-06 18:58:56,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:58:56,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1218 transitions. [2021-12-06 18:58:56,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 304.5) internal successors, (1218), 4 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:56,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:56,477 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:56,477 INFO L186 Difference]: Start difference. First operand has 365 places, 372 transitions, 1416 flow. Second operand 4 states and 1218 transitions. [2021-12-06 18:58:56,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 385 transitions, 1594 flow [2021-12-06 18:58:56,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 385 transitions, 1589 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-06 18:58:56,952 INFO L242 Difference]: Finished difference. Result has 367 places, 363 transitions, 1364 flow [2021-12-06 18:58:56,953 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1381, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1364, PETRI_PLACES=367, PETRI_TRANSITIONS=363} [2021-12-06 18:58:56,953 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 73 predicate places. [2021-12-06 18:58:56,954 INFO L470 AbstractCegarLoop]: Abstraction has has 367 places, 363 transitions, 1364 flow [2021-12-06 18:58:56,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.25) internal successors, (1193), 4 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:56,954 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:58:56,954 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:58:56,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 18:58:56,954 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 18:58:56,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:58:56,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1977769385, now seen corresponding path program 1 times [2021-12-06 18:58:56,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:58:56,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847528912] [2021-12-06 18:58:56,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:56,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:58:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:57,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:58:57,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:58:57,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847528912] [2021-12-06 18:58:57,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847528912] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:58:57,037 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:58:57,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 18:58:57,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914591885] [2021-12-06 18:58:57,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:58:57,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 18:58:57,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:58:57,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 18:58:57,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 18:58:57,041 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 332 [2021-12-06 18:58:57,042 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 363 transitions, 1364 flow. Second operand has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:58:57,042 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:58:57,042 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 332 [2021-12-06 18:58:57,042 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:59:03,020 INFO L129 PetriNetUnfolder]: 9174/38575 cut-off events. [2021-12-06 18:59:03,021 INFO L130 PetriNetUnfolder]: For 60369/70184 co-relation queries the response was YES. [2021-12-06 18:59:03,365 INFO L84 FinitePrefix]: Finished finitePrefix Result has 89927 conditions, 38575 events. 9174/38575 cut-off events. For 60369/70184 co-relation queries the response was YES. Maximal size of possible extension queue 1988. Compared 582820 event pairs, 4151 based on Foata normal form. 1399/37751 useless extension candidates. Maximal degree in co-relation 89883. Up to 11006 conditions per place. [2021-12-06 18:59:03,445 INFO L132 encePairwiseOnDemand]: 324/332 looper letters, 106 selfloop transitions, 7 changer transitions 14/416 dead transitions. [2021-12-06 18:59:03,445 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 416 transitions, 1939 flow [2021-12-06 18:59:03,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 18:59:03,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-12-06 18:59:03,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2178 transitions. [2021-12-06 18:59:03,449 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8200301204819277 [2021-12-06 18:59:03,449 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2178 transitions. [2021-12-06 18:59:03,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2178 transitions. [2021-12-06 18:59:03,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:59:03,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2178 transitions. [2021-12-06 18:59:03,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 272.25) internal successors, (2178), 8 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:03,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 332.0) internal successors, (2988), 9 states have internal predecessors, (2988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:03,456 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 332.0) internal successors, (2988), 9 states have internal predecessors, (2988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:03,456 INFO L186 Difference]: Start difference. First operand has 367 places, 363 transitions, 1364 flow. Second operand 8 states and 2178 transitions. [2021-12-06 18:59:03,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 416 transitions, 1939 flow [2021-12-06 18:59:03,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 416 transitions, 1933 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-06 18:59:03,889 INFO L242 Difference]: Finished difference. Result has 378 places, 367 transitions, 1425 flow [2021-12-06 18:59:03,889 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1358, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1425, PETRI_PLACES=378, PETRI_TRANSITIONS=367} [2021-12-06 18:59:03,889 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 84 predicate places. [2021-12-06 18:59:03,890 INFO L470 AbstractCegarLoop]: Abstraction has has 378 places, 367 transitions, 1425 flow [2021-12-06 18:59:03,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:03,890 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:59:03,890 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:59:03,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-06 18:59:03,890 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 18:59:03,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:59:03,890 INFO L85 PathProgramCache]: Analyzing trace with hash -2008830011, now seen corresponding path program 3 times [2021-12-06 18:59:03,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:59:03,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842881311] [2021-12-06 18:59:03,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:59:03,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:59:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:03,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:59:03,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:59:03,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842881311] [2021-12-06 18:59:03,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842881311] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:59:03,924 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:59:03,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:59:03,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409873256] [2021-12-06 18:59:03,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:59:03,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:59:03,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:59:03,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:59:03,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:59:03,926 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2021-12-06 18:59:03,927 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 367 transitions, 1425 flow. Second operand has 4 states, 4 states have (on average 298.25) internal successors, (1193), 4 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:03,927 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:59:03,927 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2021-12-06 18:59:03,927 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:59:08,649 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([930] thread3EXIT-->L125-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem39#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} AuxVars[] AssignedVars[][380], [Black: 500#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 499#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), 573#(<= (+ ~count3~0 1) ~count2~0), 479#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), Black: 326#(= thread3Thread1of1ForFork0_~stop~2 0), Black: 452#(and (= |thread3Thread1of1ForFork0_#t~ite21| 1) (= ~res3~0 1)), 345#(and (<= 0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 447#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 448#(= ~res3~0 1), 94#L125-2true, Black: 519#(<= (+ ~res2~0 1) 0), 551#true, Black: 466#(<= (+ ~count3~0 1) ~count1~0), Black: 465#(<= (+ ~count2~0 1) ~count1~0), Black: 468#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count3~0 1) ~count1~0)), Black: 536#(<= (+ ~count2~0 1) ~count1~0), Black: 539#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count2~0 1) ~count3~0)), Black: 477#(<= ~count1~0 ~count2~0), 463#true, Black: 476#(<= ~count1~0 ~count3~0), Black: 488#(<= (+ ~count3~0 1) ~count1~0), Black: 485#true, 311#true, Black: 490#(and (<= ~count3~0 ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), 497#true, Black: 395#(<= ~res1~0 0), Black: 417#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 407#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), 487#(<= ~count3~0 ~count2~0), Black: 425#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 399#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), 545#(<= ~count1~0 ~count3~0), Black: 553#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), Black: 562#(and (<= (+ ~res1~0 1) 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 423#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 554#(<= (+ ~res1~0 1) 0), Black: 415#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 559#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 413#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~res1~0 0)), Black: 361#(and (<= 0 ~n1~0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))), Black: 564#(and (<= (+ ~res1~0 1) 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 419#(and (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 370#(and (<= 0 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 401#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 372#(and (<= ~res2~0 ~res3~0) (<= 0 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 316#(= thread1Thread1of1ForFork1_~stop~0 0), Black: 504#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0))]) [2021-12-06 18:59:08,649 INFO L384 tUnfolder$Statistics]: this new event has 209 ancestors and is not cut-off event [2021-12-06 18:59:08,650 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is not cut-off event [2021-12-06 18:59:08,650 INFO L387 tUnfolder$Statistics]: existing Event has 209 ancestors and is not cut-off event [2021-12-06 18:59:08,650 INFO L387 tUnfolder$Statistics]: existing Event has 211 ancestors and is not cut-off event [2021-12-06 18:59:08,688 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([930] thread3EXIT-->L125-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem39#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} AuxVars[] AssignedVars[][380], [Black: 500#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 499#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), 573#(<= (+ ~count3~0 1) ~count2~0), Black: 326#(= thread3Thread1of1ForFork0_~stop~2 0), 479#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), Black: 452#(and (= |thread3Thread1of1ForFork0_#t~ite21| 1) (= ~res3~0 1)), Black: 447#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 448#(= ~res3~0 1), 94#L125-2true, Black: 519#(<= (+ ~res2~0 1) 0), 551#true, Black: 466#(<= (+ ~count3~0 1) ~count1~0), Black: 465#(<= (+ ~count2~0 1) ~count1~0), Black: 468#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count3~0 1) ~count1~0)), Black: 536#(<= (+ ~count2~0 1) ~count1~0), Black: 539#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count2~0 1) ~count3~0)), Black: 477#(<= ~count1~0 ~count2~0), 463#true, Black: 476#(<= ~count1~0 ~count3~0), Black: 488#(<= (+ ~count3~0 1) ~count1~0), 311#true, Black: 485#true, Black: 490#(and (<= ~count3~0 ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), 497#true, Black: 395#(<= ~res1~0 0), Black: 417#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 407#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), 487#(<= ~count3~0 ~count2~0), Black: 425#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 399#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 553#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), 545#(<= ~count1~0 ~count3~0), Black: 562#(and (<= (+ ~res1~0 1) 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 423#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 554#(<= (+ ~res1~0 1) 0), Black: 415#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 559#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 413#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~res1~0 0)), Black: 564#(and (<= (+ ~res1~0 1) 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 361#(and (<= 0 ~n1~0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))), Black: 419#(and (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 370#(and (<= 0 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 401#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 372#(and (<= ~res2~0 ~res3~0) (<= 0 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 345#(and (<= 0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 316#(= thread1Thread1of1ForFork1_~stop~0 0), Black: 504#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0))]) [2021-12-06 18:59:08,688 INFO L384 tUnfolder$Statistics]: this new event has 216 ancestors and is not cut-off event [2021-12-06 18:59:08,688 INFO L387 tUnfolder$Statistics]: existing Event has 217 ancestors and is not cut-off event [2021-12-06 18:59:08,688 INFO L387 tUnfolder$Statistics]: existing Event has 218 ancestors and is not cut-off event [2021-12-06 18:59:08,688 INFO L387 tUnfolder$Statistics]: existing Event has 216 ancestors and is not cut-off event [2021-12-06 18:59:08,689 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([930] thread3EXIT-->L125-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem39#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} AuxVars[] AssignedVars[][379], [Black: 500#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 499#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), Black: 326#(= thread3Thread1of1ForFork0_~stop~2 0), 479#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), Black: 452#(and (= |thread3Thread1of1ForFork0_#t~ite21| 1) (= ~res3~0 1)), Black: 447#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 448#(= ~res3~0 1), 94#L125-2true, Black: 519#(<= (+ ~res2~0 1) 0), 551#true, Black: 466#(<= (+ ~count3~0 1) ~count1~0), Black: 465#(<= (+ ~count2~0 1) ~count1~0), Black: 468#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count3~0 1) ~count1~0)), Black: 536#(<= (+ ~count2~0 1) ~count1~0), Black: 539#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count2~0 1) ~count3~0)), Black: 477#(<= ~count1~0 ~count2~0), 463#true, Black: 476#(<= ~count1~0 ~count3~0), Black: 488#(<= (+ ~count3~0 1) ~count1~0), Black: 485#true, 311#true, Black: 490#(and (<= ~count3~0 ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), 497#true, Black: 395#(<= ~res1~0 0), Black: 417#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 407#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 425#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), 487#(<= ~count3~0 ~count2~0), Black: 399#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 553#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), 571#true, 545#(<= ~count1~0 ~count3~0), Black: 562#(and (<= (+ ~res1~0 1) 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 423#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 554#(<= (+ ~res1~0 1) 0), Black: 415#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 559#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 413#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~res1~0 0)), Black: 564#(and (<= (+ ~res1~0 1) 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 361#(and (<= 0 ~n1~0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))), Black: 419#(and (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 370#(and (<= 0 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 401#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 372#(and (<= ~res2~0 ~res3~0) (<= 0 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 345#(and (<= 0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 316#(= thread1Thread1of1ForFork1_~stop~0 0), Black: 504#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0))]) [2021-12-06 18:59:08,689 INFO L384 tUnfolder$Statistics]: this new event has 216 ancestors and is not cut-off event [2021-12-06 18:59:08,689 INFO L387 tUnfolder$Statistics]: existing Event has 216 ancestors and is not cut-off event [2021-12-06 18:59:08,689 INFO L387 tUnfolder$Statistics]: existing Event has 217 ancestors and is not cut-off event [2021-12-06 18:59:08,689 INFO L387 tUnfolder$Statistics]: existing Event has 218 ancestors and is not cut-off event [2021-12-06 18:59:08,701 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([930] thread3EXIT-->L125-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem39#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} AuxVars[] AssignedVars[][379], [Black: 500#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 499#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), Black: 321#(= thread2Thread1of1ForFork2_~stop~1 0), Black: 326#(= thread3Thread1of1ForFork0_~stop~2 0), 479#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), Black: 452#(and (= |thread3Thread1of1ForFork0_#t~ite21| 1) (= ~res3~0 1)), 345#(and (<= 0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 447#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 448#(= ~res3~0 1), 94#L125-2true, Black: 519#(<= (+ ~res2~0 1) 0), 551#true, Black: 466#(<= (+ ~count3~0 1) ~count1~0), Black: 465#(<= (+ ~count2~0 1) ~count1~0), Black: 468#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count3~0 1) ~count1~0)), Black: 536#(<= (+ ~count2~0 1) ~count1~0), Black: 539#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count2~0 1) ~count3~0)), Black: 477#(<= ~count1~0 ~count2~0), 463#true, Black: 476#(<= ~count1~0 ~count3~0), Black: 488#(<= (+ ~count3~0 1) ~count1~0), 311#true, Black: 485#true, Black: 490#(and (<= ~count3~0 ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), 497#true, Black: 395#(<= ~res1~0 0), Black: 417#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 407#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 425#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), 487#(<= ~count3~0 ~count2~0), Black: 399#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), 571#true, Black: 553#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), 545#(<= ~count1~0 ~count3~0), Black: 562#(and (<= (+ ~res1~0 1) 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 423#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 554#(<= (+ ~res1~0 1) 0), Black: 415#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 559#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 413#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~res1~0 0)), Black: 361#(and (<= 0 ~n1~0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))), Black: 564#(and (<= (+ ~res1~0 1) 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 419#(and (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 370#(and (<= 0 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 401#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 372#(and (<= ~res2~0 ~res3~0) (<= 0 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 316#(= thread1Thread1of1ForFork1_~stop~0 0), Black: 504#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0))]) [2021-12-06 18:59:08,701 INFO L384 tUnfolder$Statistics]: this new event has 222 ancestors and is not cut-off event [2021-12-06 18:59:08,701 INFO L387 tUnfolder$Statistics]: existing Event has 224 ancestors and is not cut-off event [2021-12-06 18:59:08,701 INFO L387 tUnfolder$Statistics]: existing Event has 223 ancestors and is not cut-off event [2021-12-06 18:59:08,701 INFO L387 tUnfolder$Statistics]: existing Event has 222 ancestors and is not cut-off event [2021-12-06 18:59:08,708 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([930] thread3EXIT-->L125-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem39#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} AuxVars[] AssignedVars[][379], [Black: 500#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 321#(= thread2Thread1of1ForFork2_~stop~1 0), Black: 499#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), Black: 326#(= thread3Thread1of1ForFork0_~stop~2 0), 479#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), Black: 452#(and (= |thread3Thread1of1ForFork0_#t~ite21| 1) (= ~res3~0 1)), Black: 447#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 448#(= ~res3~0 1), 94#L125-2true, Black: 519#(<= (+ ~res2~0 1) 0), 551#true, Black: 466#(<= (+ ~count3~0 1) ~count1~0), Black: 465#(<= (+ ~count2~0 1) ~count1~0), Black: 468#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count3~0 1) ~count1~0)), Black: 536#(<= (+ ~count2~0 1) ~count1~0), Black: 539#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count2~0 1) ~count3~0)), Black: 477#(<= ~count1~0 ~count2~0), 463#true, Black: 476#(<= ~count1~0 ~count3~0), Black: 488#(<= (+ ~count3~0 1) ~count1~0), Black: 485#true, 311#true, Black: 490#(and (<= ~count3~0 ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), 497#true, Black: 395#(<= ~res1~0 0), Black: 417#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 407#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 425#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), 487#(<= ~count3~0 ~count2~0), Black: 399#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 553#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), 571#true, 545#(<= ~count1~0 ~count3~0), Black: 562#(and (<= (+ ~res1~0 1) 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 423#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 554#(<= (+ ~res1~0 1) 0), Black: 415#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 559#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 413#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~res1~0 0)), Black: 564#(and (<= (+ ~res1~0 1) 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 361#(and (<= 0 ~n1~0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))), Black: 419#(and (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 370#(and (<= 0 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 401#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 372#(and (<= ~res2~0 ~res3~0) (<= 0 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 345#(and (<= 0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 316#(= thread1Thread1of1ForFork1_~stop~0 0), Black: 504#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0))]) [2021-12-06 18:59:08,708 INFO L384 tUnfolder$Statistics]: this new event has 229 ancestors and is not cut-off event [2021-12-06 18:59:08,708 INFO L387 tUnfolder$Statistics]: existing Event has 231 ancestors and is not cut-off event [2021-12-06 18:59:08,708 INFO L387 tUnfolder$Statistics]: existing Event has 229 ancestors and is not cut-off event [2021-12-06 18:59:08,708 INFO L387 tUnfolder$Statistics]: existing Event has 230 ancestors and is not cut-off event [2021-12-06 18:59:08,709 INFO L129 PetriNetUnfolder]: 4618/32346 cut-off events. [2021-12-06 18:59:08,709 INFO L130 PetriNetUnfolder]: For 34626/37657 co-relation queries the response was YES. [2021-12-06 18:59:08,981 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65041 conditions, 32346 events. 4618/32346 cut-off events. For 34626/37657 co-relation queries the response was YES. Maximal size of possible extension queue 1310. Compared 511860 event pairs, 2046 based on Foata normal form. 324/30357 useless extension candidates. Maximal degree in co-relation 64992. Up to 4745 conditions per place. [2021-12-06 18:59:09,023 INFO L132 encePairwiseOnDemand]: 327/332 looper letters, 56 selfloop transitions, 6 changer transitions 10/390 dead transitions. [2021-12-06 18:59:09,024 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 390 transitions, 1714 flow [2021-12-06 18:59:09,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 18:59:09,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-06 18:59:09,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1219 transitions. [2021-12-06 18:59:09,025 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9179216867469879 [2021-12-06 18:59:09,025 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1219 transitions. [2021-12-06 18:59:09,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1219 transitions. [2021-12-06 18:59:09,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:59:09,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1219 transitions. [2021-12-06 18:59:09,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 304.75) internal successors, (1219), 4 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:09,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:09,028 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:09,028 INFO L186 Difference]: Start difference. First operand has 378 places, 367 transitions, 1425 flow. Second operand 4 states and 1219 transitions. [2021-12-06 18:59:09,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 390 transitions, 1714 flow [2021-12-06 18:59:09,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 390 transitions, 1705 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-12-06 18:59:09,583 INFO L242 Difference]: Finished difference. Result has 377 places, 367 transitions, 1441 flow [2021-12-06 18:59:09,584 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1416, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1441, PETRI_PLACES=377, PETRI_TRANSITIONS=367} [2021-12-06 18:59:09,584 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 83 predicate places. [2021-12-06 18:59:09,584 INFO L470 AbstractCegarLoop]: Abstraction has has 377 places, 367 transitions, 1441 flow [2021-12-06 18:59:09,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.25) internal successors, (1193), 4 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:09,584 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:59:09,585 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:59:09,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-06 18:59:09,585 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 18:59:09,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:59:09,585 INFO L85 PathProgramCache]: Analyzing trace with hash -46720617, now seen corresponding path program 4 times [2021-12-06 18:59:09,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:59:09,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291512116] [2021-12-06 18:59:09,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:59:09,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:59:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:09,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:59:09,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:59:09,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291512116] [2021-12-06 18:59:09,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291512116] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:59:09,618 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:59:09,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:59:09,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865244851] [2021-12-06 18:59:09,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:59:09,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:59:09,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:59:09,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:59:09,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:59:09,620 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2021-12-06 18:59:09,621 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 367 transitions, 1441 flow. Second operand has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:09,621 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:59:09,621 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2021-12-06 18:59:09,621 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:59:13,863 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([930] thread3EXIT-->L125-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem39#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} AuxVars[] AssignedVars[][395], [Black: 500#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 499#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), Black: 576#(and (<= (+ ~count1~0 1) ~count2~0) (<= (+ ~count3~0 1) ~count2~0)), 573#(<= (+ ~count3~0 1) ~count2~0), 479#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), Black: 452#(and (= |thread3Thread1of1ForFork0_#t~ite21| 1) (= ~res3~0 1)), 345#(and (<= 0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 447#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 448#(= ~res3~0 1), 94#L125-2true, Black: 519#(<= (+ ~res2~0 1) 0), 585#(and (<= ~count3~0 ~count2~0) (<= ~count1~0 ~count2~0)), Black: 466#(<= (+ ~count3~0 1) ~count1~0), Black: 465#(<= (+ ~count2~0 1) ~count1~0), Black: 468#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count3~0 1) ~count1~0)), Black: 536#(<= (+ ~count2~0 1) ~count1~0), Black: 539#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count2~0 1) ~count3~0)), Black: 477#(<= ~count1~0 ~count2~0), 463#true, Black: 476#(<= ~count1~0 ~count3~0), 399#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 488#(<= (+ ~count3~0 1) ~count1~0), 311#true, Black: 485#true, 497#true, Black: 490#(and (<= ~count3~0 ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), Black: 395#(<= ~res1~0 0), Black: 417#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 407#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 425#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), 487#(<= ~count3~0 ~count2~0), Black: 553#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), 545#(<= ~count1~0 ~count3~0), Black: 423#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 554#(<= (+ ~res1~0 1) 0), Black: 415#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 559#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 413#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~res1~0 0)), Black: 419#(and (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 361#(and (<= 0 ~n1~0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))), Black: 370#(and (<= 0 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 401#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 372#(and (<= ~res2~0 ~res3~0) (<= 0 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 316#(= thread1Thread1of1ForFork1_~stop~0 0), Black: 504#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0))]) [2021-12-06 18:59:13,863 INFO L384 tUnfolder$Statistics]: this new event has 189 ancestors and is not cut-off event [2021-12-06 18:59:13,864 INFO L387 tUnfolder$Statistics]: existing Event has 189 ancestors and is not cut-off event [2021-12-06 18:59:13,864 INFO L387 tUnfolder$Statistics]: existing Event has 189 ancestors and is not cut-off event [2021-12-06 18:59:13,864 INFO L387 tUnfolder$Statistics]: existing Event has 189 ancestors and is not cut-off event [2021-12-06 18:59:13,932 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([930] thread3EXIT-->L125-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem39#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} AuxVars[] AssignedVars[][395], [Black: 500#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 499#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), Black: 576#(and (<= (+ ~count1~0 1) ~count2~0) (<= (+ ~count3~0 1) ~count2~0)), 573#(<= (+ ~count3~0 1) ~count2~0), 479#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), Black: 452#(and (= |thread3Thread1of1ForFork0_#t~ite21| 1) (= ~res3~0 1)), 345#(and (<= 0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 447#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 448#(= ~res3~0 1), 94#L125-2true, Black: 519#(<= (+ ~res2~0 1) 0), 585#(and (<= ~count3~0 ~count2~0) (<= ~count1~0 ~count2~0)), Black: 466#(<= (+ ~count3~0 1) ~count1~0), Black: 465#(<= (+ ~count2~0 1) ~count1~0), Black: 468#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count3~0 1) ~count1~0)), Black: 536#(<= (+ ~count2~0 1) ~count1~0), Black: 539#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count2~0 1) ~count3~0)), Black: 477#(<= ~count1~0 ~count2~0), Black: 476#(<= ~count1~0 ~count3~0), 463#true, Black: 488#(<= (+ ~count3~0 1) ~count1~0), Black: 485#true, 311#true, Black: 490#(and (<= ~count3~0 ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), 497#true, Black: 395#(<= ~res1~0 0), Black: 417#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 407#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), 487#(<= ~count3~0 ~count2~0), Black: 425#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 399#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 553#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), 545#(<= ~count1~0 ~count3~0), Black: 423#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 554#(<= (+ ~res1~0 1) 0), Black: 415#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 559#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 413#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~res1~0 0)), Black: 419#(and (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 361#(and (<= 0 ~n1~0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))), Black: 370#(and (<= 0 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 372#(and (<= ~res2~0 ~res3~0) (<= 0 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 316#(= thread1Thread1of1ForFork1_~stop~0 0), 401#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 504#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0))]) [2021-12-06 18:59:13,932 INFO L384 tUnfolder$Statistics]: this new event has 190 ancestors and is not cut-off event [2021-12-06 18:59:13,932 INFO L387 tUnfolder$Statistics]: existing Event has 190 ancestors and is not cut-off event [2021-12-06 18:59:13,932 INFO L387 tUnfolder$Statistics]: existing Event has 190 ancestors and is not cut-off event [2021-12-06 18:59:13,932 INFO L387 tUnfolder$Statistics]: existing Event has 190 ancestors and is not cut-off event [2021-12-06 18:59:14,330 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([930] thread3EXIT-->L125-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem39#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} AuxVars[] AssignedVars[][395], [Black: 500#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 576#(and (<= (+ ~count1~0 1) ~count2~0) (<= (+ ~count3~0 1) ~count2~0)), Black: 499#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), 573#(<= (+ ~count3~0 1) ~count2~0), 479#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), Black: 452#(and (= |thread3Thread1of1ForFork0_#t~ite21| 1) (= ~res3~0 1)), Black: 447#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 448#(= ~res3~0 1), 94#L125-2true, Black: 519#(<= (+ ~res2~0 1) 0), 585#(and (<= ~count3~0 ~count2~0) (<= ~count1~0 ~count2~0)), Black: 466#(<= (+ ~count3~0 1) ~count1~0), Black: 465#(<= (+ ~count2~0 1) ~count1~0), Black: 468#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count3~0 1) ~count1~0)), Black: 536#(<= (+ ~count2~0 1) ~count1~0), Black: 539#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count2~0 1) ~count3~0)), Black: 477#(<= ~count1~0 ~count2~0), 463#true, Black: 476#(<= ~count1~0 ~count3~0), 399#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 488#(<= (+ ~count3~0 1) ~count1~0), Black: 485#true, 311#true, 497#true, Black: 490#(and (<= ~count3~0 ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), Black: 395#(<= ~res1~0 0), Black: 417#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 407#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), 487#(<= ~count3~0 ~count2~0), Black: 425#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 553#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), 545#(<= ~count1~0 ~count3~0), Black: 423#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 554#(<= (+ ~res1~0 1) 0), Black: 415#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 559#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 413#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~res1~0 0)), Black: 361#(and (<= 0 ~n1~0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))), Black: 419#(and (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 370#(and (<= 0 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 401#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 372#(and (<= ~res2~0 ~res3~0) (<= 0 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 345#(and (<= 0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 316#(= thread1Thread1of1ForFork1_~stop~0 0), Black: 504#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0))]) [2021-12-06 18:59:14,330 INFO L384 tUnfolder$Statistics]: this new event has 196 ancestors and is not cut-off event [2021-12-06 18:59:14,331 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2021-12-06 18:59:14,331 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2021-12-06 18:59:14,331 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2021-12-06 18:59:14,366 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([930] thread3EXIT-->L125-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem39#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} AuxVars[] AssignedVars[][395], [Black: 500#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 499#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), Black: 576#(and (<= (+ ~count1~0 1) ~count2~0) (<= (+ ~count3~0 1) ~count2~0)), 573#(<= (+ ~count3~0 1) ~count2~0), 479#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), Black: 452#(and (= |thread3Thread1of1ForFork0_#t~ite21| 1) (= ~res3~0 1)), Black: 447#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 448#(= ~res3~0 1), 94#L125-2true, Black: 519#(<= (+ ~res2~0 1) 0), 585#(and (<= ~count3~0 ~count2~0) (<= ~count1~0 ~count2~0)), Black: 466#(<= (+ ~count3~0 1) ~count1~0), Black: 465#(<= (+ ~count2~0 1) ~count1~0), Black: 468#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count3~0 1) ~count1~0)), Black: 536#(<= (+ ~count2~0 1) ~count1~0), Black: 539#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count2~0 1) ~count3~0)), Black: 477#(<= ~count1~0 ~count2~0), 463#true, Black: 476#(<= ~count1~0 ~count3~0), Black: 488#(<= (+ ~count3~0 1) ~count1~0), 311#true, Black: 485#true, Black: 490#(and (<= ~count3~0 ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), 497#true, Black: 395#(<= ~res1~0 0), Black: 417#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 407#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 425#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), 487#(<= ~count3~0 ~count2~0), Black: 399#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), 545#(<= ~count1~0 ~count3~0), Black: 553#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), Black: 423#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 554#(<= (+ ~res1~0 1) 0), Black: 415#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 559#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 413#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~res1~0 0)), Black: 361#(and (<= 0 ~n1~0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))), Black: 419#(and (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 370#(and (<= 0 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 372#(and (<= ~res2~0 ~res3~0) (<= 0 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n1~0) (<= ~n2~0 ~n1~0)), 401#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 345#(and (<= 0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 316#(= thread1Thread1of1ForFork1_~stop~0 0), Black: 504#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0))]) [2021-12-06 18:59:14,366 INFO L384 tUnfolder$Statistics]: this new event has 197 ancestors and is not cut-off event [2021-12-06 18:59:14,366 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is not cut-off event [2021-12-06 18:59:14,366 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is not cut-off event [2021-12-06 18:59:14,366 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is not cut-off event [2021-12-06 18:59:14,557 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([930] thread3EXIT-->L125-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem39#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} AuxVars[] AssignedVars[][395], [Black: 500#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 576#(and (<= (+ ~count1~0 1) ~count2~0) (<= (+ ~count3~0 1) ~count2~0)), Black: 499#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), 573#(<= (+ ~count3~0 1) ~count2~0), 479#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), Black: 326#(= thread3Thread1of1ForFork0_~stop~2 0), Black: 452#(and (= |thread3Thread1of1ForFork0_#t~ite21| 1) (= ~res3~0 1)), 345#(and (<= 0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 447#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 448#(= ~res3~0 1), 94#L125-2true, Black: 519#(<= (+ ~res2~0 1) 0), 585#(and (<= ~count3~0 ~count2~0) (<= ~count1~0 ~count2~0)), Black: 466#(<= (+ ~count3~0 1) ~count1~0), Black: 465#(<= (+ ~count2~0 1) ~count1~0), Black: 468#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count3~0 1) ~count1~0)), Black: 536#(<= (+ ~count2~0 1) ~count1~0), Black: 539#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count2~0 1) ~count3~0)), Black: 477#(<= ~count1~0 ~count2~0), 463#true, Black: 476#(<= ~count1~0 ~count3~0), Black: 488#(<= (+ ~count3~0 1) ~count1~0), Black: 485#true, 311#true, Black: 490#(and (<= ~count3~0 ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), 497#true, Black: 395#(<= ~res1~0 0), Black: 417#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 407#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), 487#(<= ~count3~0 ~count2~0), Black: 425#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 399#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), 545#(<= ~count1~0 ~count3~0), Black: 553#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), Black: 423#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 554#(<= (+ ~res1~0 1) 0), Black: 415#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 559#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 413#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~res1~0 0)), Black: 361#(and (<= 0 ~n1~0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))), Black: 419#(and (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 370#(and (<= 0 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 401#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 372#(and (<= ~res2~0 ~res3~0) (<= 0 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 316#(= thread1Thread1of1ForFork1_~stop~0 0), Black: 504#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0))]) [2021-12-06 18:59:14,557 INFO L384 tUnfolder$Statistics]: this new event has 209 ancestors and is not cut-off event [2021-12-06 18:59:14,558 INFO L387 tUnfolder$Statistics]: existing Event has 209 ancestors and is not cut-off event [2021-12-06 18:59:14,558 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is not cut-off event [2021-12-06 18:59:14,558 INFO L387 tUnfolder$Statistics]: existing Event has 211 ancestors and is not cut-off event [2021-12-06 18:59:14,601 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([930] thread3EXIT-->L125-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem39#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} AuxVars[] AssignedVars[][395], [Black: 500#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 499#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), Black: 576#(and (<= (+ ~count1~0 1) ~count2~0) (<= (+ ~count3~0 1) ~count2~0)), 573#(<= (+ ~count3~0 1) ~count2~0), Black: 326#(= thread3Thread1of1ForFork0_~stop~2 0), 479#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), Black: 452#(and (= |thread3Thread1of1ForFork0_#t~ite21| 1) (= ~res3~0 1)), Black: 447#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 448#(= ~res3~0 1), 94#L125-2true, Black: 519#(<= (+ ~res2~0 1) 0), 585#(and (<= ~count3~0 ~count2~0) (<= ~count1~0 ~count2~0)), Black: 466#(<= (+ ~count3~0 1) ~count1~0), Black: 465#(<= (+ ~count2~0 1) ~count1~0), Black: 468#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count3~0 1) ~count1~0)), Black: 536#(<= (+ ~count2~0 1) ~count1~0), Black: 539#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count2~0 1) ~count3~0)), Black: 477#(<= ~count1~0 ~count2~0), 463#true, Black: 476#(<= ~count1~0 ~count3~0), Black: 488#(<= (+ ~count3~0 1) ~count1~0), 311#true, Black: 485#true, Black: 490#(and (<= ~count3~0 ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), 497#true, Black: 395#(<= ~res1~0 0), Black: 417#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 407#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), 487#(<= ~count3~0 ~count2~0), Black: 425#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 399#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 553#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), 545#(<= ~count1~0 ~count3~0), Black: 423#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 554#(<= (+ ~res1~0 1) 0), Black: 415#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 559#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 413#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~res1~0 0)), Black: 361#(and (<= 0 ~n1~0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))), Black: 419#(and (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 370#(and (<= 0 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 401#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 372#(and (<= ~res2~0 ~res3~0) (<= 0 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 345#(and (<= 0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 316#(= thread1Thread1of1ForFork1_~stop~0 0), Black: 504#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0))]) [2021-12-06 18:59:14,602 INFO L384 tUnfolder$Statistics]: this new event has 216 ancestors and is not cut-off event [2021-12-06 18:59:14,602 INFO L387 tUnfolder$Statistics]: existing Event has 217 ancestors and is not cut-off event [2021-12-06 18:59:14,602 INFO L387 tUnfolder$Statistics]: existing Event has 216 ancestors and is not cut-off event [2021-12-06 18:59:14,602 INFO L387 tUnfolder$Statistics]: existing Event has 218 ancestors and is not cut-off event [2021-12-06 18:59:14,623 INFO L129 PetriNetUnfolder]: 5171/33933 cut-off events. [2021-12-06 18:59:14,623 INFO L130 PetriNetUnfolder]: For 39813/43184 co-relation queries the response was YES. [2021-12-06 18:59:14,903 INFO L84 FinitePrefix]: Finished finitePrefix Result has 68206 conditions, 33933 events. 5171/33933 cut-off events. For 39813/43184 co-relation queries the response was YES. Maximal size of possible extension queue 1547. Compared 541795 event pairs, 1488 based on Foata normal form. 294/31756 useless extension candidates. Maximal degree in co-relation 68157. Up to 3671 conditions per place. [2021-12-06 18:59:14,948 INFO L132 encePairwiseOnDemand]: 324/332 looper letters, 55 selfloop transitions, 22 changer transitions 12/407 dead transitions. [2021-12-06 18:59:14,948 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 407 transitions, 1867 flow [2021-12-06 18:59:14,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:59:14,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-06 18:59:14,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1535 transitions. [2021-12-06 18:59:14,950 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9246987951807228 [2021-12-06 18:59:14,951 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1535 transitions. [2021-12-06 18:59:14,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1535 transitions. [2021-12-06 18:59:14,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:59:14,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1535 transitions. [2021-12-06 18:59:14,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:14,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:14,954 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:14,954 INFO L186 Difference]: Start difference. First operand has 377 places, 367 transitions, 1441 flow. Second operand 5 states and 1535 transitions. [2021-12-06 18:59:14,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 407 transitions, 1867 flow [2021-12-06 18:59:15,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 407 transitions, 1852 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-12-06 18:59:15,398 INFO L242 Difference]: Finished difference. Result has 382 places, 374 transitions, 1600 flow [2021-12-06 18:59:15,398 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1413, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1600, PETRI_PLACES=382, PETRI_TRANSITIONS=374} [2021-12-06 18:59:15,399 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 88 predicate places. [2021-12-06 18:59:15,399 INFO L470 AbstractCegarLoop]: Abstraction has has 382 places, 374 transitions, 1600 flow [2021-12-06 18:59:15,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:15,399 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:59:15,399 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:59:15,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-06 18:59:15,399 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 18:59:15,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:59:15,400 INFO L85 PathProgramCache]: Analyzing trace with hash 400602869, now seen corresponding path program 1 times [2021-12-06 18:59:15,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:59:15,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555962283] [2021-12-06 18:59:15,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:59:15,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:59:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:15,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:59:15,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:59:15,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555962283] [2021-12-06 18:59:15,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555962283] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:59:15,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739459556] [2021-12-06 18:59:15,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:59:15,521 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:59:15,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:59:15,522 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:59:15,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 18:59:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:15,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-06 18:59:15,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:59:16,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:59:16,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:59:16,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:59:16,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739459556] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-06 18:59:16,430 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-06 18:59:16,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15, 13] total 28 [2021-12-06 18:59:16,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930723729] [2021-12-06 18:59:16,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:59:16,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-06 18:59:16,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:59:16,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-06 18:59:16,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2021-12-06 18:59:16,436 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 332 [2021-12-06 18:59:16,437 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 374 transitions, 1600 flow. Second operand has 13 states, 13 states have (on average 236.15384615384616) internal successors, (3070), 13 states have internal predecessors, (3070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:16,437 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:59:16,437 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 332 [2021-12-06 18:59:16,437 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:59:26,658 INFO L129 PetriNetUnfolder]: 13300/65321 cut-off events. [2021-12-06 18:59:26,658 INFO L130 PetriNetUnfolder]: For 72397/79710 co-relation queries the response was YES. [2021-12-06 18:59:27,447 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125423 conditions, 65321 events. 13300/65321 cut-off events. For 72397/79710 co-relation queries the response was YES. Maximal size of possible extension queue 2691. Compared 1077861 event pairs, 6833 based on Foata normal form. 871/58204 useless extension candidates. Maximal degree in co-relation 125373. Up to 7246 conditions per place. [2021-12-06 18:59:27,553 INFO L132 encePairwiseOnDemand]: 311/332 looper letters, 180 selfloop transitions, 31 changer transitions 8/484 dead transitions. [2021-12-06 18:59:27,553 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 484 transitions, 2529 flow [2021-12-06 18:59:27,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-06 18:59:27,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-12-06 18:59:27,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 4102 transitions. [2021-12-06 18:59:27,557 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7267895109851169 [2021-12-06 18:59:27,557 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 4102 transitions. [2021-12-06 18:59:27,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 4102 transitions. [2021-12-06 18:59:27,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:59:27,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 4102 transitions. [2021-12-06 18:59:27,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 241.2941176470588) internal successors, (4102), 17 states have internal predecessors, (4102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:27,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 332.0) internal successors, (5976), 18 states have internal predecessors, (5976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:27,567 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 332.0) internal successors, (5976), 18 states have internal predecessors, (5976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:27,567 INFO L186 Difference]: Start difference. First operand has 382 places, 374 transitions, 1600 flow. Second operand 17 states and 4102 transitions. [2021-12-06 18:59:27,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 484 transitions, 2529 flow [2021-12-06 18:59:28,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 484 transitions, 2452 flow, removed 27 selfloop flow, removed 4 redundant places. [2021-12-06 18:59:28,158 INFO L242 Difference]: Finished difference. Result has 401 places, 389 transitions, 1681 flow [2021-12-06 18:59:28,158 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1523, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1681, PETRI_PLACES=401, PETRI_TRANSITIONS=389} [2021-12-06 18:59:28,158 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 107 predicate places. [2021-12-06 18:59:28,158 INFO L470 AbstractCegarLoop]: Abstraction has has 401 places, 389 transitions, 1681 flow [2021-12-06 18:59:28,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 236.15384615384616) internal successors, (3070), 13 states have internal predecessors, (3070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:28,159 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:59:28,159 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:59:28,179 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 18:59:28,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-06 18:59:28,360 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 18:59:28,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:59:28,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1818795893, now seen corresponding path program 1 times [2021-12-06 18:59:28,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:59:28,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936490558] [2021-12-06 18:59:28,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:59:28,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:59:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:28,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 18:59:28,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:59:28,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936490558] [2021-12-06 18:59:28,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936490558] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:59:28,396 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:59:28,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:59:28,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139892464] [2021-12-06 18:59:28,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:59:28,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:59:28,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:59:28,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:59:28,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:59:28,398 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2021-12-06 18:59:28,399 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 389 transitions, 1681 flow. Second operand has 4 states, 4 states have (on average 298.25) internal successors, (1193), 4 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:28,399 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:59:28,399 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2021-12-06 18:59:28,399 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:59:35,012 INFO L129 PetriNetUnfolder]: 5886/41420 cut-off events. [2021-12-06 18:59:35,013 INFO L130 PetriNetUnfolder]: For 49057/53758 co-relation queries the response was YES. [2021-12-06 18:59:35,427 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85732 conditions, 41420 events. 5886/41420 cut-off events. For 49057/53758 co-relation queries the response was YES. Maximal size of possible extension queue 1708. Compared 674850 event pairs, 1783 based on Foata normal form. 288/38656 useless extension candidates. Maximal degree in co-relation 85679. Up to 4678 conditions per place. [2021-12-06 18:59:35,493 INFO L132 encePairwiseOnDemand]: 324/332 looper letters, 65 selfloop transitions, 29 changer transitions 10/435 dead transitions. [2021-12-06 18:59:35,493 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 435 transitions, 2191 flow [2021-12-06 18:59:35,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:59:35,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-06 18:59:35,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1535 transitions. [2021-12-06 18:59:35,495 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9246987951807228 [2021-12-06 18:59:35,495 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1535 transitions. [2021-12-06 18:59:35,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1535 transitions. [2021-12-06 18:59:35,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:59:35,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1535 transitions. [2021-12-06 18:59:35,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:35,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:35,498 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:35,498 INFO L186 Difference]: Start difference. First operand has 401 places, 389 transitions, 1681 flow. Second operand 5 states and 1535 transitions. [2021-12-06 18:59:35,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 435 transitions, 2191 flow [2021-12-06 18:59:36,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 435 transitions, 2156 flow, removed 9 selfloop flow, removed 8 redundant places. [2021-12-06 18:59:36,180 INFO L242 Difference]: Finished difference. Result has 398 places, 400 transitions, 1872 flow [2021-12-06 18:59:36,181 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1634, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1872, PETRI_PLACES=398, PETRI_TRANSITIONS=400} [2021-12-06 18:59:36,181 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 104 predicate places. [2021-12-06 18:59:36,181 INFO L470 AbstractCegarLoop]: Abstraction has has 398 places, 400 transitions, 1872 flow [2021-12-06 18:59:36,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.25) internal successors, (1193), 4 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:36,181 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:59:36,182 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:59:36,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-06 18:59:36,182 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 18:59:36,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:59:36,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1926975177, now seen corresponding path program 2 times [2021-12-06 18:59:36,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:59:36,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191632903] [2021-12-06 18:59:36,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:59:36,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:59:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:36,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 18:59:36,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:59:36,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191632903] [2021-12-06 18:59:36,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191632903] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:59:36,215 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:59:36,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:59:36,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923349832] [2021-12-06 18:59:36,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:59:36,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:59:36,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:59:36,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:59:36,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:59:36,217 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2021-12-06 18:59:36,217 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 400 transitions, 1872 flow. Second operand has 4 states, 4 states have (on average 298.25) internal successors, (1193), 4 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:36,217 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:59:36,217 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2021-12-06 18:59:36,218 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:59:42,465 INFO L129 PetriNetUnfolder]: 6104/40514 cut-off events. [2021-12-06 18:59:42,466 INFO L130 PetriNetUnfolder]: For 53294/57186 co-relation queries the response was YES. [2021-12-06 18:59:42,881 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84715 conditions, 40514 events. 6104/40514 cut-off events. For 53294/57186 co-relation queries the response was YES. Maximal size of possible extension queue 1765. Compared 661307 event pairs, 2477 based on Foata normal form. 193/37567 useless extension candidates. Maximal degree in co-relation 84662. Up to 4367 conditions per place. [2021-12-06 18:59:42,954 INFO L132 encePairwiseOnDemand]: 326/332 looper letters, 66 selfloop transitions, 21 changer transitions 1/419 dead transitions. [2021-12-06 18:59:42,954 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 419 transitions, 2133 flow [2021-12-06 18:59:42,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:59:42,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-06 18:59:42,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1523 transitions. [2021-12-06 18:59:42,956 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9174698795180722 [2021-12-06 18:59:42,956 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1523 transitions. [2021-12-06 18:59:42,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1523 transitions. [2021-12-06 18:59:42,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:59:42,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1523 transitions. [2021-12-06 18:59:42,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 304.6) internal successors, (1523), 5 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:43,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:43,072 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:43,072 INFO L186 Difference]: Start difference. First operand has 398 places, 400 transitions, 1872 flow. Second operand 5 states and 1523 transitions. [2021-12-06 18:59:43,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 419 transitions, 2133 flow [2021-12-06 18:59:43,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 419 transitions, 2125 flow, removed 4 selfloop flow, removed 0 redundant places. [2021-12-06 18:59:43,665 INFO L242 Difference]: Finished difference. Result has 404 places, 404 transitions, 1981 flow [2021-12-06 18:59:43,665 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1864, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1981, PETRI_PLACES=404, PETRI_TRANSITIONS=404} [2021-12-06 18:59:43,665 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 110 predicate places. [2021-12-06 18:59:43,666 INFO L470 AbstractCegarLoop]: Abstraction has has 404 places, 404 transitions, 1981 flow [2021-12-06 18:59:43,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.25) internal successors, (1193), 4 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:43,666 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:59:43,666 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:59:43,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-06 18:59:43,666 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 18:59:43,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:59:43,666 INFO L85 PathProgramCache]: Analyzing trace with hash 999835811, now seen corresponding path program 1 times [2021-12-06 18:59:43,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:59:43,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701553873] [2021-12-06 18:59:43,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:59:43,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:59:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:43,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 18:59:43,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:59:43,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701553873] [2021-12-06 18:59:43,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701553873] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:59:43,717 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:59:43,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 18:59:43,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871166972] [2021-12-06 18:59:43,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:59:43,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 18:59:43,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:59:43,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 18:59:43,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:59:43,719 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2021-12-06 18:59:43,720 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 404 transitions, 1981 flow. Second operand has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:43,720 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:59:43,720 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2021-12-06 18:59:43,720 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:59:51,935 INFO L129 PetriNetUnfolder]: 6973/51093 cut-off events. [2021-12-06 18:59:51,935 INFO L130 PetriNetUnfolder]: For 74753/79352 co-relation queries the response was YES. [2021-12-06 18:59:52,452 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105597 conditions, 51093 events. 6973/51093 cut-off events. For 74753/79352 co-relation queries the response was YES. Maximal size of possible extension queue 1968. Compared 858958 event pairs, 2241 based on Foata normal form. 223/47439 useless extension candidates. Maximal degree in co-relation 105541. Up to 5128 conditions per place. [2021-12-06 18:59:52,513 INFO L132 encePairwiseOnDemand]: 324/332 looper letters, 64 selfloop transitions, 18 changer transitions 44/447 dead transitions. [2021-12-06 18:59:52,513 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 447 transitions, 2619 flow [2021-12-06 18:59:52,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:59:52,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-06 18:59:52,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1531 transitions. [2021-12-06 18:59:52,514 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.922289156626506 [2021-12-06 18:59:52,514 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1531 transitions. [2021-12-06 18:59:52,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1531 transitions. [2021-12-06 18:59:52,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:59:52,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1531 transitions. [2021-12-06 18:59:52,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 306.2) internal successors, (1531), 5 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:52,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:52,517 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:52,517 INFO L186 Difference]: Start difference. First operand has 404 places, 404 transitions, 1981 flow. Second operand 5 states and 1531 transitions. [2021-12-06 18:59:52,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 447 transitions, 2619 flow [2021-12-06 18:59:53,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 447 transitions, 2600 flow, removed 6 selfloop flow, removed 1 redundant places. [2021-12-06 18:59:53,435 INFO L242 Difference]: Finished difference. Result has 411 places, 384 transitions, 1867 flow [2021-12-06 18:59:53,435 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1969, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1867, PETRI_PLACES=411, PETRI_TRANSITIONS=384} [2021-12-06 18:59:53,435 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 117 predicate places. [2021-12-06 18:59:53,436 INFO L470 AbstractCegarLoop]: Abstraction has has 411 places, 384 transitions, 1867 flow [2021-12-06 18:59:53,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:53,436 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:59:53,436 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:59:53,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-06 18:59:53,436 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 18:59:53,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:59:53,436 INFO L85 PathProgramCache]: Analyzing trace with hash 356093413, now seen corresponding path program 2 times [2021-12-06 18:59:53,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:59:53,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912892665] [2021-12-06 18:59:53,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:59:53,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:59:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:53,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 18:59:53,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:59:53,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912892665] [2021-12-06 18:59:53,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912892665] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:59:53,483 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:59:53,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 18:59:53,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078592432] [2021-12-06 18:59:53,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:59:53,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 18:59:53,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:59:53,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 18:59:53,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:59:53,485 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2021-12-06 18:59:53,486 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 384 transitions, 1867 flow. Second operand has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:53,486 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:59:53,486 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2021-12-06 18:59:53,486 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:59:59,058 INFO L129 PetriNetUnfolder]: 3983/33918 cut-off events. [2021-12-06 18:59:59,058 INFO L130 PetriNetUnfolder]: For 54349/57035 co-relation queries the response was YES. [2021-12-06 18:59:59,374 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67534 conditions, 33918 events. 3983/33918 cut-off events. For 54349/57035 co-relation queries the response was YES. Maximal size of possible extension queue 1248. Compared 540872 event pairs, 1364 based on Foata normal form. 101/31309 useless extension candidates. Maximal degree in co-relation 67475. Up to 2983 conditions per place. [2021-12-06 18:59:59,434 INFO L132 encePairwiseOnDemand]: 326/332 looper letters, 72 selfloop transitions, 19 changer transitions 1/413 dead transitions. [2021-12-06 18:59:59,434 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 413 transitions, 2328 flow [2021-12-06 18:59:59,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:59:59,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-06 18:59:59,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1518 transitions. [2021-12-06 18:59:59,436 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9144578313253012 [2021-12-06 18:59:59,436 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1518 transitions. [2021-12-06 18:59:59,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1518 transitions. [2021-12-06 18:59:59,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:59:59,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1518 transitions. [2021-12-06 18:59:59,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 303.6) internal successors, (1518), 5 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:59,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:59,439 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:59,439 INFO L186 Difference]: Start difference. First operand has 411 places, 384 transitions, 1867 flow. Second operand 5 states and 1518 transitions. [2021-12-06 18:59:59,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 413 transitions, 2328 flow [2021-12-06 18:59:59,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 413 transitions, 2270 flow, removed 8 selfloop flow, removed 4 redundant places. [2021-12-06 18:59:59,806 INFO L242 Difference]: Finished difference. Result has 404 places, 390 transitions, 2018 flow [2021-12-06 18:59:59,806 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1824, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2018, PETRI_PLACES=404, PETRI_TRANSITIONS=390} [2021-12-06 18:59:59,807 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 110 predicate places. [2021-12-06 18:59:59,807 INFO L470 AbstractCegarLoop]: Abstraction has has 404 places, 390 transitions, 2018 flow [2021-12-06 18:59:59,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:59,807 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:59:59,807 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:59:59,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-06 18:59:59,807 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 18:59:59,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:59:59,808 INFO L85 PathProgramCache]: Analyzing trace with hash 456945269, now seen corresponding path program 3 times [2021-12-06 18:59:59,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:59:59,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292948043] [2021-12-06 18:59:59,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:59:59,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:59:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:59,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 18:59:59,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:59:59,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292948043] [2021-12-06 18:59:59,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292948043] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:59:59,852 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:59:59,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 18:59:59,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925083244] [2021-12-06 18:59:59,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:59:59,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 18:59:59,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:59:59,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 18:59:59,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:59:59,855 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2021-12-06 18:59:59,855 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 390 transitions, 2018 flow. Second operand has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:59:59,855 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:59:59,855 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2021-12-06 18:59:59,856 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:00:05,602 INFO L129 PetriNetUnfolder]: 4121/35530 cut-off events. [2021-12-06 19:00:05,603 INFO L130 PetriNetUnfolder]: For 55510/57505 co-relation queries the response was YES. [2021-12-06 19:00:05,950 INFO L84 FinitePrefix]: Finished finitePrefix Result has 70025 conditions, 35530 events. 4121/35530 cut-off events. For 55510/57505 co-relation queries the response was YES. Maximal size of possible extension queue 1368. Compared 577894 event pairs, 1322 based on Foata normal form. 108/32955 useless extension candidates. Maximal degree in co-relation 69966. Up to 2906 conditions per place. [2021-12-06 19:00:06,007 INFO L132 encePairwiseOnDemand]: 325/332 looper letters, 55 selfloop transitions, 30 changer transitions 3/409 dead transitions. [2021-12-06 19:00:06,007 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 409 transitions, 2300 flow [2021-12-06 19:00:06,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 19:00:06,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-06 19:00:06,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1522 transitions. [2021-12-06 19:00:06,009 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9168674698795181 [2021-12-06 19:00:06,009 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1522 transitions. [2021-12-06 19:00:06,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1522 transitions. [2021-12-06 19:00:06,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:00:06,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1522 transitions. [2021-12-06 19:00:06,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 304.4) internal successors, (1522), 5 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:06,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:06,012 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:06,012 INFO L186 Difference]: Start difference. First operand has 404 places, 390 transitions, 2018 flow. Second operand 5 states and 1522 transitions. [2021-12-06 19:00:06,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 409 transitions, 2300 flow [2021-12-06 19:00:06,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 409 transitions, 2273 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-12-06 19:00:06,464 INFO L242 Difference]: Finished difference. Result has 407 places, 391 transitions, 2113 flow [2021-12-06 19:00:06,465 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1983, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2113, PETRI_PLACES=407, PETRI_TRANSITIONS=391} [2021-12-06 19:00:06,465 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 113 predicate places. [2021-12-06 19:00:06,465 INFO L470 AbstractCegarLoop]: Abstraction has has 407 places, 391 transitions, 2113 flow [2021-12-06 19:00:06,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:06,465 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:00:06,465 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:00:06,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-06 19:00:06,466 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 19:00:06,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:00:06,466 INFO L85 PathProgramCache]: Analyzing trace with hash 417830507, now seen corresponding path program 4 times [2021-12-06 19:00:06,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:00:06,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889877701] [2021-12-06 19:00:06,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:00:06,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:00:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:00:06,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:00:06,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889877701] [2021-12-06 19:00:06,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889877701] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:00:06,509 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:00:06,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 19:00:06,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633014813] [2021-12-06 19:00:06,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:00:06,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:00:06,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:00:06,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:00:06,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:00:06,511 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2021-12-06 19:00:06,512 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 391 transitions, 2113 flow. Second operand has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:06,512 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:00:06,512 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2021-12-06 19:00:06,512 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:00:12,334 INFO L129 PetriNetUnfolder]: 3956/34868 cut-off events. [2021-12-06 19:00:12,335 INFO L130 PetriNetUnfolder]: For 59783/62033 co-relation queries the response was YES. [2021-12-06 19:00:12,705 INFO L84 FinitePrefix]: Finished finitePrefix Result has 70225 conditions, 34868 events. 3956/34868 cut-off events. For 59783/62033 co-relation queries the response was YES. Maximal size of possible extension queue 1228. Compared 558276 event pairs, 1378 based on Foata normal form. 89/32185 useless extension candidates. Maximal degree in co-relation 70166. Up to 2970 conditions per place. [2021-12-06 19:00:12,769 INFO L132 encePairwiseOnDemand]: 326/332 looper letters, 64 selfloop transitions, 21 changer transitions 3/409 dead transitions. [2021-12-06 19:00:12,769 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 409 transitions, 2384 flow [2021-12-06 19:00:12,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 19:00:12,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-06 19:00:12,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1518 transitions. [2021-12-06 19:00:12,772 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9144578313253012 [2021-12-06 19:00:12,772 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1518 transitions. [2021-12-06 19:00:12,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1518 transitions. [2021-12-06 19:00:12,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:00:12,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1518 transitions. [2021-12-06 19:00:12,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 303.6) internal successors, (1518), 5 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:12,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:12,776 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:12,776 INFO L186 Difference]: Start difference. First operand has 407 places, 391 transitions, 2113 flow. Second operand 5 states and 1518 transitions. [2021-12-06 19:00:12,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 409 transitions, 2384 flow [2021-12-06 19:00:13,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 409 transitions, 2370 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-06 19:00:13,195 INFO L242 Difference]: Finished difference. Result has 411 places, 392 transitions, 2154 flow [2021-12-06 19:00:13,196 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=2080, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2154, PETRI_PLACES=411, PETRI_TRANSITIONS=392} [2021-12-06 19:00:13,196 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 117 predicate places. [2021-12-06 19:00:13,196 INFO L470 AbstractCegarLoop]: Abstraction has has 411 places, 392 transitions, 2154 flow [2021-12-06 19:00:13,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:13,196 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:00:13,197 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:00:13,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-06 19:00:13,197 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 19:00:13,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:00:13,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1856016165, now seen corresponding path program 5 times [2021-12-06 19:00:13,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:00:13,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616045235] [2021-12-06 19:00:13,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:00:13,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:00:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:13,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:00:13,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:00:13,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616045235] [2021-12-06 19:00:13,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616045235] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:00:13,241 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:00:13,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 19:00:13,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149736004] [2021-12-06 19:00:13,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:00:13,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:00:13,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:00:13,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:00:13,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:00:13,243 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2021-12-06 19:00:13,244 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 392 transitions, 2154 flow. Second operand has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:13,244 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:00:13,244 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2021-12-06 19:00:13,244 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:00:18,336 INFO L129 PetriNetUnfolder]: 3567/30607 cut-off events. [2021-12-06 19:00:18,336 INFO L130 PetriNetUnfolder]: For 59037/61107 co-relation queries the response was YES. [2021-12-06 19:00:18,609 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63872 conditions, 30607 events. 3567/30607 cut-off events. For 59037/61107 co-relation queries the response was YES. Maximal size of possible extension queue 1148. Compared 482904 event pairs, 1186 based on Foata normal form. 164/28313 useless extension candidates. Maximal degree in co-relation 63812. Up to 2613 conditions per place. [2021-12-06 19:00:18,659 INFO L132 encePairwiseOnDemand]: 325/332 looper letters, 58 selfloop transitions, 27 changer transitions 6/412 dead transitions. [2021-12-06 19:00:18,659 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 412 transitions, 2415 flow [2021-12-06 19:00:18,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 19:00:18,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-06 19:00:18,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1525 transitions. [2021-12-06 19:00:18,661 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9186746987951807 [2021-12-06 19:00:18,661 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1525 transitions. [2021-12-06 19:00:18,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1525 transitions. [2021-12-06 19:00:18,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:00:18,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1525 transitions. [2021-12-06 19:00:18,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 305.0) internal successors, (1525), 5 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:18,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:18,664 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:18,664 INFO L186 Difference]: Start difference. First operand has 411 places, 392 transitions, 2154 flow. Second operand 5 states and 1525 transitions. [2021-12-06 19:00:18,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 412 transitions, 2415 flow [2021-12-06 19:00:19,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 412 transitions, 2382 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-12-06 19:00:19,024 INFO L242 Difference]: Finished difference. Result has 415 places, 393 transitions, 2222 flow [2021-12-06 19:00:19,024 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=2089, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2222, PETRI_PLACES=415, PETRI_TRANSITIONS=393} [2021-12-06 19:00:19,025 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 121 predicate places. [2021-12-06 19:00:19,025 INFO L470 AbstractCegarLoop]: Abstraction has has 415 places, 393 transitions, 2222 flow [2021-12-06 19:00:19,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:19,025 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:00:19,025 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:00:19,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-06 19:00:19,025 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 19:00:19,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:00:19,026 INFO L85 PathProgramCache]: Analyzing trace with hash -637055421, now seen corresponding path program 6 times [2021-12-06 19:00:19,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:00:19,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114537900] [2021-12-06 19:00:19,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:00:19,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:00:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:19,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:00:19,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:00:19,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114537900] [2021-12-06 19:00:19,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114537900] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:00:19,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:00:19,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 19:00:19,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228794414] [2021-12-06 19:00:19,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:00:19,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:00:19,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:00:19,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:00:19,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:00:19,075 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2021-12-06 19:00:19,076 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 393 transitions, 2222 flow. Second operand has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:19,076 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:00:19,076 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2021-12-06 19:00:19,076 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:00:24,505 INFO L129 PetriNetUnfolder]: 3827/32472 cut-off events. [2021-12-06 19:00:24,505 INFO L130 PetriNetUnfolder]: For 69288/71566 co-relation queries the response was YES. [2021-12-06 19:00:24,830 INFO L84 FinitePrefix]: Finished finitePrefix Result has 69685 conditions, 32472 events. 3827/32472 cut-off events. For 69288/71566 co-relation queries the response was YES. Maximal size of possible extension queue 1210. Compared 514937 event pairs, 1234 based on Foata normal form. 152/30038 useless extension candidates. Maximal degree in co-relation 69624. Up to 2946 conditions per place. [2021-12-06 19:00:24,889 INFO L132 encePairwiseOnDemand]: 326/332 looper letters, 70 selfloop transitions, 25 changer transitions 1/417 dead transitions. [2021-12-06 19:00:24,889 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 417 transitions, 2644 flow [2021-12-06 19:00:24,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 19:00:24,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-06 19:00:24,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1517 transitions. [2021-12-06 19:00:24,891 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9138554216867469 [2021-12-06 19:00:24,891 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1517 transitions. [2021-12-06 19:00:24,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1517 transitions. [2021-12-06 19:00:24,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:00:24,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1517 transitions. [2021-12-06 19:00:24,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 303.4) internal successors, (1517), 5 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:24,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:24,894 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:24,894 INFO L186 Difference]: Start difference. First operand has 415 places, 393 transitions, 2222 flow. Second operand 5 states and 1517 transitions. [2021-12-06 19:00:24,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 417 transitions, 2644 flow [2021-12-06 19:00:25,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 417 transitions, 2638 flow, removed 3 selfloop flow, removed 0 redundant places. [2021-12-06 19:00:25,290 INFO L242 Difference]: Finished difference. Result has 422 places, 400 transitions, 2493 flow [2021-12-06 19:00:25,290 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=2218, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2493, PETRI_PLACES=422, PETRI_TRANSITIONS=400} [2021-12-06 19:00:25,291 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 128 predicate places. [2021-12-06 19:00:25,291 INFO L470 AbstractCegarLoop]: Abstraction has has 422 places, 400 transitions, 2493 flow [2021-12-06 19:00:25,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:25,291 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:00:25,291 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:00:25,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-06 19:00:25,291 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 19:00:25,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:00:25,292 INFO L85 PathProgramCache]: Analyzing trace with hash 510125979, now seen corresponding path program 7 times [2021-12-06 19:00:25,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:00:25,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720750629] [2021-12-06 19:00:25,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:00:25,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:00:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:25,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:00:25,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:00:25,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720750629] [2021-12-06 19:00:25,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720750629] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:00:25,336 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:00:25,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 19:00:25,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667624529] [2021-12-06 19:00:25,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:00:25,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:00:25,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:00:25,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:00:25,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:00:25,338 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2021-12-06 19:00:25,339 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 400 transitions, 2493 flow. Second operand has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:25,339 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:00:25,339 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2021-12-06 19:00:25,339 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:00:31,128 INFO L129 PetriNetUnfolder]: 3864/34610 cut-off events. [2021-12-06 19:00:31,128 INFO L130 PetriNetUnfolder]: For 82527/85065 co-relation queries the response was YES. [2021-12-06 19:00:31,488 INFO L84 FinitePrefix]: Finished finitePrefix Result has 72582 conditions, 34610 events. 3864/34610 cut-off events. For 82527/85065 co-relation queries the response was YES. Maximal size of possible extension queue 1215. Compared 554288 event pairs, 1109 based on Foata normal form. 143/32041 useless extension candidates. Maximal degree in co-relation 72517. Up to 2847 conditions per place. [2021-12-06 19:00:31,547 INFO L132 encePairwiseOnDemand]: 325/332 looper letters, 63 selfloop transitions, 27 changer transitions 5/416 dead transitions. [2021-12-06 19:00:31,547 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 416 transitions, 2722 flow [2021-12-06 19:00:31,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 19:00:31,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-06 19:00:31,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1521 transitions. [2021-12-06 19:00:31,549 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9162650602409639 [2021-12-06 19:00:31,549 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1521 transitions. [2021-12-06 19:00:31,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1521 transitions. [2021-12-06 19:00:31,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:00:31,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1521 transitions. [2021-12-06 19:00:31,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 304.2) internal successors, (1521), 5 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:31,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:31,552 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:31,552 INFO L186 Difference]: Start difference. First operand has 422 places, 400 transitions, 2493 flow. Second operand 5 states and 1521 transitions. [2021-12-06 19:00:31,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 416 transitions, 2722 flow [2021-12-06 19:00:32,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 416 transitions, 2673 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-06 19:00:32,122 INFO L242 Difference]: Finished difference. Result has 423 places, 399 transitions, 2494 flow [2021-12-06 19:00:32,122 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=2411, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2494, PETRI_PLACES=423, PETRI_TRANSITIONS=399} [2021-12-06 19:00:32,123 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 129 predicate places. [2021-12-06 19:00:32,123 INFO L470 AbstractCegarLoop]: Abstraction has has 423 places, 399 transitions, 2494 flow [2021-12-06 19:00:32,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:32,123 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:00:32,123 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:00:32,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-06 19:00:32,123 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 19:00:32,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:00:32,123 INFO L85 PathProgramCache]: Analyzing trace with hash -192994127, now seen corresponding path program 8 times [2021-12-06 19:00:32,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:00:32,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936311638] [2021-12-06 19:00:32,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:00:32,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:00:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:00:32,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:00:32,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936311638] [2021-12-06 19:00:32,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936311638] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:00:32,166 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:00:32,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 19:00:32,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333337061] [2021-12-06 19:00:32,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:00:32,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:00:32,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:00:32,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:00:32,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:00:32,168 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2021-12-06 19:00:32,169 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 399 transitions, 2494 flow. Second operand has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:32,169 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:00:32,169 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2021-12-06 19:00:32,169 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:00:37,449 INFO L129 PetriNetUnfolder]: 3585/30462 cut-off events. [2021-12-06 19:00:37,449 INFO L130 PetriNetUnfolder]: For 81147/83226 co-relation queries the response was YES. [2021-12-06 19:00:37,736 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67921 conditions, 30462 events. 3585/30462 cut-off events. For 81147/83226 co-relation queries the response was YES. Maximal size of possible extension queue 1195. Compared 479189 event pairs, 1244 based on Foata normal form. 71/28063 useless extension candidates. Maximal degree in co-relation 67858. Up to 2698 conditions per place. [2021-12-06 19:00:37,793 INFO L132 encePairwiseOnDemand]: 325/332 looper letters, 63 selfloop transitions, 23 changer transitions 6/413 dead transitions. [2021-12-06 19:00:37,793 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 413 transitions, 2707 flow [2021-12-06 19:00:37,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 19:00:37,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-06 19:00:37,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1517 transitions. [2021-12-06 19:00:37,795 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9138554216867469 [2021-12-06 19:00:37,795 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1517 transitions. [2021-12-06 19:00:37,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1517 transitions. [2021-12-06 19:00:37,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:00:37,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1517 transitions. [2021-12-06 19:00:37,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 303.4) internal successors, (1517), 5 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:37,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:37,797 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:37,797 INFO L186 Difference]: Start difference. First operand has 423 places, 399 transitions, 2494 flow. Second operand 5 states and 1517 transitions. [2021-12-06 19:00:37,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 413 transitions, 2707 flow [2021-12-06 19:00:38,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 413 transitions, 2686 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-12-06 19:00:38,160 INFO L242 Difference]: Finished difference. Result has 427 places, 399 transitions, 2512 flow [2021-12-06 19:00:38,161 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=2444, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2512, PETRI_PLACES=427, PETRI_TRANSITIONS=399} [2021-12-06 19:00:38,161 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 133 predicate places. [2021-12-06 19:00:38,161 INFO L470 AbstractCegarLoop]: Abstraction has has 427 places, 399 transitions, 2512 flow [2021-12-06 19:00:38,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:38,161 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:00:38,161 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:00:38,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-06 19:00:38,162 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 19:00:38,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:00:38,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1180182667, now seen corresponding path program 3 times [2021-12-06 19:00:38,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:00:38,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203279829] [2021-12-06 19:00:38,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:00:38,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:00:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:38,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:00:38,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:00:38,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203279829] [2021-12-06 19:00:38,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203279829] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:00:38,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:00:38,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 19:00:38,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425323136] [2021-12-06 19:00:38,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:00:38,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 19:00:38,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:00:38,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 19:00:38,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 19:00:38,193 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2021-12-06 19:00:38,194 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 399 transitions, 2512 flow. Second operand has 4 states, 4 states have (on average 298.25) internal successors, (1193), 4 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:38,194 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:00:38,194 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2021-12-06 19:00:38,194 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:00:43,484 INFO L129 PetriNetUnfolder]: 3532/31524 cut-off events. [2021-12-06 19:00:43,485 INFO L130 PetriNetUnfolder]: For 82493/84699 co-relation queries the response was YES. [2021-12-06 19:00:43,782 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65838 conditions, 31524 events. 3532/31524 cut-off events. For 82493/84699 co-relation queries the response was YES. Maximal size of possible extension queue 1154. Compared 501449 event pairs, 1064 based on Foata normal form. 296/29230 useless extension candidates. Maximal degree in co-relation 65774. Up to 2711 conditions per place. [2021-12-06 19:00:43,829 INFO L132 encePairwiseOnDemand]: 325/332 looper letters, 62 selfloop transitions, 30 changer transitions 6/419 dead transitions. [2021-12-06 19:00:43,830 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 419 transitions, 2795 flow [2021-12-06 19:00:43,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 19:00:43,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-06 19:00:43,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1524 transitions. [2021-12-06 19:00:43,831 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9180722891566265 [2021-12-06 19:00:43,831 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1524 transitions. [2021-12-06 19:00:43,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1524 transitions. [2021-12-06 19:00:43,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:00:43,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1524 transitions. [2021-12-06 19:00:43,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 304.8) internal successors, (1524), 5 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:43,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:43,834 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:43,834 INFO L186 Difference]: Start difference. First operand has 427 places, 399 transitions, 2512 flow. Second operand 5 states and 1524 transitions. [2021-12-06 19:00:43,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 419 transitions, 2795 flow [2021-12-06 19:00:44,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 419 transitions, 2708 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-06 19:00:44,209 INFO L242 Difference]: Finished difference. Result has 428 places, 398 transitions, 2492 flow [2021-12-06 19:00:44,209 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=2407, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2492, PETRI_PLACES=428, PETRI_TRANSITIONS=398} [2021-12-06 19:00:44,210 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 134 predicate places. [2021-12-06 19:00:44,210 INFO L470 AbstractCegarLoop]: Abstraction has has 428 places, 398 transitions, 2492 flow [2021-12-06 19:00:44,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.25) internal successors, (1193), 4 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:44,210 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:00:44,210 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:00:44,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-06 19:00:44,210 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 19:00:44,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:00:44,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1196823173, now seen corresponding path program 4 times [2021-12-06 19:00:44,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:00:44,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8758134] [2021-12-06 19:00:44,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:00:44,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:00:44,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:44,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:00:44,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:00:44,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8758134] [2021-12-06 19:00:44,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8758134] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:00:44,241 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:00:44,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 19:00:44,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310861219] [2021-12-06 19:00:44,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:00:44,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 19:00:44,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:00:44,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 19:00:44,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 19:00:44,243 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2021-12-06 19:00:44,243 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 398 transitions, 2492 flow. Second operand has 4 states, 4 states have (on average 298.25) internal successors, (1193), 4 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:44,244 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:00:44,244 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2021-12-06 19:00:44,244 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:00:49,325 INFO L129 PetriNetUnfolder]: 3456/30984 cut-off events. [2021-12-06 19:00:49,325 INFO L130 PetriNetUnfolder]: For 68079/70040 co-relation queries the response was YES. [2021-12-06 19:00:49,627 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64030 conditions, 30984 events. 3456/30984 cut-off events. For 68079/70040 co-relation queries the response was YES. Maximal size of possible extension queue 1101. Compared 487878 event pairs, 1140 based on Foata normal form. 81/28480 useless extension candidates. Maximal degree in co-relation 63966. Up to 2596 conditions per place. [2021-12-06 19:00:49,671 INFO L132 encePairwiseOnDemand]: 328/332 looper letters, 63 selfloop transitions, 11 changer transitions 21/402 dead transitions. [2021-12-06 19:00:49,671 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 402 transitions, 2627 flow [2021-12-06 19:00:49,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 19:00:49,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-06 19:00:49,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1208 transitions. [2021-12-06 19:00:49,673 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9096385542168675 [2021-12-06 19:00:49,673 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1208 transitions. [2021-12-06 19:00:49,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1208 transitions. [2021-12-06 19:00:49,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:00:49,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1208 transitions. [2021-12-06 19:00:49,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:49,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:49,675 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:49,675 INFO L186 Difference]: Start difference. First operand has 428 places, 398 transitions, 2492 flow. Second operand 4 states and 1208 transitions. [2021-12-06 19:00:49,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 402 transitions, 2627 flow [2021-12-06 19:00:50,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 402 transitions, 2589 flow, removed 10 selfloop flow, removed 1 redundant places. [2021-12-06 19:00:50,074 INFO L242 Difference]: Finished difference. Result has 430 places, 377 transitions, 2242 flow [2021-12-06 19:00:50,074 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=2412, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2242, PETRI_PLACES=430, PETRI_TRANSITIONS=377} [2021-12-06 19:00:50,074 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 136 predicate places. [2021-12-06 19:00:50,074 INFO L470 AbstractCegarLoop]: Abstraction has has 430 places, 377 transitions, 2242 flow [2021-12-06 19:00:50,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.25) internal successors, (1193), 4 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:50,075 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:00:50,075 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:00:50,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-06 19:00:50,075 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 19:00:50,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:00:50,075 INFO L85 PathProgramCache]: Analyzing trace with hash -652340719, now seen corresponding path program 9 times [2021-12-06 19:00:50,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:00:50,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470462294] [2021-12-06 19:00:50,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:00:50,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:00:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:50,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:00:50,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:00:50,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470462294] [2021-12-06 19:00:50,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470462294] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:00:50,109 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:00:50,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 19:00:50,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123548578] [2021-12-06 19:00:50,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:00:50,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:00:50,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:00:50,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:00:50,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:00:50,111 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2021-12-06 19:00:50,112 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 377 transitions, 2242 flow. Second operand has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:50,112 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:00:50,112 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2021-12-06 19:00:50,112 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:00:54,691 INFO L129 PetriNetUnfolder]: 3016/26544 cut-off events. [2021-12-06 19:00:54,691 INFO L130 PetriNetUnfolder]: For 63379/64960 co-relation queries the response was YES. [2021-12-06 19:00:54,920 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54496 conditions, 26544 events. 3016/26544 cut-off events. For 63379/64960 co-relation queries the response was YES. Maximal size of possible extension queue 920. Compared 403990 event pairs, 887 based on Foata normal form. 102/24338 useless extension candidates. Maximal degree in co-relation 54432. Up to 2071 conditions per place. [2021-12-06 19:00:54,962 INFO L132 encePairwiseOnDemand]: 328/332 looper letters, 67 selfloop transitions, 12 changer transitions 4/390 dead transitions. [2021-12-06 19:00:54,962 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 390 transitions, 2415 flow [2021-12-06 19:00:54,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 19:00:54,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-06 19:00:54,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1511 transitions. [2021-12-06 19:00:54,964 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9102409638554216 [2021-12-06 19:00:54,964 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1511 transitions. [2021-12-06 19:00:54,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1511 transitions. [2021-12-06 19:00:54,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:00:54,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1511 transitions. [2021-12-06 19:00:54,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 302.2) internal successors, (1511), 5 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:54,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:54,966 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:54,966 INFO L186 Difference]: Start difference. First operand has 430 places, 377 transitions, 2242 flow. Second operand 5 states and 1511 transitions. [2021-12-06 19:00:54,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 390 transitions, 2415 flow [2021-12-06 19:00:55,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 390 transitions, 2348 flow, removed 21 selfloop flow, removed 7 redundant places. [2021-12-06 19:00:55,263 INFO L242 Difference]: Finished difference. Result has 420 places, 375 transitions, 2145 flow [2021-12-06 19:00:55,263 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=2145, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2145, PETRI_PLACES=420, PETRI_TRANSITIONS=375} [2021-12-06 19:00:55,264 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 126 predicate places. [2021-12-06 19:00:55,264 INFO L470 AbstractCegarLoop]: Abstraction has has 420 places, 375 transitions, 2145 flow [2021-12-06 19:00:55,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:55,264 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:00:55,264 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:00:55,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-06 19:00:55,264 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 19:00:55,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:00:55,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1656226875, now seen corresponding path program 10 times [2021-12-06 19:00:55,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:00:55,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568286275] [2021-12-06 19:00:55,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:00:55,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:00:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:55,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:00:55,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:00:55,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568286275] [2021-12-06 19:00:55,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568286275] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:00:55,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:00:55,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 19:00:55,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662206017] [2021-12-06 19:00:55,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:00:55,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:00:55,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:00:55,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:00:55,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:00:55,305 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2021-12-06 19:00:55,305 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 375 transitions, 2145 flow. Second operand has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:55,306 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:00:55,306 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2021-12-06 19:00:55,306 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:00:59,463 INFO L129 PetriNetUnfolder]: 2848/24910 cut-off events. [2021-12-06 19:00:59,463 INFO L130 PetriNetUnfolder]: For 54175/54853 co-relation queries the response was YES. [2021-12-06 19:00:59,693 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49624 conditions, 24910 events. 2848/24910 cut-off events. For 54175/54853 co-relation queries the response was YES. Maximal size of possible extension queue 873. Compared 375266 event pairs, 889 based on Foata normal form. 89/22855 useless extension candidates. Maximal degree in co-relation 49565. Up to 1893 conditions per place. [2021-12-06 19:00:59,741 INFO L132 encePairwiseOnDemand]: 327/332 looper letters, 58 selfloop transitions, 18 changer transitions 2/385 dead transitions. [2021-12-06 19:00:59,741 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 385 transitions, 2301 flow [2021-12-06 19:00:59,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 19:00:59,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-06 19:00:59,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1511 transitions. [2021-12-06 19:00:59,743 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9102409638554216 [2021-12-06 19:00:59,744 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1511 transitions. [2021-12-06 19:00:59,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1511 transitions. [2021-12-06 19:00:59,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:00:59,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1511 transitions. [2021-12-06 19:00:59,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 302.2) internal successors, (1511), 5 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:59,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:59,747 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:00:59,747 INFO L186 Difference]: Start difference. First operand has 420 places, 375 transitions, 2145 flow. Second operand 5 states and 1511 transitions. [2021-12-06 19:00:59,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 424 places, 385 transitions, 2301 flow [2021-12-06 19:01:00,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 385 transitions, 2284 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-12-06 19:01:00,012 INFO L242 Difference]: Finished difference. Result has 422 places, 374 transitions, 2136 flow [2021-12-06 19:01:00,012 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=2100, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2136, PETRI_PLACES=422, PETRI_TRANSITIONS=374} [2021-12-06 19:01:00,013 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 128 predicate places. [2021-12-06 19:01:00,013 INFO L470 AbstractCegarLoop]: Abstraction has has 422 places, 374 transitions, 2136 flow [2021-12-06 19:01:00,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:00,013 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:01:00,013 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:01:00,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-06 19:01:00,014 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 19:01:00,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:01:00,014 INFO L85 PathProgramCache]: Analyzing trace with hash 145945165, now seen corresponding path program 11 times [2021-12-06 19:01:00,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:01:00,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802727759] [2021-12-06 19:01:00,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:01:00,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:01:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:00,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:01:00,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:01:00,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802727759] [2021-12-06 19:01:00,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802727759] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:01:00,057 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:01:00,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 19:01:00,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93987377] [2021-12-06 19:01:00,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:01:00,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:01:00,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:01:00,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:01:00,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:01:00,060 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2021-12-06 19:01:00,061 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 374 transitions, 2136 flow. Second operand has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:00,061 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:01:00,061 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2021-12-06 19:01:00,061 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:01:04,234 INFO L129 PetriNetUnfolder]: 2842/24904 cut-off events. [2021-12-06 19:01:04,234 INFO L130 PetriNetUnfolder]: For 53381/54014 co-relation queries the response was YES. [2021-12-06 19:01:04,431 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49724 conditions, 24904 events. 2842/24904 cut-off events. For 53381/54014 co-relation queries the response was YES. Maximal size of possible extension queue 873. Compared 375069 event pairs, 875 based on Foata normal form. 75/22844 useless extension candidates. Maximal degree in co-relation 49665. Up to 1893 conditions per place. [2021-12-06 19:01:04,471 INFO L132 encePairwiseOnDemand]: 326/332 looper letters, 57 selfloop transitions, 18 changer transitions 1/383 dead transitions. [2021-12-06 19:01:04,472 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 383 transitions, 2285 flow [2021-12-06 19:01:04,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 19:01:04,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-06 19:01:04,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1509 transitions. [2021-12-06 19:01:04,473 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9090361445783133 [2021-12-06 19:01:04,473 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1509 transitions. [2021-12-06 19:01:04,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1509 transitions. [2021-12-06 19:01:04,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:01:04,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1509 transitions. [2021-12-06 19:01:04,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 301.8) internal successors, (1509), 5 states have internal predecessors, (1509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:04,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:04,476 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:04,476 INFO L186 Difference]: Start difference. First operand has 422 places, 374 transitions, 2136 flow. Second operand 5 states and 1509 transitions. [2021-12-06 19:01:04,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 383 transitions, 2285 flow [2021-12-06 19:01:04,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 383 transitions, 2280 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-06 19:01:04,688 INFO L242 Difference]: Finished difference. Result has 425 places, 373 transitions, 2139 flow [2021-12-06 19:01:04,688 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=2103, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2139, PETRI_PLACES=425, PETRI_TRANSITIONS=373} [2021-12-06 19:01:04,688 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 131 predicate places. [2021-12-06 19:01:04,688 INFO L470 AbstractCegarLoop]: Abstraction has has 425 places, 373 transitions, 2139 flow [2021-12-06 19:01:04,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:04,689 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:01:04,689 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:01:04,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-12-06 19:01:04,689 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 19:01:04,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:01:04,689 INFO L85 PathProgramCache]: Analyzing trace with hash 224541353, now seen corresponding path program 12 times [2021-12-06 19:01:04,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:01:04,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620533130] [2021-12-06 19:01:04,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:01:04,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:01:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:04,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:01:04,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:01:04,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620533130] [2021-12-06 19:01:04,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620533130] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:01:04,722 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:01:04,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 19:01:04,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170938571] [2021-12-06 19:01:04,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:01:04,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:01:04,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:01:04,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:01:04,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:01:04,724 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2021-12-06 19:01:04,725 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 373 transitions, 2139 flow. Second operand has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:04,725 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:01:04,725 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2021-12-06 19:01:04,725 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:01:08,568 INFO L129 PetriNetUnfolder]: 2802/24154 cut-off events. [2021-12-06 19:01:08,568 INFO L130 PetriNetUnfolder]: For 54845/55460 co-relation queries the response was YES. [2021-12-06 19:01:08,813 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49054 conditions, 24154 events. 2802/24154 cut-off events. For 54845/55460 co-relation queries the response was YES. Maximal size of possible extension queue 850. Compared 360967 event pairs, 917 based on Foata normal form. 84/22120 useless extension candidates. Maximal degree in co-relation 48995. Up to 1843 conditions per place. [2021-12-06 19:01:08,995 INFO L132 encePairwiseOnDemand]: 328/332 looper letters, 59 selfloop transitions, 9 changer transitions 6/381 dead transitions. [2021-12-06 19:01:08,995 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 381 transitions, 2280 flow [2021-12-06 19:01:08,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 19:01:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-06 19:01:08,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1505 transitions. [2021-12-06 19:01:08,996 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9066265060240963 [2021-12-06 19:01:08,996 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1505 transitions. [2021-12-06 19:01:08,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1505 transitions. [2021-12-06 19:01:08,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:01:08,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1505 transitions. [2021-12-06 19:01:08,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 301.0) internal successors, (1505), 5 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:08,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:08,999 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:08,999 INFO L186 Difference]: Start difference. First operand has 425 places, 373 transitions, 2139 flow. Second operand 5 states and 1505 transitions. [2021-12-06 19:01:08,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 381 transitions, 2280 flow [2021-12-06 19:01:09,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 381 transitions, 2258 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-06 19:01:09,206 INFO L242 Difference]: Finished difference. Result has 426 places, 370 transitions, 2063 flow [2021-12-06 19:01:09,206 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=2088, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2063, PETRI_PLACES=426, PETRI_TRANSITIONS=370} [2021-12-06 19:01:09,206 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 132 predicate places. [2021-12-06 19:01:09,206 INFO L470 AbstractCegarLoop]: Abstraction has has 426 places, 370 transitions, 2063 flow [2021-12-06 19:01:09,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:09,207 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:01:09,207 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:01:09,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-12-06 19:01:09,207 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 19:01:09,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:01:09,207 INFO L85 PathProgramCache]: Analyzing trace with hash 264364042, now seen corresponding path program 1 times [2021-12-06 19:01:09,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:01:09,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443712490] [2021-12-06 19:01:09,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:01:09,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:01:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:09,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:01:09,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:01:09,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443712490] [2021-12-06 19:01:09,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443712490] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:01:09,257 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:01:09,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 19:01:09,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091642033] [2021-12-06 19:01:09,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:01:09,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:01:09,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:01:09,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:01:09,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:01:09,259 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 332 [2021-12-06 19:01:09,260 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 370 transitions, 2063 flow. Second operand has 7 states, 7 states have (on average 266.7142857142857) internal successors, (1867), 7 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:09,260 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:01:09,260 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 332 [2021-12-06 19:01:09,260 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:01:12,155 INFO L129 PetriNetUnfolder]: 2376/15834 cut-off events. [2021-12-06 19:01:12,155 INFO L130 PetriNetUnfolder]: For 20673/22772 co-relation queries the response was YES. [2021-12-06 19:01:12,280 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30442 conditions, 15834 events. 2376/15834 cut-off events. For 20673/22772 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 219141 event pairs, 1360 based on Foata normal form. 45/14085 useless extension candidates. Maximal degree in co-relation 30383. Up to 3868 conditions per place. [2021-12-06 19:01:12,311 INFO L132 encePairwiseOnDemand]: 321/332 looper letters, 63 selfloop transitions, 8 changer transitions 50/399 dead transitions. [2021-12-06 19:01:12,311 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 399 transitions, 2388 flow [2021-12-06 19:01:12,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 19:01:12,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-06 19:01:12,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2714 transitions. [2021-12-06 19:01:12,314 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8174698795180723 [2021-12-06 19:01:12,314 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2714 transitions. [2021-12-06 19:01:12,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2714 transitions. [2021-12-06 19:01:12,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:01:12,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2714 transitions. [2021-12-06 19:01:12,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 271.4) internal successors, (2714), 10 states have internal predecessors, (2714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:12,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 332.0) internal successors, (3652), 11 states have internal predecessors, (3652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:12,319 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 332.0) internal successors, (3652), 11 states have internal predecessors, (3652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:12,319 INFO L186 Difference]: Start difference. First operand has 426 places, 370 transitions, 2063 flow. Second operand 10 states and 2714 transitions. [2021-12-06 19:01:12,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 399 transitions, 2388 flow [2021-12-06 19:01:12,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 399 transitions, 2298 flow, removed 13 selfloop flow, removed 8 redundant places. [2021-12-06 19:01:12,402 INFO L242 Difference]: Finished difference. Result has 428 places, 347 transitions, 1853 flow [2021-12-06 19:01:12,403 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1959, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1853, PETRI_PLACES=428, PETRI_TRANSITIONS=347} [2021-12-06 19:01:12,403 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 134 predicate places. [2021-12-06 19:01:12,403 INFO L470 AbstractCegarLoop]: Abstraction has has 428 places, 347 transitions, 1853 flow [2021-12-06 19:01:12,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 266.7142857142857) internal successors, (1867), 7 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:12,403 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:01:12,404 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:01:12,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-12-06 19:01:12,404 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 19:01:12,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:01:12,404 INFO L85 PathProgramCache]: Analyzing trace with hash 765531025, now seen corresponding path program 1 times [2021-12-06 19:01:12,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:01:12,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831986808] [2021-12-06 19:01:12,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:01:12,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:01:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:12,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:01:12,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:01:12,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831986808] [2021-12-06 19:01:12,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831986808] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:01:12,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102821460] [2021-12-06 19:01:12,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:01:12,502 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:01:12,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:01:12,503 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:01:12,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 19:01:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:12,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-06 19:01:12,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:01:12,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:01:12,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:01:13,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:01:13,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102821460] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-06 19:01:13,283 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-06 19:01:13,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 11] total 23 [2021-12-06 19:01:13,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421236180] [2021-12-06 19:01:13,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:01:13,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 19:01:13,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:01:13,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 19:01:13,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2021-12-06 19:01:13,287 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 332 [2021-12-06 19:01:13,290 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 347 transitions, 1853 flow. Second operand has 11 states, 11 states have (on average 260.45454545454544) internal successors, (2865), 11 states have internal predecessors, (2865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:13,290 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:01:13,290 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 332 [2021-12-06 19:01:13,290 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:01:18,616 INFO L129 PetriNetUnfolder]: 8600/33049 cut-off events. [2021-12-06 19:01:18,616 INFO L130 PetriNetUnfolder]: For 21412/22725 co-relation queries the response was YES. [2021-12-06 19:01:18,917 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58776 conditions, 33049 events. 8600/33049 cut-off events. For 21412/22725 co-relation queries the response was YES. Maximal size of possible extension queue 1390. Compared 457788 event pairs, 2457 based on Foata normal form. 165/28729 useless extension candidates. Maximal degree in co-relation 58717. Up to 3381 conditions per place. [2021-12-06 19:01:18,993 INFO L132 encePairwiseOnDemand]: 316/332 looper letters, 104 selfloop transitions, 20 changer transitions 1/397 dead transitions. [2021-12-06 19:01:18,993 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 397 transitions, 2291 flow [2021-12-06 19:01:18,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 19:01:18,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-06 19:01:18,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3693 transitions. [2021-12-06 19:01:18,997 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7945352839931153 [2021-12-06 19:01:18,997 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3693 transitions. [2021-12-06 19:01:18,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3693 transitions. [2021-12-06 19:01:18,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:01:18,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3693 transitions. [2021-12-06 19:01:19,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 263.7857142857143) internal successors, (3693), 14 states have internal predecessors, (3693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:19,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 332.0) internal successors, (4980), 15 states have internal predecessors, (4980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:19,003 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 332.0) internal successors, (4980), 15 states have internal predecessors, (4980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:19,003 INFO L186 Difference]: Start difference. First operand has 428 places, 347 transitions, 1853 flow. Second operand 14 states and 3693 transitions. [2021-12-06 19:01:19,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 397 transitions, 2291 flow [2021-12-06 19:01:19,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 397 transitions, 2218 flow, removed 14 selfloop flow, removed 22 redundant places. [2021-12-06 19:01:19,102 INFO L242 Difference]: Finished difference. Result has 409 places, 351 transitions, 1847 flow [2021-12-06 19:01:19,103 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1786, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1847, PETRI_PLACES=409, PETRI_TRANSITIONS=351} [2021-12-06 19:01:19,103 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 115 predicate places. [2021-12-06 19:01:19,103 INFO L470 AbstractCegarLoop]: Abstraction has has 409 places, 351 transitions, 1847 flow [2021-12-06 19:01:19,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 260.45454545454544) internal successors, (2865), 11 states have internal predecessors, (2865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:19,103 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:01:19,103 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:01:19,123 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 19:01:19,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-12-06 19:01:19,305 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 19:01:19,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:01:19,307 INFO L85 PathProgramCache]: Analyzing trace with hash -31038152, now seen corresponding path program 1 times [2021-12-06 19:01:19,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:01:19,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783553677] [2021-12-06 19:01:19,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:01:19,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:01:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:19,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:01:19,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:01:19,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783553677] [2021-12-06 19:01:19,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783553677] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:01:19,395 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:01:19,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 19:01:19,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597145826] [2021-12-06 19:01:19,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:01:19,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:01:19,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:01:19,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:01:19,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:01:19,398 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 332 [2021-12-06 19:01:19,399 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 351 transitions, 1847 flow. Second operand has 7 states, 7 states have (on average 267.2857142857143) internal successors, (1871), 7 states have internal predecessors, (1871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:19,399 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:01:19,399 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 332 [2021-12-06 19:01:19,399 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:01:21,591 INFO L129 PetriNetUnfolder]: 2726/13903 cut-off events. [2021-12-06 19:01:21,591 INFO L130 PetriNetUnfolder]: For 11619/12132 co-relation queries the response was YES. [2021-12-06 19:01:21,698 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24745 conditions, 13903 events. 2726/13903 cut-off events. For 11619/12132 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 182519 event pairs, 1409 based on Foata normal form. 112/12214 useless extension candidates. Maximal degree in co-relation 24695. Up to 2976 conditions per place. [2021-12-06 19:01:21,722 INFO L132 encePairwiseOnDemand]: 323/332 looper letters, 63 selfloop transitions, 7 changer transitions 22/370 dead transitions. [2021-12-06 19:01:21,722 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 370 transitions, 2090 flow [2021-12-06 19:01:21,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 19:01:21,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-12-06 19:01:21,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2169 transitions. [2021-12-06 19:01:21,723 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8166415662650602 [2021-12-06 19:01:21,724 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2169 transitions. [2021-12-06 19:01:21,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2169 transitions. [2021-12-06 19:01:21,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:01:21,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2169 transitions. [2021-12-06 19:01:21,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 271.125) internal successors, (2169), 8 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:21,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 332.0) internal successors, (2988), 9 states have internal predecessors, (2988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:21,727 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 332.0) internal successors, (2988), 9 states have internal predecessors, (2988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:21,727 INFO L186 Difference]: Start difference. First operand has 409 places, 351 transitions, 1847 flow. Second operand 8 states and 2169 transitions. [2021-12-06 19:01:21,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 370 transitions, 2090 flow [2021-12-06 19:01:21,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 370 transitions, 2068 flow, removed 0 selfloop flow, removed 8 redundant places. [2021-12-06 19:01:21,756 INFO L242 Difference]: Finished difference. Result has 408 places, 346 transitions, 1810 flow [2021-12-06 19:01:21,756 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1817, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1810, PETRI_PLACES=408, PETRI_TRANSITIONS=346} [2021-12-06 19:01:21,757 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 114 predicate places. [2021-12-06 19:01:21,757 INFO L470 AbstractCegarLoop]: Abstraction has has 408 places, 346 transitions, 1810 flow [2021-12-06 19:01:21,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 267.2857142857143) internal successors, (1871), 7 states have internal predecessors, (1871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:21,757 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:01:21,757 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:01:21,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-12-06 19:01:21,757 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 19:01:21,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:01:21,758 INFO L85 PathProgramCache]: Analyzing trace with hash -617182980, now seen corresponding path program 1 times [2021-12-06 19:01:21,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:01:21,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819280586] [2021-12-06 19:01:21,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:01:21,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:01:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:21,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 19:01:21,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:01:21,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819280586] [2021-12-06 19:01:21,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819280586] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:01:21,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447610590] [2021-12-06 19:01:21,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:01:21,893 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:01:21,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:01:21,894 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:01:21,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 19:01:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:21,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-06 19:01:21,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:01:22,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 19:01:22,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:01:22,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 19:01:22,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447610590] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-06 19:01:22,744 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-06 19:01:22,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 13] total 28 [2021-12-06 19:01:22,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805638491] [2021-12-06 19:01:22,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:01:22,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-06 19:01:22,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:01:22,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-06 19:01:22,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2021-12-06 19:01:22,748 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 332 [2021-12-06 19:01:22,750 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 346 transitions, 1810 flow. Second operand has 13 states, 13 states have (on average 236.53846153846155) internal successors, (3075), 13 states have internal predecessors, (3075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:22,750 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:01:22,750 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 332 [2021-12-06 19:01:22,750 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:01:25,341 INFO L129 PetriNetUnfolder]: 3049/14751 cut-off events. [2021-12-06 19:01:25,342 INFO L130 PetriNetUnfolder]: For 10029/10792 co-relation queries the response was YES. [2021-12-06 19:01:25,436 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25881 conditions, 14751 events. 3049/14751 cut-off events. For 10029/10792 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 187657 event pairs, 1001 based on Foata normal form. 356/13394 useless extension candidates. Maximal degree in co-relation 25830. Up to 1844 conditions per place. [2021-12-06 19:01:25,466 INFO L132 encePairwiseOnDemand]: 306/332 looper letters, 121 selfloop transitions, 35 changer transitions 4/414 dead transitions. [2021-12-06 19:01:25,466 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 414 transitions, 2390 flow [2021-12-06 19:01:25,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-06 19:01:25,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2021-12-06 19:01:25,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 5459 transitions. [2021-12-06 19:01:25,471 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.714903090623363 [2021-12-06 19:01:25,471 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 5459 transitions. [2021-12-06 19:01:25,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 5459 transitions. [2021-12-06 19:01:25,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:01:25,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 5459 transitions. [2021-12-06 19:01:25,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 237.34782608695653) internal successors, (5459), 23 states have internal predecessors, (5459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:25,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 332.0) internal successors, (7968), 24 states have internal predecessors, (7968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:25,481 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 332.0) internal successors, (7968), 24 states have internal predecessors, (7968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:25,481 INFO L186 Difference]: Start difference. First operand has 408 places, 346 transitions, 1810 flow. Second operand 23 states and 5459 transitions. [2021-12-06 19:01:25,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 414 transitions, 2390 flow [2021-12-06 19:01:25,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 418 places, 414 transitions, 2338 flow, removed 10 selfloop flow, removed 8 redundant places. [2021-12-06 19:01:25,519 INFO L242 Difference]: Finished difference. Result has 428 places, 358 transitions, 1966 flow [2021-12-06 19:01:25,519 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1782, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1966, PETRI_PLACES=428, PETRI_TRANSITIONS=358} [2021-12-06 19:01:25,520 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 134 predicate places. [2021-12-06 19:01:25,520 INFO L470 AbstractCegarLoop]: Abstraction has has 428 places, 358 transitions, 1966 flow [2021-12-06 19:01:25,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 236.53846153846155) internal successors, (3075), 13 states have internal predecessors, (3075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:25,520 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:01:25,520 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:01:25,540 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-06 19:01:25,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-12-06 19:01:25,722 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 19:01:25,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:01:25,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1897506566, now seen corresponding path program 1 times [2021-12-06 19:01:25,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:01:25,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169292113] [2021-12-06 19:01:25,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:01:25,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:01:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:25,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 19:01:25,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:01:25,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169292113] [2021-12-06 19:01:25,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169292113] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:01:25,795 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:01:25,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 19:01:25,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339756712] [2021-12-06 19:01:25,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:01:25,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 19:01:25,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:01:25,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 19:01:25,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 19:01:25,797 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2021-12-06 19:01:25,798 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 358 transitions, 1966 flow. Second operand has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:25,798 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:01:25,798 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2021-12-06 19:01:25,798 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:01:26,903 INFO L129 PetriNetUnfolder]: 815/6879 cut-off events. [2021-12-06 19:01:26,903 INFO L130 PetriNetUnfolder]: For 13685/13839 co-relation queries the response was YES. [2021-12-06 19:01:26,961 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13992 conditions, 6879 events. 815/6879 cut-off events. For 13685/13839 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 80149 event pairs, 324 based on Foata normal form. 40/6341 useless extension candidates. Maximal degree in co-relation 13934. Up to 637 conditions per place. [2021-12-06 19:01:26,973 INFO L132 encePairwiseOnDemand]: 327/332 looper letters, 49 selfloop transitions, 6 changer transitions 22/372 dead transitions. [2021-12-06 19:01:26,974 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 372 transitions, 2160 flow [2021-12-06 19:01:26,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 19:01:26,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-06 19:01:26,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1513 transitions. [2021-12-06 19:01:26,975 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9114457831325301 [2021-12-06 19:01:26,975 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1513 transitions. [2021-12-06 19:01:26,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1513 transitions. [2021-12-06 19:01:26,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:01:26,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1513 transitions. [2021-12-06 19:01:26,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 302.6) internal successors, (1513), 5 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:26,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:26,978 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:26,978 INFO L186 Difference]: Start difference. First operand has 428 places, 358 transitions, 1966 flow. Second operand 5 states and 1513 transitions. [2021-12-06 19:01:26,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 372 transitions, 2160 flow [2021-12-06 19:01:27,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 372 transitions, 2116 flow, removed 5 selfloop flow, removed 14 redundant places. [2021-12-06 19:01:27,024 INFO L242 Difference]: Finished difference. Result has 415 places, 346 transitions, 1678 flow [2021-12-06 19:01:27,025 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1887, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1678, PETRI_PLACES=415, PETRI_TRANSITIONS=346} [2021-12-06 19:01:27,025 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 121 predicate places. [2021-12-06 19:01:27,025 INFO L470 AbstractCegarLoop]: Abstraction has has 415 places, 346 transitions, 1678 flow [2021-12-06 19:01:27,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:27,025 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:01:27,025 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:01:27,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-12-06 19:01:27,025 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 19:01:27,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:01:27,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1370912353, now seen corresponding path program 1 times [2021-12-06 19:01:27,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:01:27,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789997963] [2021-12-06 19:01:27,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:01:27,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:01:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:27,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 19:01:27,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:01:27,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789997963] [2021-12-06 19:01:27,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789997963] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:01:27,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469495515] [2021-12-06 19:01:27,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:01:27,121 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:01:27,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:01:27,121 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:01:27,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 19:01:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:27,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-06 19:01:27,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:01:27,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 19:01:27,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:01:28,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 19:01:28,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469495515] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-06 19:01:28,013 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-06 19:01:28,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 11] total 23 [2021-12-06 19:01:28,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138294310] [2021-12-06 19:01:28,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:01:28,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 19:01:28,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:01:28,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 19:01:28,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2021-12-06 19:01:28,016 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 332 [2021-12-06 19:01:28,017 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 346 transitions, 1678 flow. Second operand has 11 states, 11 states have (on average 260.90909090909093) internal successors, (2870), 11 states have internal predecessors, (2870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:28,017 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:01:28,017 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 332 [2021-12-06 19:01:28,017 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:01:30,653 INFO L129 PetriNetUnfolder]: 3885/15328 cut-off events. [2021-12-06 19:01:30,654 INFO L130 PetriNetUnfolder]: For 10518/11462 co-relation queries the response was YES. [2021-12-06 19:01:30,745 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28391 conditions, 15328 events. 3885/15328 cut-off events. For 10518/11462 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 189132 event pairs, 1052 based on Foata normal form. 496/13652 useless extension candidates. Maximal degree in co-relation 28336. Up to 1838 conditions per place. [2021-12-06 19:01:30,777 INFO L132 encePairwiseOnDemand]: 315/332 looper letters, 122 selfloop transitions, 18 changer transitions 0/402 dead transitions. [2021-12-06 19:01:30,777 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 402 transitions, 2151 flow [2021-12-06 19:01:30,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 19:01:30,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-06 19:01:30,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3965 transitions. [2021-12-06 19:01:30,780 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7961847389558233 [2021-12-06 19:01:30,780 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3965 transitions. [2021-12-06 19:01:30,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3965 transitions. [2021-12-06 19:01:30,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:01:30,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3965 transitions. [2021-12-06 19:01:30,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 264.3333333333333) internal successors, (3965), 15 states have internal predecessors, (3965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:30,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 332.0) internal successors, (5312), 16 states have internal predecessors, (5312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:30,786 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 332.0) internal successors, (5312), 16 states have internal predecessors, (5312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:30,786 INFO L186 Difference]: Start difference. First operand has 415 places, 346 transitions, 1678 flow. Second operand 15 states and 3965 transitions. [2021-12-06 19:01:30,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 402 transitions, 2151 flow [2021-12-06 19:01:30,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 402 transitions, 2077 flow, removed 5 selfloop flow, removed 7 redundant places. [2021-12-06 19:01:30,827 INFO L242 Difference]: Finished difference. Result has 424 places, 350 transitions, 1661 flow [2021-12-06 19:01:30,827 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1661, PETRI_PLACES=424, PETRI_TRANSITIONS=350} [2021-12-06 19:01:30,827 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 130 predicate places. [2021-12-06 19:01:30,827 INFO L470 AbstractCegarLoop]: Abstraction has has 424 places, 350 transitions, 1661 flow [2021-12-06 19:01:30,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 260.90909090909093) internal successors, (2870), 11 states have internal predecessors, (2870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:30,828 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:01:30,828 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:01:30,848 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-06 19:01:31,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-12-06 19:01:31,030 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 19:01:31,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:01:31,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1147262345, now seen corresponding path program 1 times [2021-12-06 19:01:31,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:01:31,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399132225] [2021-12-06 19:01:31,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:01:31,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:01:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:31,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 19:01:31,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:01:31,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399132225] [2021-12-06 19:01:31,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399132225] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:01:31,123 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:01:31,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 19:01:31,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614554106] [2021-12-06 19:01:31,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:01:31,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:01:31,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:01:31,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:01:31,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:01:31,126 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 332 [2021-12-06 19:01:31,127 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 350 transitions, 1661 flow. Second operand has 7 states, 7 states have (on average 267.85714285714283) internal successors, (1875), 7 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:31,127 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:01:31,127 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 332 [2021-12-06 19:01:31,127 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:01:32,374 INFO L129 PetriNetUnfolder]: 1778/7221 cut-off events. [2021-12-06 19:01:32,374 INFO L130 PetriNetUnfolder]: For 5633/6093 co-relation queries the response was YES. [2021-12-06 19:01:32,436 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14117 conditions, 7221 events. 1778/7221 cut-off events. For 5633/6093 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 77602 event pairs, 915 based on Foata normal form. 206/6447 useless extension candidates. Maximal degree in co-relation 14063. Up to 2154 conditions per place. [2021-12-06 19:01:32,447 INFO L132 encePairwiseOnDemand]: 321/332 looper letters, 60 selfloop transitions, 8 changer transitions 39/373 dead transitions. [2021-12-06 19:01:32,447 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 373 transitions, 1932 flow [2021-12-06 19:01:32,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 19:01:32,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-06 19:01:32,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2703 transitions. [2021-12-06 19:01:32,450 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.814156626506024 [2021-12-06 19:01:32,450 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2703 transitions. [2021-12-06 19:01:32,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2703 transitions. [2021-12-06 19:01:32,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:01:32,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2703 transitions. [2021-12-06 19:01:32,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 270.3) internal successors, (2703), 10 states have internal predecessors, (2703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:32,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 332.0) internal successors, (3652), 11 states have internal predecessors, (3652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:32,454 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 332.0) internal successors, (3652), 11 states have internal predecessors, (3652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:32,454 INFO L186 Difference]: Start difference. First operand has 424 places, 350 transitions, 1661 flow. Second operand 10 states and 2703 transitions. [2021-12-06 19:01:32,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 373 transitions, 1932 flow [2021-12-06 19:01:32,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 373 transitions, 1906 flow, removed 2 selfloop flow, removed 10 redundant places. [2021-12-06 19:01:32,486 INFO L242 Difference]: Finished difference. Result has 425 places, 332 transitions, 1543 flow [2021-12-06 19:01:32,486 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1619, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1543, PETRI_PLACES=425, PETRI_TRANSITIONS=332} [2021-12-06 19:01:32,487 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 131 predicate places. [2021-12-06 19:01:32,487 INFO L470 AbstractCegarLoop]: Abstraction has has 425 places, 332 transitions, 1543 flow [2021-12-06 19:01:32,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 267.85714285714283) internal successors, (1875), 7 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:32,487 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:01:32,487 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:01:32,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-12-06 19:01:32,487 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 19:01:32,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:01:32,488 INFO L85 PathProgramCache]: Analyzing trace with hash -2003965576, now seen corresponding path program 1 times [2021-12-06 19:01:32,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:01:32,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636414801] [2021-12-06 19:01:32,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:01:32,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:01:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:32,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 19:01:32,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:01:32,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636414801] [2021-12-06 19:01:32,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636414801] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:01:32,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243828173] [2021-12-06 19:01:32,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:01:32,572 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:01:32,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:01:32,573 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:01:32,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 19:01:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:32,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-06 19:01:32,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:01:32,946 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 19:01:32,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:01:33,324 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 19:01:33,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243828173] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-06 19:01:33,324 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-06 19:01:33,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11, 11] total 23 [2021-12-06 19:01:33,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249432941] [2021-12-06 19:01:33,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:01:33,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 19:01:33,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:01:33,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 19:01:33,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2021-12-06 19:01:33,328 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 332 [2021-12-06 19:01:33,329 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 332 transitions, 1543 flow. Second operand has 11 states, 11 states have (on average 261.0) internal successors, (2871), 11 states have internal predecessors, (2871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:33,330 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:01:33,330 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 332 [2021-12-06 19:01:33,330 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:01:34,884 INFO L129 PetriNetUnfolder]: 2367/9267 cut-off events. [2021-12-06 19:01:34,884 INFO L130 PetriNetUnfolder]: For 6819/7650 co-relation queries the response was YES. [2021-12-06 19:01:34,956 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17931 conditions, 9267 events. 2367/9267 cut-off events. For 6819/7650 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 105350 event pairs, 874 based on Foata normal form. 693/9046 useless extension candidates. Maximal degree in co-relation 17877. Up to 2277 conditions per place. [2021-12-06 19:01:34,977 INFO L132 encePairwiseOnDemand]: 316/332 looper letters, 71 selfloop transitions, 15 changer transitions 0/346 dead transitions. [2021-12-06 19:01:34,978 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 346 transitions, 1776 flow [2021-12-06 19:01:34,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 19:01:34,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-06 19:01:34,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3917 transitions. [2021-12-06 19:01:34,980 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7865461847389559 [2021-12-06 19:01:34,980 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3917 transitions. [2021-12-06 19:01:34,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3917 transitions. [2021-12-06 19:01:34,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:01:34,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3917 transitions. [2021-12-06 19:01:34,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 261.1333333333333) internal successors, (3917), 15 states have internal predecessors, (3917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:34,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 332.0) internal successors, (5312), 16 states have internal predecessors, (5312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:34,985 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 332.0) internal successors, (5312), 16 states have internal predecessors, (5312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:34,985 INFO L186 Difference]: Start difference. First operand has 425 places, 332 transitions, 1543 flow. Second operand 15 states and 3917 transitions. [2021-12-06 19:01:34,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 346 transitions, 1776 flow [2021-12-06 19:01:35,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 346 transitions, 1681 flow, removed 9 selfloop flow, removed 23 redundant places. [2021-12-06 19:01:35,022 INFO L242 Difference]: Finished difference. Result has 405 places, 333 transitions, 1496 flow [2021-12-06 19:01:35,022 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1496, PETRI_PLACES=405, PETRI_TRANSITIONS=333} [2021-12-06 19:01:35,022 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 111 predicate places. [2021-12-06 19:01:35,022 INFO L470 AbstractCegarLoop]: Abstraction has has 405 places, 333 transitions, 1496 flow [2021-12-06 19:01:35,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 261.0) internal successors, (2871), 11 states have internal predecessors, (2871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:35,022 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:01:35,023 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:01:35,042 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-06 19:01:35,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2021-12-06 19:01:35,224 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 19:01:35,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:01:35,225 INFO L85 PathProgramCache]: Analyzing trace with hash -362618567, now seen corresponding path program 1 times [2021-12-06 19:01:35,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:01:35,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822565966] [2021-12-06 19:01:35,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:01:35,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:01:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:35,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 19:01:35,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:01:35,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822565966] [2021-12-06 19:01:35,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822565966] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:01:35,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776879867] [2021-12-06 19:01:35,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:01:35,349 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:01:35,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:01:35,350 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:01:35,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-06 19:01:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:35,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-06 19:01:35,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:01:35,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 19:01:35,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:01:36,196 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 19:01:36,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776879867] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:01:36,196 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:01:36,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 34 [2021-12-06 19:01:36,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406535156] [2021-12-06 19:01:36,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:01:36,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-06 19:01:36,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:01:36,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-06 19:01:36,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=997, Unknown=0, NotChecked=0, Total=1122 [2021-12-06 19:01:36,202 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 332 [2021-12-06 19:01:36,205 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 333 transitions, 1496 flow. Second operand has 34 states, 34 states have (on average 222.73529411764707) internal successors, (7573), 34 states have internal predecessors, (7573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:36,205 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:01:36,205 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 332 [2021-12-06 19:01:36,205 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:01:46,496 INFO L129 PetriNetUnfolder]: 14424/53115 cut-off events. [2021-12-06 19:01:46,496 INFO L130 PetriNetUnfolder]: For 36268/41711 co-relation queries the response was YES. [2021-12-06 19:01:46,973 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105636 conditions, 53115 events. 14424/53115 cut-off events. For 36268/41711 co-relation queries the response was YES. Maximal size of possible extension queue 2477. Compared 796593 event pairs, 2489 based on Foata normal form. 4479/54356 useless extension candidates. Maximal degree in co-relation 105590. Up to 5661 conditions per place. [2021-12-06 19:01:47,072 INFO L132 encePairwiseOnDemand]: 293/332 looper letters, 512 selfloop transitions, 136 changer transitions 66/942 dead transitions. [2021-12-06 19:01:47,072 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 505 places, 942 transitions, 5249 flow [2021-12-06 19:01:47,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2021-12-06 19:01:47,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2021-12-06 19:01:47,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 22477 transitions. [2021-12-06 19:01:47,085 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6703149230585709 [2021-12-06 19:01:47,085 INFO L72 ComplementDD]: Start complementDD. Operand 101 states and 22477 transitions. [2021-12-06 19:01:47,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 22477 transitions. [2021-12-06 19:01:47,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:01:47,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 101 states and 22477 transitions. [2021-12-06 19:01:47,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 102 states, 101 states have (on average 222.54455445544554) internal successors, (22477), 101 states have internal predecessors, (22477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:47,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 102 states, 102 states have (on average 332.0) internal successors, (33864), 102 states have internal predecessors, (33864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:47,123 INFO L81 ComplementDD]: Finished complementDD. Result has 102 states, 102 states have (on average 332.0) internal successors, (33864), 102 states have internal predecessors, (33864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:47,123 INFO L186 Difference]: Start difference. First operand has 405 places, 333 transitions, 1496 flow. Second operand 101 states and 22477 transitions. [2021-12-06 19:01:47,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 505 places, 942 transitions, 5249 flow [2021-12-06 19:01:47,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 493 places, 942 transitions, 5159 flow, removed 0 selfloop flow, removed 12 redundant places. [2021-12-06 19:01:47,216 INFO L242 Difference]: Finished difference. Result has 548 places, 452 transitions, 2639 flow [2021-12-06 19:01:47,216 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=101, PETRI_FLOW=2639, PETRI_PLACES=548, PETRI_TRANSITIONS=452} [2021-12-06 19:01:47,217 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 254 predicate places. [2021-12-06 19:01:47,217 INFO L470 AbstractCegarLoop]: Abstraction has has 548 places, 452 transitions, 2639 flow [2021-12-06 19:01:47,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 222.73529411764707) internal successors, (7573), 34 states have internal predecessors, (7573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:47,217 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:01:47,218 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:01:47,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-06 19:01:47,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2021-12-06 19:01:47,419 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 19:01:47,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:01:47,420 INFO L85 PathProgramCache]: Analyzing trace with hash -2091108997, now seen corresponding path program 1 times [2021-12-06 19:01:47,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:01:47,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812267707] [2021-12-06 19:01:47,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:01:47,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:01:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:47,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 19:01:47,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:01:47,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812267707] [2021-12-06 19:01:47,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812267707] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:01:47,511 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:01:47,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 19:01:47,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125718406] [2021-12-06 19:01:47,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:01:47,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 19:01:47,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:01:47,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 19:01:47,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:01:47,513 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 332 [2021-12-06 19:01:47,514 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 452 transitions, 2639 flow. Second operand has 6 states, 6 states have (on average 276.3333333333333) internal successors, (1658), 6 states have internal predecessors, (1658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:47,514 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:01:47,514 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 332 [2021-12-06 19:01:47,514 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:01:51,925 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([930] thread3EXIT-->L125-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem39#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} AuxVars[] AssignedVars[][477], [Black: 500#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 1792#(<= ~count2~0 ~count3~0), 1889#(<= ~count1~0 ~count3~0), Black: 1812#(and (or (< ~count3~0 (+ ~count1~0 1)) (<= ~count2~0 ~count1~0)) (not (= ~count3~0 ~count1~0))), Black: 539#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count2~0 1) ~count3~0)), Black: 1822#(and (or (< ~count3~0 (+ ~count1~0 1)) (<= ~count2~0 ~count1~0)) (not (= ~count3~0 ~count1~0))), Black: 1821#(not (= ~count3~0 ~count1~0)), 4066#(or (<= ~n2~0 ~n3~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|)), 5828#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (< thread1Thread1of1ForFork1_~i~0 ~n1~0) (< thread1Thread1of1ForFork1_~i~0 ~n2~0)), Black: 1839#(and (or (< ~count3~0 (+ ~count1~0 1)) (<= ~count2~0 ~count1~0)) (not (= ~count3~0 ~count1~0))), Black: 553#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), Black: 7222#(and (<= 1 ~n2~0) (<= 1 ~n3~0) (< thread2Thread1of1ForFork2_~i~1 ~n2~0) (< thread2Thread1of1ForFork2_~i~1 ~n3~0)), Black: 559#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 316#(= thread1Thread1of1ForFork1_~stop~0 0), Black: 573#(<= (+ ~count3~0 1) ~count2~0), Black: 1855#(not (= ~count3~0 ~count1~0)), Black: 326#(= thread3Thread1of1ForFork0_~stop~2 0), Black: 583#(<= ~count1~0 ~count2~0), Black: 580#true, Black: 1872#(and (not (= ~count3~0 ~count1~0)) (or (<= ~count3~0 ~count2~0) (< ~count3~0 (+ ~count1~0 1)))), 585#(and (<= ~count3~0 ~count2~0) (<= ~count1~0 ~count2~0)), 1864#(or (<= ~count3~0 ~count2~0) (< ~count3~0 (+ ~count1~0 1))), 311#true, Black: 3180#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 8755#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 361#(and (<= 0 ~n1~0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))), 1883#(and (<= ~count1~0 ~count3~0) (<= ~count2~0 ~count3~0)), 479#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), Black: 8807#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8763#(and (<= ~n2~0 1) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1)))), Black: 8815#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8665#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (< ~res1~0 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~res2~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 8787#(and (<= ~n2~0 1) (<= ~n1~0 1) (< 0 ~n2~0)), 1811#(or (< ~count3~0 (+ ~count1~0 1)) (<= ~count2~0 ~count1~0)), Black: 8759#(and (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8689#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) (< ~res1~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 5859#(and (<= 1 ~n2~0) (<= 1 ~n3~0)), Black: 4456#(and (<= ~res2~0 0) (or (<= ~n2~0 ~n3~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|))), Black: 8749#(and (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8821#(and (< ~res1~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8837#(and (<= ~n2~0 1) (<= ~res2~0 0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8783#(and (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1)))), Black: 8811#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8745#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8685#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~res1~0 1) (<= ~res2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8809#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8819#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8775#(and (<= ~n2~0 1) (<= ~res2~0 0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8781#(and (< ~res1~0 1) (<= ~n1~0 1) (< 0 ~n2~0)), Black: 8765#(and (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8730#(and (< ~res1~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8769#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8833#(and (<= ~n2~0 1) (<= ~res2~0 0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8747#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8693#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) (< ~res1~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8831#(and (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8777#(and (<= ~n2~0 1) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8835#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8659#(and (< ~res1~0 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~res2~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 8791#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (< 0 ~n2~0)), Black: 8825#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~res2~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8761#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8827#(and (< ~res1~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8709#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~res1~0 1) (<= ~res2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8789#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1)))), Black: 8817#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8661#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (< ~res1~0 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~res2~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 8743#(and (< ~res1~0 1) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1)))), Black: 8741#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1)))), Black: 7552#(and (<= ~n1~0 1) (< 0 ~n2~0)), Black: 8829#(and (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 395#(<= ~res1~0 0), Black: 8753#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~res2~0 0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8757#(and (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8813#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 407#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 8699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~res1~0 1) (<= ~res2~0 0) (or (<= ~n1~0 1) (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8797#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (< 0 ~n2~0)), Black: 8773#(and (<= ~n2~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0)), 545#(<= ~count1~0 ~count3~0), Black: 8655#(and (< ~res1~0 1) (<= ~res2~0 0)), Black: 8823#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8705#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~res1~0 1) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8839#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8653#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~res2~0 0)), Black: 8719#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8751#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0)), 3166#(and (<= 1 ~n1~0) (< thread3Thread1of1ForFork0_~i~2 ~n1~0) (< thread3Thread1of1ForFork0_~i~2 ~n3~0) (<= 1 ~n3~0)), Black: 8805#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1848#(< ~count3~0 (+ ~count1~0 1)), 1770#(and (<= 1 ~n1~0) (or (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n3~0 1) ~n1~0)) (or (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ ~n3~0 1) ~n1~0))), Black: 452#(and (= |thread3Thread1of1ForFork0_#t~ite21| 1) (= ~res3~0 1)), 1831#(< ~count3~0 (+ ~count1~0 1)), Black: 447#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 448#(= ~res3~0 1), 94#L125-2true, Black: 477#(<= ~count1~0 ~count2~0), Black: 476#(<= ~count1~0 ~count3~0), Black: 485#true, 8896#true]) [2021-12-06 19:01:51,925 INFO L384 tUnfolder$Statistics]: this new event has 233 ancestors and is not cut-off event [2021-12-06 19:01:51,925 INFO L387 tUnfolder$Statistics]: existing Event has 233 ancestors and is not cut-off event [2021-12-06 19:01:51,925 INFO L387 tUnfolder$Statistics]: existing Event has 234 ancestors and is not cut-off event [2021-12-06 19:01:51,925 INFO L387 tUnfolder$Statistics]: existing Event has 234 ancestors and is not cut-off event [2021-12-06 19:01:51,983 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([930] thread3EXIT-->L125-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem39#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} AuxVars[] AssignedVars[][477], [Black: 500#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 1792#(<= ~count2~0 ~count3~0), 1889#(<= ~count1~0 ~count3~0), Black: 1812#(and (or (< ~count3~0 (+ ~count1~0 1)) (<= ~count2~0 ~count1~0)) (not (= ~count3~0 ~count1~0))), Black: 539#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count2~0 1) ~count3~0)), Black: 1822#(and (or (< ~count3~0 (+ ~count1~0 1)) (<= ~count2~0 ~count1~0)) (not (= ~count3~0 ~count1~0))), Black: 1821#(not (= ~count3~0 ~count1~0)), 4066#(or (<= ~n2~0 ~n3~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|)), 5828#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (< thread1Thread1of1ForFork1_~i~0 ~n1~0) (< thread1Thread1of1ForFork1_~i~0 ~n2~0)), Black: 1839#(and (or (< ~count3~0 (+ ~count1~0 1)) (<= ~count2~0 ~count1~0)) (not (= ~count3~0 ~count1~0))), Black: 553#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), Black: 559#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 5859#(and (<= 1 ~n2~0) (<= 1 ~n3~0)), Black: 316#(= thread1Thread1of1ForFork1_~stop~0 0), Black: 573#(<= (+ ~count3~0 1) ~count2~0), Black: 321#(= thread2Thread1of1ForFork2_~stop~1 0), Black: 1855#(not (= ~count3~0 ~count1~0)), Black: 326#(= thread3Thread1of1ForFork0_~stop~2 0), Black: 583#(<= ~count1~0 ~count2~0), Black: 580#true, Black: 1872#(and (not (= ~count3~0 ~count1~0)) (or (<= ~count3~0 ~count2~0) (< ~count3~0 (+ ~count1~0 1)))), 585#(and (<= ~count3~0 ~count2~0) (<= ~count1~0 ~count2~0)), 1864#(or (<= ~count3~0 ~count2~0) (< ~count3~0 (+ ~count1~0 1))), 311#true, Black: 3180#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 361#(and (<= 0 ~n1~0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))), 1883#(and (<= ~count1~0 ~count3~0) (<= ~count2~0 ~count3~0)), 479#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), Black: 8807#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8763#(and (<= ~n2~0 1) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1)))), Black: 8815#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8665#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (< ~res1~0 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~res2~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 8787#(and (<= ~n2~0 1) (<= ~n1~0 1) (< 0 ~n2~0)), 1811#(or (< ~count3~0 (+ ~count1~0 1)) (<= ~count2~0 ~count1~0)), Black: 8759#(and (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8689#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) (< ~res1~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4456#(and (<= ~res2~0 0) (or (<= ~n2~0 ~n3~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|))), Black: 8749#(and (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8821#(and (< ~res1~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8837#(and (<= ~n2~0 1) (<= ~res2~0 0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8783#(and (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1)))), Black: 8811#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8745#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8685#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~res1~0 1) (<= ~res2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8809#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8819#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8775#(and (<= ~n2~0 1) (<= ~res2~0 0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8781#(and (< ~res1~0 1) (<= ~n1~0 1) (< 0 ~n2~0)), Black: 8765#(and (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8730#(and (< ~res1~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8769#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8833#(and (<= ~n2~0 1) (<= ~res2~0 0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8747#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8693#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) (< ~res1~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8831#(and (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8777#(and (<= ~n2~0 1) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8835#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8659#(and (< ~res1~0 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~res2~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 8791#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (< 0 ~n2~0)), Black: 8825#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~res2~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8827#(and (< ~res1~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8709#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~res1~0 1) (<= ~res2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8789#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1)))), Black: 8817#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8661#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (< ~res1~0 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~res2~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 8743#(and (< ~res1~0 1) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1)))), Black: 8741#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1)))), Black: 7552#(and (<= ~n1~0 1) (< 0 ~n2~0)), Black: 8829#(and (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 395#(<= ~res1~0 0), Black: 8753#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~res2~0 0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8757#(and (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8813#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 407#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 8699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~res1~0 1) (<= ~res2~0 0) (or (<= ~n1~0 1) (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8797#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (< 0 ~n2~0)), Black: 8773#(and (<= ~n2~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0)), 545#(<= ~count1~0 ~count3~0), Black: 8655#(and (< ~res1~0 1) (<= ~res2~0 0)), Black: 8823#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8705#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~res1~0 1) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8839#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8755#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8653#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~res2~0 0)), Black: 8719#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8751#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0)), 3166#(and (<= 1 ~n1~0) (< thread3Thread1of1ForFork0_~i~2 ~n1~0) (< thread3Thread1of1ForFork0_~i~2 ~n3~0) (<= 1 ~n3~0)), Black: 8805#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1848#(< ~count3~0 (+ ~count1~0 1)), 8761#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1770#(and (<= 1 ~n1~0) (or (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n3~0 1) ~n1~0)) (or (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ ~n3~0 1) ~n1~0))), Black: 452#(and (= |thread3Thread1of1ForFork0_#t~ite21| 1) (= ~res3~0 1)), 1831#(< ~count3~0 (+ ~count1~0 1)), Black: 447#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 448#(= ~res3~0 1), 94#L125-2true, Black: 477#(<= ~count1~0 ~count2~0), Black: 476#(<= ~count1~0 ~count3~0), Black: 485#true, 8896#true]) [2021-12-06 19:01:51,983 INFO L384 tUnfolder$Statistics]: this new event has 237 ancestors and is not cut-off event [2021-12-06 19:01:51,983 INFO L387 tUnfolder$Statistics]: existing Event has 237 ancestors and is not cut-off event [2021-12-06 19:01:51,983 INFO L387 tUnfolder$Statistics]: existing Event has 238 ancestors and is not cut-off event [2021-12-06 19:01:51,983 INFO L387 tUnfolder$Statistics]: existing Event has 238 ancestors and is not cut-off event [2021-12-06 19:01:51,993 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([930] thread3EXIT-->L125-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem39#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} AuxVars[] AssignedVars[][477], [Black: 500#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 1792#(<= ~count2~0 ~count3~0), 1889#(<= ~count1~0 ~count3~0), Black: 1812#(and (or (< ~count3~0 (+ ~count1~0 1)) (<= ~count2~0 ~count1~0)) (not (= ~count3~0 ~count1~0))), Black: 539#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count2~0 1) ~count3~0)), Black: 1822#(and (or (< ~count3~0 (+ ~count1~0 1)) (<= ~count2~0 ~count1~0)) (not (= ~count3~0 ~count1~0))), Black: 1821#(not (= ~count3~0 ~count1~0)), 4066#(or (<= ~n2~0 ~n3~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|)), 5828#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (< thread1Thread1of1ForFork1_~i~0 ~n1~0) (< thread1Thread1of1ForFork1_~i~0 ~n2~0)), Black: 1839#(and (or (< ~count3~0 (+ ~count1~0 1)) (<= ~count2~0 ~count1~0)) (not (= ~count3~0 ~count1~0))), Black: 553#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), Black: 559#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 5859#(and (<= 1 ~n2~0) (<= 1 ~n3~0)), Black: 316#(= thread1Thread1of1ForFork1_~stop~0 0), Black: 573#(<= (+ ~count3~0 1) ~count2~0), Black: 321#(= thread2Thread1of1ForFork2_~stop~1 0), Black: 1855#(not (= ~count3~0 ~count1~0)), Black: 326#(= thread3Thread1of1ForFork0_~stop~2 0), Black: 583#(<= ~count1~0 ~count2~0), Black: 580#true, Black: 1872#(and (not (= ~count3~0 ~count1~0)) (or (<= ~count3~0 ~count2~0) (< ~count3~0 (+ ~count1~0 1)))), 585#(and (<= ~count3~0 ~count2~0) (<= ~count1~0 ~count2~0)), 1864#(or (<= ~count3~0 ~count2~0) (< ~count3~0 (+ ~count1~0 1))), 311#true, Black: 3180#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 361#(and (<= 0 ~n1~0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))), 1883#(and (<= ~count1~0 ~count3~0) (<= ~count2~0 ~count3~0)), 479#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), Black: 8807#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8763#(and (<= ~n2~0 1) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1)))), Black: 8815#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8665#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (< ~res1~0 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~res2~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 8787#(and (<= ~n2~0 1) (<= ~n1~0 1) (< 0 ~n2~0)), 1811#(or (< ~count3~0 (+ ~count1~0 1)) (<= ~count2~0 ~count1~0)), Black: 8759#(and (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 4456#(and (<= ~res2~0 0) (or (<= ~n2~0 ~n3~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|))), Black: 8689#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) (< ~res1~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8749#(and (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8821#(and (< ~res1~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8837#(and (<= ~n2~0 1) (<= ~res2~0 0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8783#(and (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1)))), Black: 8811#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8745#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8685#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~res1~0 1) (<= ~res2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8809#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8819#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8775#(and (<= ~n2~0 1) (<= ~res2~0 0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8781#(and (< ~res1~0 1) (<= ~n1~0 1) (< 0 ~n2~0)), Black: 8765#(and (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8730#(and (< ~res1~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8769#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8833#(and (<= ~n2~0 1) (<= ~res2~0 0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8693#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) (< ~res1~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8831#(and (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8777#(and (<= ~n2~0 1) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8835#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8659#(and (< ~res1~0 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~res2~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 8791#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (< 0 ~n2~0)), Black: 8825#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~res2~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8761#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8827#(and (< ~res1~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8709#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~res1~0 1) (<= ~res2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8789#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1)))), Black: 8817#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8661#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (< ~res1~0 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~res2~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 8743#(and (< ~res1~0 1) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1)))), Black: 8741#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1)))), Black: 7552#(and (<= ~n1~0 1) (< 0 ~n2~0)), Black: 8829#(and (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 395#(<= ~res1~0 0), Black: 8753#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~res2~0 0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8757#(and (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= thread2Thread1of1ForFork2_~i~1 0)), 8747#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8813#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 407#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 8699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~res1~0 1) (<= ~res2~0 0) (or (<= ~n1~0 1) (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8797#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (< 0 ~n2~0)), Black: 8773#(and (<= ~n2~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0)), 545#(<= ~count1~0 ~count3~0), Black: 8655#(and (< ~res1~0 1) (<= ~res2~0 0)), Black: 8823#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8705#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~res1~0 1) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8839#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8755#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8653#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~res2~0 0)), Black: 8719#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8751#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0)), 3166#(and (<= 1 ~n1~0) (< thread3Thread1of1ForFork0_~i~2 ~n1~0) (< thread3Thread1of1ForFork0_~i~2 ~n3~0) (<= 1 ~n3~0)), Black: 8805#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1848#(< ~count3~0 (+ ~count1~0 1)), 1770#(and (<= 1 ~n1~0) (or (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n3~0 1) ~n1~0)) (or (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ ~n3~0 1) ~n1~0))), Black: 452#(and (= |thread3Thread1of1ForFork0_#t~ite21| 1) (= ~res3~0 1)), 1831#(< ~count3~0 (+ ~count1~0 1)), Black: 447#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 448#(= ~res3~0 1), 94#L125-2true, Black: 477#(<= ~count1~0 ~count2~0), Black: 476#(<= ~count1~0 ~count3~0), Black: 485#true, 8896#true]) [2021-12-06 19:01:51,993 INFO L384 tUnfolder$Statistics]: this new event has 238 ancestors and is not cut-off event [2021-12-06 19:01:51,993 INFO L387 tUnfolder$Statistics]: existing Event has 239 ancestors and is not cut-off event [2021-12-06 19:01:51,993 INFO L387 tUnfolder$Statistics]: existing Event has 238 ancestors and is not cut-off event [2021-12-06 19:01:51,993 INFO L387 tUnfolder$Statistics]: existing Event has 239 ancestors and is not cut-off event [2021-12-06 19:01:52,045 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([930] thread3EXIT-->L125-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem39#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} AuxVars[] AssignedVars[][477], [Black: 500#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 1792#(<= ~count2~0 ~count3~0), 1889#(<= ~count1~0 ~count3~0), Black: 1812#(and (or (< ~count3~0 (+ ~count1~0 1)) (<= ~count2~0 ~count1~0)) (not (= ~count3~0 ~count1~0))), Black: 539#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count2~0 1) ~count3~0)), Black: 1822#(and (or (< ~count3~0 (+ ~count1~0 1)) (<= ~count2~0 ~count1~0)) (not (= ~count3~0 ~count1~0))), Black: 1821#(not (= ~count3~0 ~count1~0)), 4066#(or (<= ~n2~0 ~n3~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|)), 5828#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (< thread1Thread1of1ForFork1_~i~0 ~n1~0) (< thread1Thread1of1ForFork1_~i~0 ~n2~0)), Black: 1839#(and (or (< ~count3~0 (+ ~count1~0 1)) (<= ~count2~0 ~count1~0)) (not (= ~count3~0 ~count1~0))), Black: 553#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), Black: 559#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 5859#(and (<= 1 ~n2~0) (<= 1 ~n3~0)), Black: 316#(= thread1Thread1of1ForFork1_~stop~0 0), Black: 573#(<= (+ ~count3~0 1) ~count2~0), Black: 321#(= thread2Thread1of1ForFork2_~stop~1 0), Black: 1855#(not (= ~count3~0 ~count1~0)), Black: 326#(= thread3Thread1of1ForFork0_~stop~2 0), Black: 583#(<= ~count1~0 ~count2~0), Black: 580#true, Black: 1872#(and (not (= ~count3~0 ~count1~0)) (or (<= ~count3~0 ~count2~0) (< ~count3~0 (+ ~count1~0 1)))), 585#(and (<= ~count3~0 ~count2~0) (<= ~count1~0 ~count2~0)), 1864#(or (<= ~count3~0 ~count2~0) (< ~count3~0 (+ ~count1~0 1))), 311#true, Black: 3180#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 361#(and (<= 0 ~n1~0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))), 1883#(and (<= ~count1~0 ~count3~0) (<= ~count2~0 ~count3~0)), 479#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), Black: 8807#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8763#(and (<= ~n2~0 1) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1)))), Black: 8815#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8665#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (< ~res1~0 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~res2~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 8787#(and (<= ~n2~0 1) (<= ~n1~0 1) (< 0 ~n2~0)), 1811#(or (< ~count3~0 (+ ~count1~0 1)) (<= ~count2~0 ~count1~0)), Black: 8759#(and (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8689#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) (< ~res1~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4456#(and (<= ~res2~0 0) (or (<= ~n2~0 ~n3~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|))), Black: 8749#(and (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8821#(and (< ~res1~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8837#(and (<= ~n2~0 1) (<= ~res2~0 0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8783#(and (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1)))), Black: 8811#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8745#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8685#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~res1~0 1) (<= ~res2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8809#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8819#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8775#(and (<= ~n2~0 1) (<= ~res2~0 0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8781#(and (< ~res1~0 1) (<= ~n1~0 1) (< 0 ~n2~0)), Black: 8765#(and (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8730#(and (< ~res1~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8769#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8833#(and (<= ~n2~0 1) (<= ~res2~0 0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8747#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8693#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) (< ~res1~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8831#(and (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8777#(and (<= ~n2~0 1) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8835#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8659#(and (< ~res1~0 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~res2~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 8791#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (< 0 ~n2~0)), Black: 8825#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~res2~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8761#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8827#(and (< ~res1~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8709#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~res1~0 1) (<= ~res2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8789#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1)))), Black: 8817#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8661#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (< ~res1~0 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~res2~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 8743#(and (< ~res1~0 1) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1)))), Black: 8741#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1)))), Black: 7552#(and (<= ~n1~0 1) (< 0 ~n2~0)), Black: 8829#(and (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 395#(<= ~res1~0 0), Black: 8753#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~res2~0 0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8757#(and (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 407#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 8813#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~res1~0 1) (<= ~res2~0 0) (or (<= ~n1~0 1) (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8797#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (< 0 ~n2~0)), 545#(<= ~count1~0 ~count3~0), Black: 8773#(and (<= ~n2~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8655#(and (< ~res1~0 1) (<= ~res2~0 0)), Black: 8823#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8705#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~res1~0 1) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8839#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8755#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8653#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~res2~0 0)), Black: 8719#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8751#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0)), 3166#(and (<= 1 ~n1~0) (< thread3Thread1of1ForFork0_~i~2 ~n1~0) (< thread3Thread1of1ForFork0_~i~2 ~n3~0) (<= 1 ~n3~0)), Black: 8805#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1848#(< ~count3~0 (+ ~count1~0 1)), 1770#(and (<= 1 ~n1~0) (or (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n3~0 1) ~n1~0)) (or (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ ~n3~0 1) ~n1~0))), Black: 452#(and (= |thread3Thread1of1ForFork0_#t~ite21| 1) (= ~res3~0 1)), 1831#(< ~count3~0 (+ ~count1~0 1)), Black: 447#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 448#(= ~res3~0 1), 94#L125-2true, 8793#(and (<= ~n2~0 1) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 477#(<= ~count1~0 ~count2~0), Black: 476#(<= ~count1~0 ~count3~0), Black: 485#true, 8896#true]) [2021-12-06 19:01:52,045 INFO L384 tUnfolder$Statistics]: this new event has 243 ancestors and is not cut-off event [2021-12-06 19:01:52,045 INFO L387 tUnfolder$Statistics]: existing Event has 245 ancestors and is not cut-off event [2021-12-06 19:01:52,045 INFO L387 tUnfolder$Statistics]: existing Event has 244 ancestors and is not cut-off event [2021-12-06 19:01:52,045 INFO L387 tUnfolder$Statistics]: existing Event has 245 ancestors and is not cut-off event [2021-12-06 19:01:52,068 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([930] thread3EXIT-->L125-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem39#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} AuxVars[] AssignedVars[][477], [Black: 500#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 1792#(<= ~count2~0 ~count3~0), 1889#(<= ~count1~0 ~count3~0), Black: 1812#(and (or (< ~count3~0 (+ ~count1~0 1)) (<= ~count2~0 ~count1~0)) (not (= ~count3~0 ~count1~0))), Black: 539#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count2~0 1) ~count3~0)), Black: 1822#(and (or (< ~count3~0 (+ ~count1~0 1)) (<= ~count2~0 ~count1~0)) (not (= ~count3~0 ~count1~0))), Black: 1821#(not (= ~count3~0 ~count1~0)), 4066#(or (<= ~n2~0 ~n3~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|)), 5828#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (< thread1Thread1of1ForFork1_~i~0 ~n1~0) (< thread1Thread1of1ForFork1_~i~0 ~n2~0)), Black: 1839#(and (or (< ~count3~0 (+ ~count1~0 1)) (<= ~count2~0 ~count1~0)) (not (= ~count3~0 ~count1~0))), Black: 553#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), Black: 559#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 5859#(and (<= 1 ~n2~0) (<= 1 ~n3~0)), Black: 316#(= thread1Thread1of1ForFork1_~stop~0 0), Black: 573#(<= (+ ~count3~0 1) ~count2~0), Black: 321#(= thread2Thread1of1ForFork2_~stop~1 0), Black: 1855#(not (= ~count3~0 ~count1~0)), Black: 326#(= thread3Thread1of1ForFork0_~stop~2 0), Black: 583#(<= ~count1~0 ~count2~0), Black: 580#true, Black: 1872#(and (not (= ~count3~0 ~count1~0)) (or (<= ~count3~0 ~count2~0) (< ~count3~0 (+ ~count1~0 1)))), 585#(and (<= ~count3~0 ~count2~0) (<= ~count1~0 ~count2~0)), 1864#(or (<= ~count3~0 ~count2~0) (< ~count3~0 (+ ~count1~0 1))), 311#true, Black: 3180#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 361#(and (<= 0 ~n1~0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))), 1883#(and (<= ~count1~0 ~count3~0) (<= ~count2~0 ~count3~0)), 479#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), Black: 8807#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8763#(and (<= ~n2~0 1) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1)))), Black: 8815#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8665#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (< ~res1~0 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~res2~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 8787#(and (<= ~n2~0 1) (<= ~n1~0 1) (< 0 ~n2~0)), 1811#(or (< ~count3~0 (+ ~count1~0 1)) (<= ~count2~0 ~count1~0)), Black: 8759#(and (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 4456#(and (<= ~res2~0 0) (or (<= ~n2~0 ~n3~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|))), Black: 8689#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) (< ~res1~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8749#(and (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8821#(and (< ~res1~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8837#(and (<= ~n2~0 1) (<= ~res2~0 0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8783#(and (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1)))), Black: 8811#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8745#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8685#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~res1~0 1) (<= ~res2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8809#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8819#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8775#(and (<= ~n2~0 1) (<= ~res2~0 0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8781#(and (< ~res1~0 1) (<= ~n1~0 1) (< 0 ~n2~0)), Black: 8765#(and (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8730#(and (< ~res1~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8769#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8833#(and (<= ~n2~0 1) (<= ~res2~0 0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8747#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8693#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) (< ~res1~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8831#(and (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8777#(and (<= ~n2~0 1) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8835#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8659#(and (< ~res1~0 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~res2~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 8825#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~res2~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8761#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8827#(and (< ~res1~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8709#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~res1~0 1) (<= ~res2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8789#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1)))), Black: 8817#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8661#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (< ~res1~0 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~res2~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 8743#(and (< ~res1~0 1) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1)))), Black: 8741#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1)))), Black: 7552#(and (<= ~n1~0 1) (< 0 ~n2~0)), Black: 8829#(and (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 395#(<= ~res1~0 0), Black: 8753#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~res2~0 0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8757#(and (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8813#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 407#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 8699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~res1~0 1) (<= ~res2~0 0) (or (<= ~n1~0 1) (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8797#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (< 0 ~n2~0)), Black: 8773#(and (<= ~n2~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0)), 545#(<= ~count1~0 ~count3~0), Black: 8655#(and (< ~res1~0 1) (<= ~res2~0 0)), Black: 8823#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8705#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~res1~0 1) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8839#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8755#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8653#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~res2~0 0)), Black: 8719#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8751#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0)), 3166#(and (<= 1 ~n1~0) (< thread3Thread1of1ForFork0_~i~2 ~n1~0) (< thread3Thread1of1ForFork0_~i~2 ~n3~0) (<= 1 ~n3~0)), Black: 8805#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 8791#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (< 0 ~n2~0)), 1848#(< ~count3~0 (+ ~count1~0 1)), 1770#(and (<= 1 ~n1~0) (or (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n3~0 1) ~n1~0)) (or (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ ~n3~0 1) ~n1~0))), Black: 452#(and (= |thread3Thread1of1ForFork0_#t~ite21| 1) (= ~res3~0 1)), 1831#(< ~count3~0 (+ ~count1~0 1)), Black: 447#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 448#(= ~res3~0 1), 94#L125-2true, Black: 477#(<= ~count1~0 ~count2~0), Black: 476#(<= ~count1~0 ~count3~0), Black: 485#true, 8896#true]) [2021-12-06 19:01:52,068 INFO L384 tUnfolder$Statistics]: this new event has 246 ancestors and is not cut-off event [2021-12-06 19:01:52,068 INFO L387 tUnfolder$Statistics]: existing Event has 246 ancestors and is not cut-off event [2021-12-06 19:01:52,068 INFO L387 tUnfolder$Statistics]: existing Event has 247 ancestors and is not cut-off event [2021-12-06 19:01:52,069 INFO L387 tUnfolder$Statistics]: existing Event has 247 ancestors and is not cut-off event [2021-12-06 19:01:52,074 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([930] thread3EXIT-->L125-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem39#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|} AuxVars[] AssignedVars[][477], [Black: 500#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 1792#(<= ~count2~0 ~count3~0), 1889#(<= ~count1~0 ~count3~0), Black: 1812#(and (or (< ~count3~0 (+ ~count1~0 1)) (<= ~count2~0 ~count1~0)) (not (= ~count3~0 ~count1~0))), Black: 539#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count2~0 1) ~count3~0)), Black: 1822#(and (or (< ~count3~0 (+ ~count1~0 1)) (<= ~count2~0 ~count1~0)) (not (= ~count3~0 ~count1~0))), Black: 1821#(not (= ~count3~0 ~count1~0)), 4066#(or (<= ~n2~0 ~n3~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|)), 5828#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (< thread1Thread1of1ForFork1_~i~0 ~n1~0) (< thread1Thread1of1ForFork1_~i~0 ~n2~0)), Black: 1839#(and (or (< ~count3~0 (+ ~count1~0 1)) (<= ~count2~0 ~count1~0)) (not (= ~count3~0 ~count1~0))), Black: 553#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), Black: 559#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 5859#(and (<= 1 ~n2~0) (<= 1 ~n3~0)), Black: 316#(= thread1Thread1of1ForFork1_~stop~0 0), Black: 573#(<= (+ ~count3~0 1) ~count2~0), Black: 321#(= thread2Thread1of1ForFork2_~stop~1 0), Black: 1855#(not (= ~count3~0 ~count1~0)), Black: 326#(= thread3Thread1of1ForFork0_~stop~2 0), Black: 583#(<= ~count1~0 ~count2~0), Black: 580#true, Black: 1872#(and (not (= ~count3~0 ~count1~0)) (or (<= ~count3~0 ~count2~0) (< ~count3~0 (+ ~count1~0 1)))), 585#(and (<= ~count3~0 ~count2~0) (<= ~count1~0 ~count2~0)), 1864#(or (<= ~count3~0 ~count2~0) (< ~count3~0 (+ ~count1~0 1))), 311#true, Black: 3180#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 8755#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 361#(and (<= 0 ~n1~0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))), 1883#(and (<= ~count1~0 ~count3~0) (<= ~count2~0 ~count3~0)), 479#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), Black: 8807#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8763#(and (<= ~n2~0 1) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1)))), Black: 8815#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8665#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (< ~res1~0 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~res2~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 8787#(and (<= ~n2~0 1) (<= ~n1~0 1) (< 0 ~n2~0)), 1811#(or (< ~count3~0 (+ ~count1~0 1)) (<= ~count2~0 ~count1~0)), Black: 8759#(and (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8689#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) (< ~res1~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4456#(and (<= ~res2~0 0) (or (<= ~n2~0 ~n3~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|))), Black: 8749#(and (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8821#(and (< ~res1~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8837#(and (<= ~n2~0 1) (<= ~res2~0 0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8783#(and (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1)))), Black: 8811#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8745#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8685#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~res1~0 1) (<= ~res2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8809#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8819#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8775#(and (<= ~n2~0 1) (<= ~res2~0 0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8781#(and (< ~res1~0 1) (<= ~n1~0 1) (< 0 ~n2~0)), Black: 8765#(and (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8730#(and (< ~res1~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8769#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8833#(and (<= ~n2~0 1) (<= ~res2~0 0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8747#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8693#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) (< ~res1~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8831#(and (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8777#(and (<= ~n2~0 1) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8835#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8659#(and (< ~res1~0 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~res2~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 8791#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (< 0 ~n2~0)), Black: 8825#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~res2~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8761#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8827#(and (< ~res1~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8709#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~res1~0 1) (<= ~res2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8789#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1)))), Black: 8817#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8661#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (< ~res1~0 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~res2~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 8743#(and (< ~res1~0 1) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1)))), Black: 8741#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1)))), Black: 7552#(and (<= ~n1~0 1) (< 0 ~n2~0)), Black: 8829#(and (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 395#(<= ~res1~0 0), Black: 8753#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~res2~0 0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8757#(and (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 8813#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 407#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 8699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~res1~0 1) (<= ~res2~0 0) (or (<= ~n1~0 1) (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8797#(and (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (< 0 ~n2~0)), Black: 8773#(and (<= ~n2~0 1) (<= ~n1~0 1) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= thread2Thread1of1ForFork2_~i~1 0)), 545#(<= ~count1~0 ~count3~0), Black: 8655#(and (< ~res1~0 1) (<= ~res2~0 0)), Black: 8823#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (<= (+ ~n2~0 thread2Thread1of1ForFork2_~i~1) ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= thread2Thread1of1ForFork2_~i~1 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8705#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~res1~0 1) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8839#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8653#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~res2~0 0)), Black: 8719#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0)), Black: 8751#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~res2~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (< ~n1~0 (+ ~n2~0 1))) (= thread2Thread1of1ForFork2_~i~1 0)), 3166#(and (<= 1 ~n1~0) (< thread3Thread1of1ForFork0_~i~2 ~n1~0) (< thread3Thread1of1ForFork0_~i~2 ~n3~0) (<= 1 ~n3~0)), Black: 8805#(and (< ~res1~0 1) (<= ~n2~0 1) (<= ~n2~0 ~n3~0) (<= ~n1~0 1) (<= ~res2~0 0) (< 0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1848#(< ~count3~0 (+ ~count1~0 1)), 1770#(and (<= 1 ~n1~0) (or (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n3~0 1) ~n1~0)) (or (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ ~n3~0 1) ~n1~0))), Black: 452#(and (= |thread3Thread1of1ForFork0_#t~ite21| 1) (= ~res3~0 1)), 1831#(< ~count3~0 (+ ~count1~0 1)), Black: 447#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 448#(= ~res3~0 1), 94#L125-2true, Black: 477#(<= ~count1~0 ~count2~0), Black: 476#(<= ~count1~0 ~count3~0), Black: 485#true, 8896#true]) [2021-12-06 19:01:52,074 INFO L384 tUnfolder$Statistics]: this new event has 247 ancestors and is not cut-off event [2021-12-06 19:01:52,074 INFO L387 tUnfolder$Statistics]: existing Event has 248 ancestors and is not cut-off event [2021-12-06 19:01:52,074 INFO L387 tUnfolder$Statistics]: existing Event has 247 ancestors and is not cut-off event [2021-12-06 19:01:52,074 INFO L387 tUnfolder$Statistics]: existing Event has 248 ancestors and is not cut-off event [2021-12-06 19:01:52,103 INFO L129 PetriNetUnfolder]: 2556/20719 cut-off events. [2021-12-06 19:01:52,103 INFO L130 PetriNetUnfolder]: For 53314/55880 co-relation queries the response was YES. [2021-12-06 19:01:52,357 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46407 conditions, 20719 events. 2556/20719 cut-off events. For 53314/55880 co-relation queries the response was YES. Maximal size of possible extension queue 967. Compared 312279 event pairs, 464 based on Foata normal form. 506/20108 useless extension candidates. Maximal degree in co-relation 46306. Up to 3030 conditions per place. [2021-12-06 19:01:52,400 INFO L132 encePairwiseOnDemand]: 325/332 looper letters, 83 selfloop transitions, 27 changer transitions 4/490 dead transitions. [2021-12-06 19:01:52,400 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 490 transitions, 3197 flow [2021-12-06 19:01:52,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 19:01:52,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-06 19:01:52,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1946 transitions. [2021-12-06 19:01:52,402 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8373493975903614 [2021-12-06 19:01:52,402 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1946 transitions. [2021-12-06 19:01:52,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1946 transitions. [2021-12-06 19:01:52,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:01:52,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1946 transitions. [2021-12-06 19:01:52,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 278.0) internal successors, (1946), 7 states have internal predecessors, (1946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:52,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:52,405 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:52,405 INFO L186 Difference]: Start difference. First operand has 548 places, 452 transitions, 2639 flow. Second operand 7 states and 1946 transitions. [2021-12-06 19:01:52,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 534 places, 490 transitions, 3197 flow [2021-12-06 19:01:52,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 490 transitions, 3000 flow, removed 69 selfloop flow, removed 32 redundant places. [2021-12-06 19:01:52,716 INFO L242 Difference]: Finished difference. Result has 507 places, 478 transitions, 2875 flow [2021-12-06 19:01:52,716 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=2478, PETRI_DIFFERENCE_MINUEND_PLACES=496, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2875, PETRI_PLACES=507, PETRI_TRANSITIONS=478} [2021-12-06 19:01:52,717 INFO L334 CegarLoopForPetriNet]: 294 programPoint places, 213 predicate places. [2021-12-06 19:01:52,717 INFO L470 AbstractCegarLoop]: Abstraction has has 507 places, 478 transitions, 2875 flow [2021-12-06 19:01:52,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 276.3333333333333) internal successors, (1658), 6 states have internal predecessors, (1658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:01:52,717 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:01:52,717 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:01:52,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-12-06 19:01:52,717 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 19:01:52,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:01:52,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1070424341, now seen corresponding path program 1 times [2021-12-06 19:01:52,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:01:52,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109166355] [2021-12-06 19:01:52,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:01:52,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:01:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:54,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:01:54,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:01:54,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109166355] [2021-12-06 19:01:54,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109166355] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:01:54,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184704868] [2021-12-06 19:01:54,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:01:54,589 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:01:54,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:01:54,590 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:01:54,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf303163-74ea-49e5-9fc6-64748b62ddcc/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-06 19:01:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:54,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 94 conjunts are in the unsatisfiable core [2021-12-06 19:01:54,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:01:54,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 19:01:55,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 19:01:55,377 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-06 19:01:55,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-06 19:01:55,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 19:01:56,355 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 19:01:56,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 19:01:56,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 19:01:57,605 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 19:01:58,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:01:58,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:01:58,978 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-06 19:01:58,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2021-12-06 19:02:01,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:02:01,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:02:01,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:02:01,189 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-12-06 19:02:01,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 51 [2021-12-06 19:02:01,788 INFO L354 Elim1Store]: treesize reduction 6, result has 76.0 percent of original size [2021-12-06 19:02:01,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 39 [2021-12-06 19:02:01,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:02:01,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:02:02,151 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1062 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1062))) (< (select (select .cse0 c_~get3~0.base) c_~get3~0.offset) (select (select .cse0 c_~get1~0.base) c_~get1~0.offset)))) is different from false [2021-12-06 19:02:38,659 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:02:38,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 490 treesize of output 262 [2021-12-06 19:02:38,817 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:02:38,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 963018 treesize of output 941986 [2021-12-06 19:02:43,272 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:02:43,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 941962 treesize of output 898466 [2021-12-06 19:02:47,688 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:02:47,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 673270 treesize of output 591358 [2021-12-06 19:02:52,095 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:02:52,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 664480 treesize of output 614328 [2021-12-06 19:02:56,623 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:02:56,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 777474 treesize of output 767178 [2021-12-06 19:03:05,856 WARN L227 SmtUtils]: Spent 9.23s on a formula simplification. DAG size of input: 2777 DAG size of output: 2776 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-06 19:03:29,793 WARN L227 SmtUtils]: Spent 16.34s on a formula simplification. DAG size of input: 1632 DAG size of output: 1632 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-06 19:03:51,467 WARN L227 SmtUtils]: Spent 12.02s on a formula simplification. DAG size of input: 1630 DAG size of output: 1630 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-06 19:04:37,941 WARN L227 SmtUtils]: Spent 38.87s on a formula simplification. DAG size of input: 1628 DAG size of output: 1628 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-06 19:05:27,507 WARN L227 SmtUtils]: Spent 39.42s on a formula simplification. DAG size of input: 1626 DAG size of output: 1626 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-06 19:05:57,957 WARN L227 SmtUtils]: Spent 17.13s on a formula simplification. DAG size of input: 1578 DAG size of output: 1578 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-06 19:06:24,993 WARN L227 SmtUtils]: Spent 17.24s on a formula simplification. DAG size of input: 1576 DAG size of output: 1576 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-06 19:06:52,173 WARN L227 SmtUtils]: Spent 17.34s on a formula simplification. DAG size of input: 1576 DAG size of output: 1576 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-06 19:07:19,396 WARN L227 SmtUtils]: Spent 17.33s on a formula simplification. DAG size of input: 1576 DAG size of output: 1576 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-06 19:07:58,842 WARN L227 SmtUtils]: Spent 26.27s on a formula simplification. DAG size of input: 1576 DAG size of output: 1576 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-06 19:08:34,636 WARN L227 SmtUtils]: Spent 26.32s on a formula simplification. DAG size of input: 1576 DAG size of output: 1576 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-06 19:09:01,583 WARN L227 SmtUtils]: Spent 14.96s on a formula simplification. DAG size of input: 1539 DAG size of output: 1539 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-06 19:09:18,839 WARN L227 SmtUtils]: Spent 5.90s on a formula simplification that was a NOOP. DAG size: 1492 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-06 19:09:35,868 WARN L227 SmtUtils]: Spent 5.85s on a formula simplification that was a NOOP. DAG size: 1492 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-06 19:09:59,015 WARN L227 SmtUtils]: Spent 14.69s on a formula simplification. DAG size of input: 1490 DAG size of output: 1490 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-06 19:10:22,171 WARN L227 SmtUtils]: Spent 14.80s on a formula simplification. DAG size of input: 1488 DAG size of output: 1488 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-06 19:10:45,484 WARN L227 SmtUtils]: Spent 14.72s on a formula simplification. DAG size of input: 1486 DAG size of output: 1486 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-06 19:11:08,719 WARN L227 SmtUtils]: Spent 14.82s on a formula simplification. DAG size of input: 1484 DAG size of output: 1484 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-06 19:11:32,065 WARN L227 SmtUtils]: Spent 14.91s on a formula simplification. DAG size of input: 1484 DAG size of output: 1484 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)