./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8 --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 e9065224c0b163ad014fc0aee4009feab43ed37ef70e06d8d8f3b14d045f755a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:50:05,624 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:50:05,627 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:50:05,657 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:50:05,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:50:05,659 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:50:05,660 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:50:05,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:50:05,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:50:05,665 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:50:05,667 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:50:05,668 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:50:05,669 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:50:05,670 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:50:05,671 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:50:05,673 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:50:05,674 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:50:05,675 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:50:05,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:50:05,680 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:50:05,682 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:50:05,688 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:50:05,689 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:50:05,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:50:05,699 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:50:05,706 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:50:05,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:50:05,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:50:05,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:50:05,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:50:05,710 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:50:05,711 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:50:05,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:50:05,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:50:05,717 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:50:05,717 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:50:05,718 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:50:05,720 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:50:05,721 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:50:05,722 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:50:05,723 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:50:05,725 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 11:50:05,768 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:50:05,769 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:50:05,770 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:50:05,770 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:50:05,771 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:50:05,772 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:50:05,772 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:50:05,773 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:50:05,773 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:50:05,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:50:05,775 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:50:05,775 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:50:05,775 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:50:05,775 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:50:05,776 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:50:05,776 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:50:05,776 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:50:05,776 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:50:05,777 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:50:05,777 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:50:05,777 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:50:05,777 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:50:05,778 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:50:05,778 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:50:05,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:50:05,778 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:50:05,780 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:50:05,781 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:50:05,781 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:50:05,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:50:05,781 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:50:05,782 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:50:05,782 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:50:05,782 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_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/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_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8 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 -> e9065224c0b163ad014fc0aee4009feab43ed37ef70e06d8d8f3b14d045f755a [2022-11-16 11:50:06,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:50:06,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:50:06,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:50:06,190 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:50:06,191 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:50:06,193 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c [2022-11-16 11:50:06,284 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/data/7ba558196/cf74a8ba56214050a965c6c65daa8d24/FLAG40545f129 [2022-11-16 11:50:06,883 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:50:06,883 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c [2022-11-16 11:50:06,891 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/data/7ba558196/cf74a8ba56214050a965c6c65daa8d24/FLAG40545f129 [2022-11-16 11:50:07,226 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/data/7ba558196/cf74a8ba56214050a965c6c65daa8d24 [2022-11-16 11:50:07,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:50:07,232 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:50:07,236 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:50:07,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:50:07,240 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:50:07,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:50:07" (1/1) ... [2022-11-16 11:50:07,243 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b0b07da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:07, skipping insertion in model container [2022-11-16 11:50:07,243 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:50:07" (1/1) ... [2022-11-16 11:50:07,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:50:07,278 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:50:07,550 WARN L229 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_f735203e-e940-4ce4-a1f9-7742014e189a/sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c[2566,2579] [2022-11-16 11:50:07,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:50:07,582 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:50:07,627 WARN L229 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_f735203e-e940-4ce4-a1f9-7742014e189a/sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c[2566,2579] [2022-11-16 11:50:07,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:50:07,668 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:50:07,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:07 WrapperNode [2022-11-16 11:50:07,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:50:07,671 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:50:07,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:50:07,672 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:50:07,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:07" (1/1) ... [2022-11-16 11:50:07,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:07" (1/1) ... [2022-11-16 11:50:07,754 INFO L138 Inliner]: procedures = 24, calls = 35, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 174 [2022-11-16 11:50:07,756 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:50:07,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:50:07,758 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:50:07,758 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:50:07,769 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:07" (1/1) ... [2022-11-16 11:50:07,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:07" (1/1) ... [2022-11-16 11:50:07,788 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:07" (1/1) ... [2022-11-16 11:50:07,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:07" (1/1) ... [2022-11-16 11:50:07,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:07" (1/1) ... [2022-11-16 11:50:07,817 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:07" (1/1) ... [2022-11-16 11:50:07,819 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:07" (1/1) ... [2022-11-16 11:50:07,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:07" (1/1) ... [2022-11-16 11:50:07,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:50:07,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:50:07,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:50:07,833 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:50:07,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:07" (1/1) ... [2022-11-16 11:50:07,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:50:07,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:50:07,880 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:50:07,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:50:07,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:50:07,960 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-16 11:50:07,960 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-16 11:50:07,960 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-16 11:50:07,961 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-16 11:50:07,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:50:07,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:50:07,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:50:07,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:50:07,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:50:07,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:50:07,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:50:07,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:50:07,968 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:50:08,131 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:50:08,134 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:50:08,604 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:50:08,616 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:50:08,624 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-16 11:50:08,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:50:08 BoogieIcfgContainer [2022-11-16 11:50:08,627 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:50:08,631 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:50:08,631 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:50:08,646 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:50:08,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:50:07" (1/3) ... [2022-11-16 11:50:08,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe5cd8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:50:08, skipping insertion in model container [2022-11-16 11:50:08,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:07" (2/3) ... [2022-11-16 11:50:08,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe5cd8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:50:08, skipping insertion in model container [2022-11-16 11:50:08,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:50:08" (3/3) ... [2022-11-16 11:50:08,649 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-chromosome-opt-symm.wvr.c [2022-11-16 11:50:08,659 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 11:50:08,672 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:50:08,673 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 11:50:08,673 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:50:08,795 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-16 11:50:08,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 212 transitions, 440 flow [2022-11-16 11:50:08,950 INFO L130 PetriNetUnfolder]: 19/210 cut-off events. [2022-11-16 11:50:08,950 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-16 11:50:08,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 210 events. 19/210 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 216 event pairs, 0 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 150. Up to 3 conditions per place. [2022-11-16 11:50:08,958 INFO L82 GeneralOperation]: Start removeDead. Operand has 200 places, 212 transitions, 440 flow [2022-11-16 11:50:08,965 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 189 places, 201 transitions, 414 flow [2022-11-16 11:50:08,977 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:50:08,985 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1f69c2a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:50:08,986 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-16 11:50:09,073 INFO L130 PetriNetUnfolder]: 19/200 cut-off events. [2022-11-16 11:50:09,073 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-16 11:50:09,074 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:09,075 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:09,075 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 11:50:09,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:09,081 INFO L85 PathProgramCache]: Analyzing trace with hash 492419075, now seen corresponding path program 1 times [2022-11-16 11:50:09,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:09,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664135730] [2022-11-16 11:50:09,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:09,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:09,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:50:09,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:09,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664135730] [2022-11-16 11:50:09,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664135730] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:09,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:09,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:50:09,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80985833] [2022-11-16 11:50:09,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:09,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:50:09,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:09,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:50:09,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:50:09,592 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 212 [2022-11-16 11:50:09,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 201 transitions, 414 flow. Second operand has 2 states, 2 states have (on average 200.0) internal successors, (400), 2 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:09,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:09,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 212 [2022-11-16 11:50:09,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:09,730 INFO L130 PetriNetUnfolder]: 8/190 cut-off events. [2022-11-16 11:50:09,731 INFO L131 PetriNetUnfolder]: For 9/10 co-relation queries the response was YES. [2022-11-16 11:50:09,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 190 events. 8/190 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 204 event pairs, 0 based on Foata normal form. 13/188 useless extension candidates. Maximal degree in co-relation 143. Up to 5 conditions per place. [2022-11-16 11:50:09,738 INFO L137 encePairwiseOnDemand]: 201/212 looper letters, 4 selfloop transitions, 0 changer transitions 5/190 dead transitions. [2022-11-16 11:50:09,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 190 transitions, 400 flow [2022-11-16 11:50:09,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:50:09,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-16 11:50:09,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 407 transitions. [2022-11-16 11:50:09,770 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9599056603773585 [2022-11-16 11:50:09,772 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 407 transitions. [2022-11-16 11:50:09,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 407 transitions. [2022-11-16 11:50:09,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:09,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 407 transitions. [2022-11-16 11:50:09,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 203.5) internal successors, (407), 2 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:09,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:09,800 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:09,802 INFO L175 Difference]: Start difference. First operand has 189 places, 201 transitions, 414 flow. Second operand 2 states and 407 transitions. [2022-11-16 11:50:09,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 190 transitions, 400 flow [2022-11-16 11:50:09,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 190 transitions, 392 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 11:50:09,821 INFO L231 Difference]: Finished difference. Result has 186 places, 185 transitions, 374 flow [2022-11-16 11:50:09,824 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=374, PETRI_PLACES=186, PETRI_TRANSITIONS=185} [2022-11-16 11:50:09,832 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, -3 predicate places. [2022-11-16 11:50:09,832 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 185 transitions, 374 flow [2022-11-16 11:50:09,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 200.0) internal successors, (400), 2 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:09,833 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:09,834 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:09,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:50:09,836 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 11:50:09,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:09,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1077908319, now seen corresponding path program 1 times [2022-11-16 11:50:09,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:09,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112610338] [2022-11-16 11:50:09,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:09,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:10,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:50:10,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:10,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112610338] [2022-11-16 11:50:10,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112610338] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:10,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:10,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:50:10,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945489676] [2022-11-16 11:50:10,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:10,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:50:10,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:10,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:50:10,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:50:10,318 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 212 [2022-11-16 11:50:10,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 185 transitions, 374 flow. Second operand has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:10,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:10,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 212 [2022-11-16 11:50:10,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:10,536 INFO L130 PetriNetUnfolder]: 8/197 cut-off events. [2022-11-16 11:50:10,537 INFO L131 PetriNetUnfolder]: For 2/3 co-relation queries the response was YES. [2022-11-16 11:50:10,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 197 events. 8/197 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 192 event pairs, 0 based on Foata normal form. 0/187 useless extension candidates. Maximal degree in co-relation 235. Up to 25 conditions per place. [2022-11-16 11:50:10,539 INFO L137 encePairwiseOnDemand]: 202/212 looper letters, 28 selfloop transitions, 8 changer transitions 0/193 dead transitions. [2022-11-16 11:50:10,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 193 transitions, 462 flow [2022-11-16 11:50:10,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:50:10,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:50:10,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 898 transitions. [2022-11-16 11:50:10,543 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8471698113207548 [2022-11-16 11:50:10,543 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 898 transitions. [2022-11-16 11:50:10,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 898 transitions. [2022-11-16 11:50:10,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:10,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 898 transitions. [2022-11-16 11:50:10,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 179.6) internal successors, (898), 5 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:10,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:10,553 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:10,553 INFO L175 Difference]: Start difference. First operand has 186 places, 185 transitions, 374 flow. Second operand 5 states and 898 transitions. [2022-11-16 11:50:10,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 193 transitions, 462 flow [2022-11-16 11:50:10,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 193 transitions, 462 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:50:10,559 INFO L231 Difference]: Finished difference. Result has 186 places, 187 transitions, 406 flow [2022-11-16 11:50:10,559 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=406, PETRI_PLACES=186, PETRI_TRANSITIONS=187} [2022-11-16 11:50:10,560 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, -3 predicate places. [2022-11-16 11:50:10,560 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 187 transitions, 406 flow [2022-11-16 11:50:10,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:10,562 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:10,562 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:10,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:50:10,563 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 11:50:10,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:10,564 INFO L85 PathProgramCache]: Analyzing trace with hash 2006790397, now seen corresponding path program 1 times [2022-11-16 11:50:10,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:10,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253797965] [2022-11-16 11:50:10,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:10,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:10,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:50:10,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:10,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253797965] [2022-11-16 11:50:10,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253797965] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:10,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106260406] [2022-11-16 11:50:10,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:10,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:10,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:50:10,993 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:50:11,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:50:11,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:11,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:50:11,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:50:11,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:50:11,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:50:11,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:50:11,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106260406] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:50:11,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:50:11,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-11-16 11:50:11,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160550348] [2022-11-16 11:50:11,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:50:11,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 11:50:11,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:11,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 11:50:11,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-11-16 11:50:11,522 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 212 [2022-11-16 11:50:11,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 187 transitions, 406 flow. Second operand has 15 states, 15 states have (on average 173.33333333333334) internal successors, (2600), 15 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:11,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:11,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 212 [2022-11-16 11:50:11,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:11,864 INFO L130 PetriNetUnfolder]: 8/215 cut-off events. [2022-11-16 11:50:11,864 INFO L131 PetriNetUnfolder]: For 10/11 co-relation queries the response was YES. [2022-11-16 11:50:11,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 215 events. 8/215 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 174 event pairs, 0 based on Foata normal form. 4/211 useless extension candidates. Maximal degree in co-relation 285. Up to 19 conditions per place. [2022-11-16 11:50:11,867 INFO L137 encePairwiseOnDemand]: 196/212 looper letters, 30 selfloop transitions, 22 changer transitions 0/207 dead transitions. [2022-11-16 11:50:11,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 207 transitions, 554 flow [2022-11-16 11:50:11,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:50:11,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-16 11:50:11,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1926 transitions. [2022-11-16 11:50:11,873 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8259005145797599 [2022-11-16 11:50:11,874 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1926 transitions. [2022-11-16 11:50:11,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1926 transitions. [2022-11-16 11:50:11,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:11,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1926 transitions. [2022-11-16 11:50:11,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 175.0909090909091) internal successors, (1926), 11 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:11,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 212.0) internal successors, (2544), 12 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:11,888 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 212.0) internal successors, (2544), 12 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:11,889 INFO L175 Difference]: Start difference. First operand has 186 places, 187 transitions, 406 flow. Second operand 11 states and 1926 transitions. [2022-11-16 11:50:11,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 207 transitions, 554 flow [2022-11-16 11:50:11,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 207 transitions, 542 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:50:11,903 INFO L231 Difference]: Finished difference. Result has 196 places, 199 transitions, 505 flow [2022-11-16 11:50:11,904 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=505, PETRI_PLACES=196, PETRI_TRANSITIONS=199} [2022-11-16 11:50:11,904 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 7 predicate places. [2022-11-16 11:50:11,905 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 199 transitions, 505 flow [2022-11-16 11:50:11,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 173.33333333333334) internal successors, (2600), 15 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:11,907 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:11,907 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:11,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-16 11:50:12,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:12,113 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 11:50:12,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:12,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1530331237, now seen corresponding path program 2 times [2022-11-16 11:50:12,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:12,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332548872] [2022-11-16 11:50:12,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:12,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:12,567 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-16 11:50:12,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:12,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332548872] [2022-11-16 11:50:12,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332548872] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:12,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792465925] [2022-11-16 11:50:12,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:50:12,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:12,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:50:12,571 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:50:12,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:50:12,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 11:50:12,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:50:12,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 11:50:12,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:50:12,925 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-16 11:50:12,925 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:50:12,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792465925] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:12,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:50:12,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2022-11-16 11:50:12,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755569853] [2022-11-16 11:50:12,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:12,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:50:12,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:12,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:50:12,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-11-16 11:50:12,938 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-16 11:50:12,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 199 transitions, 505 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:12,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:12,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-16 11:50:12,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:13,366 INFO L130 PetriNetUnfolder]: 98/591 cut-off events. [2022-11-16 11:50:13,367 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-11-16 11:50:13,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 591 events. 98/591 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2704 event pairs, 8 based on Foata normal form. 0/538 useless extension candidates. Maximal degree in co-relation 820. Up to 70 conditions per place. [2022-11-16 11:50:13,374 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 50 selfloop transitions, 10 changer transitions 1/240 dead transitions. [2022-11-16 11:50:13,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 240 transitions, 714 flow [2022-11-16 11:50:13,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:50:13,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-16 11:50:13,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1503 transitions. [2022-11-16 11:50:13,379 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8862028301886793 [2022-11-16 11:50:13,380 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1503 transitions. [2022-11-16 11:50:13,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1503 transitions. [2022-11-16 11:50:13,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:13,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1503 transitions. [2022-11-16 11:50:13,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 187.875) internal successors, (1503), 8 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:13,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:13,391 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:13,391 INFO L175 Difference]: Start difference. First operand has 196 places, 199 transitions, 505 flow. Second operand 8 states and 1503 transitions. [2022-11-16 11:50:13,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 240 transitions, 714 flow [2022-11-16 11:50:13,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 240 transitions, 697 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-11-16 11:50:13,401 INFO L231 Difference]: Finished difference. Result has 205 places, 206 transitions, 551 flow [2022-11-16 11:50:13,402 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=551, PETRI_PLACES=205, PETRI_TRANSITIONS=206} [2022-11-16 11:50:13,404 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 16 predicate places. [2022-11-16 11:50:13,404 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 206 transitions, 551 flow [2022-11-16 11:50:13,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:13,405 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:13,405 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:13,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:50:13,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-11-16 11:50:13,612 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 11:50:13,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:13,612 INFO L85 PathProgramCache]: Analyzing trace with hash -134663119, now seen corresponding path program 3 times [2022-11-16 11:50:13,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:13,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078134166] [2022-11-16 11:50:13,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:13,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:13,959 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-16 11:50:13,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:13,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078134166] [2022-11-16 11:50:13,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078134166] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:13,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755044885] [2022-11-16 11:50:13,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:50:13,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:13,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:50:13,962 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:50:13,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 11:50:14,128 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-16 11:50:14,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:50:14,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 11:50:14,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:50:14,324 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-16 11:50:14,324 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:50:14,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755044885] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:14,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:50:14,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2022-11-16 11:50:14,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788739072] [2022-11-16 11:50:14,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:14,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:50:14,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:14,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:50:14,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-11-16 11:50:14,330 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-16 11:50:14,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 206 transitions, 551 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:14,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:14,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-16 11:50:14,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:14,859 INFO L130 PetriNetUnfolder]: 218/1283 cut-off events. [2022-11-16 11:50:14,860 INFO L131 PetriNetUnfolder]: For 151/153 co-relation queries the response was YES. [2022-11-16 11:50:14,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1834 conditions, 1283 events. 218/1283 cut-off events. For 151/153 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 9050 event pairs, 4 based on Foata normal form. 0/1169 useless extension candidates. Maximal degree in co-relation 1822. Up to 112 conditions per place. [2022-11-16 11:50:14,873 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 53 selfloop transitions, 10 changer transitions 1/250 dead transitions. [2022-11-16 11:50:14,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 250 transitions, 775 flow [2022-11-16 11:50:14,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:50:14,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-16 11:50:14,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1506 transitions. [2022-11-16 11:50:14,877 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8879716981132075 [2022-11-16 11:50:14,878 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1506 transitions. [2022-11-16 11:50:14,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1506 transitions. [2022-11-16 11:50:14,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:14,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1506 transitions. [2022-11-16 11:50:14,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 188.25) internal successors, (1506), 8 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:14,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:14,913 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:14,913 INFO L175 Difference]: Start difference. First operand has 205 places, 206 transitions, 551 flow. Second operand 8 states and 1506 transitions. [2022-11-16 11:50:14,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 250 transitions, 775 flow [2022-11-16 11:50:14,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 250 transitions, 775 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:50:14,923 INFO L231 Difference]: Finished difference. Result has 216 places, 213 transitions, 614 flow [2022-11-16 11:50:14,924 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=614, PETRI_PLACES=216, PETRI_TRANSITIONS=213} [2022-11-16 11:50:14,925 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 27 predicate places. [2022-11-16 11:50:14,925 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 213 transitions, 614 flow [2022-11-16 11:50:14,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:14,926 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:14,926 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:14,937 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:50:15,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:15,133 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 11:50:15,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:15,133 INFO L85 PathProgramCache]: Analyzing trace with hash 577029655, now seen corresponding path program 4 times [2022-11-16 11:50:15,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:15,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146424200] [2022-11-16 11:50:15,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:15,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:15,463 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-16 11:50:15,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:15,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146424200] [2022-11-16 11:50:15,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146424200] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:15,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069709749] [2022-11-16 11:50:15,464 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 11:50:15,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:15,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:50:15,466 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:50:15,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 11:50:15,625 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 11:50:15,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:50:15,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 11:50:15,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:50:15,882 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-16 11:50:15,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:50:16,091 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-16 11:50:16,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069709749] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:50:16,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:50:16,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2022-11-16 11:50:16,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425785289] [2022-11-16 11:50:16,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:50:16,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-16 11:50:16,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:16,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-16 11:50:16,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2022-11-16 11:50:16,099 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 212 [2022-11-16 11:50:16,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 213 transitions, 614 flow. Second operand has 22 states, 22 states have (on average 173.1818181818182) internal successors, (3810), 22 states have internal predecessors, (3810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:16,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:16,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 212 [2022-11-16 11:50:16,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:16,707 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([577] thread2EXIT-->L90-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} AuxVars[] AssignedVars[][223], [Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), 203#true, Black: 1627#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), 123#L90-2true, Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))))]) [2022-11-16 11:50:16,708 INFO L383 tUnfolder$Statistics]: this new event has 204 ancestors and is cut-off event [2022-11-16 11:50:16,708 INFO L386 tUnfolder$Statistics]: existing Event has 189 ancestors and is cut-off event [2022-11-16 11:50:16,708 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-16 11:50:16,708 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-16 11:50:16,709 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([577] thread2EXIT-->L90-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} AuxVars[] AssignedVars[][223], [Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), 203#true, Black: 1627#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), 123#L90-2true, Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))))]) [2022-11-16 11:50:16,709 INFO L383 tUnfolder$Statistics]: this new event has 216 ancestors and is cut-off event [2022-11-16 11:50:16,709 INFO L386 tUnfolder$Statistics]: existing Event has 189 ancestors and is cut-off event [2022-11-16 11:50:16,710 INFO L386 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-11-16 11:50:16,710 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-16 11:50:16,710 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-16 11:50:16,714 INFO L130 PetriNetUnfolder]: 61/633 cut-off events. [2022-11-16 11:50:16,715 INFO L131 PetriNetUnfolder]: For 137/147 co-relation queries the response was YES. [2022-11-16 11:50:16,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 633 events. 61/633 cut-off events. For 137/147 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2923 event pairs, 0 based on Foata normal form. 4/604 useless extension candidates. Maximal degree in co-relation 957. Up to 32 conditions per place. [2022-11-16 11:50:16,721 INFO L137 encePairwiseOnDemand]: 196/212 looper letters, 38 selfloop transitions, 34 changer transitions 0/241 dead transitions. [2022-11-16 11:50:16,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 241 transitions, 870 flow [2022-11-16 11:50:16,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 11:50:16,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-16 11:50:16,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2966 transitions. [2022-11-16 11:50:16,730 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8229744728079911 [2022-11-16 11:50:16,730 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2966 transitions. [2022-11-16 11:50:16,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2966 transitions. [2022-11-16 11:50:16,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:16,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2966 transitions. [2022-11-16 11:50:16,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 174.47058823529412) internal successors, (2966), 17 states have internal predecessors, (2966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:16,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 212.0) internal successors, (3816), 18 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:16,751 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 212.0) internal successors, (3816), 18 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:16,752 INFO L175 Difference]: Start difference. First operand has 216 places, 213 transitions, 614 flow. Second operand 17 states and 2966 transitions. [2022-11-16 11:50:16,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 241 transitions, 870 flow [2022-11-16 11:50:16,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 241 transitions, 870 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:50:16,760 INFO L231 Difference]: Finished difference. Result has 234 places, 227 transitions, 789 flow [2022-11-16 11:50:16,761 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=789, PETRI_PLACES=234, PETRI_TRANSITIONS=227} [2022-11-16 11:50:16,764 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 45 predicate places. [2022-11-16 11:50:16,765 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 227 transitions, 789 flow [2022-11-16 11:50:16,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 173.1818181818182) internal successors, (3810), 22 states have internal predecessors, (3810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:16,768 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:16,768 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:16,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:50:16,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f735203e-e940-4ce4-a1f9-7742014e189a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:16,975 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 11:50:16,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:16,976 INFO L85 PathProgramCache]: Analyzing trace with hash 930943265, now seen corresponding path program 5 times [2022-11-16 11:50:16,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:16,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878131322] [2022-11-16 11:50:16,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:16,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:17,409 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-16 11:50:17,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:17,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878131322] [2022-11-16 11:50:17,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878131322] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:17,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:17,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:50:17,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970703483] [2022-11-16 11:50:17,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:17,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:50:17,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:17,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:50:17,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:50:17,419 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-16 11:50:17,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 227 transitions, 789 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:17,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:17,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-16 11:50:17,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:17,811 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] L66-2-->L66-3: Formula: (or (not (< |v_thread2Thread1of1ForFork0_~i~1#1_3| 5)) (= v_~isNullA~0_2 0)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~isNullA~0=v_~isNullA~0_2} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~isNullA~0=v_~isNullA~0_2} AuxVars[] AssignedVars[][178], [Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 3229#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), 203#true, Black: 1627#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3217#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3211#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 3)), 61#L89-2true, Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 28#L66-3true, Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))))]) [2022-11-16 11:50:17,811 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-16 11:50:17,812 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-16 11:50:17,812 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:50:17,812 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-16 11:50:17,812 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([549] L66-2-->L67: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_5| 5) (not (= v_~isNullA~0_3 0))) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~isNullA~0=v_~isNullA~0_3} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~isNullA~0=v_~isNullA~0_3} AuxVars[] AssignedVars[][179], [Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 3229#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), 203#true, Black: 1627#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 116#L67true, 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3217#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3211#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 3)), 61#L89-2true, Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))))]) [2022-11-16 11:50:17,812 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-16 11:50:17,813 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-16 11:50:17,813 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:50:17,813 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-16 11:50:17,844 INFO L130 PetriNetUnfolder]: 249/1173 cut-off events. [2022-11-16 11:50:17,844 INFO L131 PetriNetUnfolder]: For 539/569 co-relation queries the response was YES. [2022-11-16 11:50:17,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2106 conditions, 1173 events. 249/1173 cut-off events. For 539/569 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7342 event pairs, 20 based on Foata normal form. 16/1098 useless extension candidates. Maximal degree in co-relation 2085. Up to 246 conditions per place. [2022-11-16 11:50:17,854 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 43 selfloop transitions, 14 changer transitions 0/257 dead transitions. [2022-11-16 11:50:17,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 257 transitions, 1013 flow [2022-11-16 11:50:17,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:50:17,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:50:17,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1131 transitions. [2022-11-16 11:50:17,859 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8891509433962265 [2022-11-16 11:50:17,859 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1131 transitions. [2022-11-16 11:50:17,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1131 transitions. [2022-11-16 11:50:17,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:17,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1131 transitions. [2022-11-16 11:50:17,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 188.5) internal successors, (1131), 6 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:17,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:17,868 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:17,869 INFO L175 Difference]: Start difference. First operand has 234 places, 227 transitions, 789 flow. Second operand 6 states and 1131 transitions. [2022-11-16 11:50:17,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 257 transitions, 1013 flow [2022-11-16 11:50:17,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 257 transitions, 968 flow, removed 8 selfloop flow, removed 8 redundant places. [2022-11-16 11:50:17,885 INFO L231 Difference]: Finished difference. Result has 235 places, 235 transitions, 859 flow [2022-11-16 11:50:17,886 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=859, PETRI_PLACES=235, PETRI_TRANSITIONS=235} [2022-11-16 11:50:17,887 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 46 predicate places. [2022-11-16 11:50:17,887 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 235 transitions, 859 flow [2022-11-16 11:50:17,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:17,888 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:17,889 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:17,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:50:17,889 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 11:50:17,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:17,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1081256451, now seen corresponding path program 6 times [2022-11-16 11:50:17,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:17,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792636228] [2022-11-16 11:50:17,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:17,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:18,238 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-16 11:50:18,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:18,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792636228] [2022-11-16 11:50:18,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792636228] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:18,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:18,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:50:18,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625883093] [2022-11-16 11:50:18,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:18,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:50:18,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:18,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:50:18,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:50:18,248 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-16 11:50:18,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 235 transitions, 859 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:18,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:18,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-16 11:50:18,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:18,911 INFO L130 PetriNetUnfolder]: 389/2119 cut-off events. [2022-11-16 11:50:18,912 INFO L131 PetriNetUnfolder]: For 1302/1317 co-relation queries the response was YES. [2022-11-16 11:50:18,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3721 conditions, 2119 events. 389/2119 cut-off events. For 1302/1317 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 17971 event pairs, 60 based on Foata normal form. 11/1997 useless extension candidates. Maximal degree in co-relation 3696. Up to 320 conditions per place. [2022-11-16 11:50:18,937 INFO L137 encePairwiseOnDemand]: 203/212 looper letters, 49 selfloop transitions, 17 changer transitions 0/274 dead transitions. [2022-11-16 11:50:18,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 274 transitions, 1130 flow [2022-11-16 11:50:18,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:50:18,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:50:18,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1138 transitions. [2022-11-16 11:50:18,941 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8946540880503144 [2022-11-16 11:50:18,941 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1138 transitions. [2022-11-16 11:50:18,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1138 transitions. [2022-11-16 11:50:18,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:18,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1138 transitions. [2022-11-16 11:50:18,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 189.66666666666666) internal successors, (1138), 6 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:18,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:18,950 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:18,950 INFO L175 Difference]: Start difference. First operand has 235 places, 235 transitions, 859 flow. Second operand 6 states and 1138 transitions. [2022-11-16 11:50:18,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 274 transitions, 1130 flow [2022-11-16 11:50:18,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 274 transitions, 1120 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-11-16 11:50:18,967 INFO L231 Difference]: Finished difference. Result has 244 places, 247 transitions, 1005 flow [2022-11-16 11:50:18,968 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=849, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1005, PETRI_PLACES=244, PETRI_TRANSITIONS=247} [2022-11-16 11:50:18,968 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 55 predicate places. [2022-11-16 11:50:18,968 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 247 transitions, 1005 flow [2022-11-16 11:50:18,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:18,970 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:18,971 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:18,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:50:18,971 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 11:50:18,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:18,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1531833371, now seen corresponding path program 7 times [2022-11-16 11:50:18,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:18,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938680285] [2022-11-16 11:50:18,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:18,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:19,288 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-16 11:50:19,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:19,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938680285] [2022-11-16 11:50:19,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938680285] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:19,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:19,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:50:19,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278867941] [2022-11-16 11:50:19,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:19,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:50:19,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:19,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:50:19,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:50:19,294 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-16 11:50:19,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 247 transitions, 1005 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:19,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:19,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-16 11:50:19,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:19,967 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] L66-2-->L66-3: Formula: (or (not (< |v_thread2Thread1of1ForFork0_~i~1#1_3| 5)) (= v_~isNullA~0_2 0)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~isNullA~0=v_~isNullA~0_2} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~isNullA~0=v_~isNullA~0_2} AuxVars[] AssignedVars[][180], [Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 3255#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3217#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3211#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 3)), 61#L89-2true, Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))), 3244#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3224#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3231#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0)))), Black: 3227#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))), 3229#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), 203#true, Black: 1627#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3237#true, 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3239#(or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))), Black: 3246#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= ~isNullB~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3242#(and (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= ~isNullB~0 0))), 28#L66-3true]) [2022-11-16 11:50:19,968 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-16 11:50:19,968 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:50:19,968 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-16 11:50:19,968 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-16 11:50:19,969 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([549] L66-2-->L67: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_5| 5) (not (= v_~isNullA~0_3 0))) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~isNullA~0=v_~isNullA~0_3} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~isNullA~0=v_~isNullA~0_3} AuxVars[] AssignedVars[][199], [Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 3255#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3217#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3211#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 3)), 61#L89-2true, Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))), 3244#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3224#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3231#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0)))), Black: 3227#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))), 3229#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), 203#true, Black: 1627#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3237#true, 116#L67true, 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3239#(or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))), Black: 3246#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= ~isNullB~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3242#(and (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= ~isNullB~0 0)))]) [2022-11-16 11:50:19,969 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-16 11:50:19,969 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:50:19,969 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-16 11:50:19,969 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-16 11:50:19,983 INFO L130 PetriNetUnfolder]: 423/2018 cut-off events. [2022-11-16 11:50:19,983 INFO L131 PetriNetUnfolder]: For 2031/2081 co-relation queries the response was YES. [2022-11-16 11:50:19,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4068 conditions, 2018 events. 423/2018 cut-off events. For 2031/2081 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 16336 event pairs, 54 based on Foata normal form. 31/1898 useless extension candidates. Maximal degree in co-relation 4039. Up to 438 conditions per place. [2022-11-16 11:50:20,006 INFO L137 encePairwiseOnDemand]: 205/212 looper letters, 47 selfloop transitions, 15 changer transitions 0/273 dead transitions. [2022-11-16 11:50:20,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 273 transitions, 1275 flow [2022-11-16 11:50:20,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:50:20,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:50:20,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1127 transitions. [2022-11-16 11:50:20,011 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8860062893081762 [2022-11-16 11:50:20,011 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1127 transitions. [2022-11-16 11:50:20,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1127 transitions. [2022-11-16 11:50:20,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:20,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1127 transitions. [2022-11-16 11:50:20,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 187.83333333333334) internal successors, (1127), 6 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:20,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:20,020 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:20,020 INFO L175 Difference]: Start difference. First operand has 244 places, 247 transitions, 1005 flow. Second operand 6 states and 1127 transitions. [2022-11-16 11:50:20,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 273 transitions, 1275 flow [2022-11-16 11:50:20,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 273 transitions, 1249 flow, removed 13 selfloop flow, removed 0 redundant places. [2022-11-16 11:50:20,039 INFO L231 Difference]: Finished difference. Result has 253 places, 254 transitions, 1114 flow [2022-11-16 11:50:20,039 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=983, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1114, PETRI_PLACES=253, PETRI_TRANSITIONS=254} [2022-11-16 11:50:20,040 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 64 predicate places. [2022-11-16 11:50:20,041 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 254 transitions, 1114 flow [2022-11-16 11:50:20,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:20,042 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:20,042 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:20,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:50:20,043 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 11:50:20,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:20,044 INFO L85 PathProgramCache]: Analyzing trace with hash -404418835, now seen corresponding path program 8 times [2022-11-16 11:50:20,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:20,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622647646] [2022-11-16 11:50:20,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:20,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:20,372 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-16 11:50:20,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:20,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622647646] [2022-11-16 11:50:20,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622647646] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:20,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:20,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:50:20,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773202363] [2022-11-16 11:50:20,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:20,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:50:20,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:20,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:50:20,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:50:20,376 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-16 11:50:20,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 254 transitions, 1114 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:20,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:20,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-16 11:50:20,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:20,909 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] L66-2-->L66-3: Formula: (or (not (< |v_thread2Thread1of1ForFork0_~i~1#1_3| 5)) (= v_~isNullA~0_2 0)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~isNullA~0=v_~isNullA~0_2} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~isNullA~0=v_~isNullA~0_2} AuxVars[] AssignedVars[][194], [Black: 3256#(or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0))), Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), 3255#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3217#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3211#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 3)), 61#L89-2true, Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))), 3244#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3224#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3231#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0)))), Black: 3227#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))), 3229#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), Black: 1627#true, 203#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3237#true, 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3239#(or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))), Black: 3246#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= ~isNullB~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3242#(and (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= ~isNullB~0 0))), 28#L66-3true, 3273#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3260#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))))), Black: 3258#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0)))]) [2022-11-16 11:50:20,910 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-16 11:50:20,910 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:50:20,910 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-16 11:50:20,910 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-16 11:50:20,910 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([549] L66-2-->L67: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_5| 5) (not (= v_~isNullA~0_3 0))) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~isNullA~0=v_~isNullA~0_3} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~isNullA~0=v_~isNullA~0_3} AuxVars[] AssignedVars[][199], [Black: 3256#(or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0))), Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), 3255#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3217#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3211#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 3)), 61#L89-2true, Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))), 3244#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3224#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3231#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0)))), Black: 3227#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))), 3229#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), 203#true, Black: 1627#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3237#true, 116#L67true, 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3239#(or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))), Black: 3246#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= ~isNullB~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3242#(and (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= ~isNullB~0 0))), 3273#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3260#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))))), Black: 3258#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0)))]) [2022-11-16 11:50:20,911 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-16 11:50:20,911 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:50:20,911 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-16 11:50:20,911 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-16 11:50:20,922 INFO L130 PetriNetUnfolder]: 416/1942 cut-off events. [2022-11-16 11:50:20,923 INFO L131 PetriNetUnfolder]: For 2451/2522 co-relation queries the response was YES. [2022-11-16 11:50:20,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4104 conditions, 1942 events. 416/1942 cut-off events. For 2451/2522 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 15363 event pairs, 44 based on Foata normal form. 36/1835 useless extension candidates. Maximal degree in co-relation 4070. Up to 447 conditions per place. [2022-11-16 11:50:20,946 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 49 selfloop transitions, 13 changer transitions 1/274 dead transitions. [2022-11-16 11:50:20,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 274 transitions, 1322 flow [2022-11-16 11:50:20,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:50:20,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:50:20,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1128 transitions. [2022-11-16 11:50:20,950 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8867924528301887 [2022-11-16 11:50:20,950 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1128 transitions. [2022-11-16 11:50:20,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1128 transitions. [2022-11-16 11:50:20,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:20,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1128 transitions. [2022-11-16 11:50:20,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:20,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:20,957 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:20,957 INFO L175 Difference]: Start difference. First operand has 253 places, 254 transitions, 1114 flow. Second operand 6 states and 1128 transitions. [2022-11-16 11:50:20,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 274 transitions, 1322 flow [2022-11-16 11:50:20,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 274 transitions, 1314 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-11-16 11:50:20,977 INFO L231 Difference]: Finished difference. Result has 259 places, 254 transitions, 1140 flow [2022-11-16 11:50:20,978 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1106, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1140, PETRI_PLACES=259, PETRI_TRANSITIONS=254} [2022-11-16 11:50:20,979 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 70 predicate places. [2022-11-16 11:50:20,979 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 254 transitions, 1140 flow [2022-11-16 11:50:20,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:20,980 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:20,980 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:20,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:50:20,981 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 11:50:20,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:20,981 INFO L85 PathProgramCache]: Analyzing trace with hash 981059941, now seen corresponding path program 9 times [2022-11-16 11:50:20,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:20,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740150870] [2022-11-16 11:50:20,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:20,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:21,209 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-16 11:50:21,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:21,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740150870] [2022-11-16 11:50:21,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740150870] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:21,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:21,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:50:21,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602052585] [2022-11-16 11:50:21,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:21,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:50:21,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:21,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:50:21,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:50:21,213 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-16 11:50:21,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 254 transitions, 1140 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:21,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:21,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-16 11:50:21,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:21,813 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] L66-2-->L66-3: Formula: (or (not (< |v_thread2Thread1of1ForFork0_~i~1#1_3| 5)) (= v_~isNullA~0_2 0)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~isNullA~0=v_~isNullA~0_2} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~isNullA~0=v_~isNullA~0_2} AuxVars[] AssignedVars[][180], [Black: 3256#(or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0))), Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), 3255#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3275#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0)) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3277#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0)) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)), Black: 3217#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3211#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 3)), 61#L89-2true, Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))), 3244#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3224#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3231#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0)))), Black: 3227#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))), 3229#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), Black: 1627#true, 203#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3237#true, 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3239#(or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))), Black: 3246#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= ~isNullB~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), 3283#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3242#(and (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= ~isNullB~0 0))), 28#L66-3true, 3273#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3260#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))))), Black: 3258#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0)))]) [2022-11-16 11:50:21,813 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-16 11:50:21,813 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-16 11:50:21,814 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:50:21,814 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-16 11:50:21,814 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([549] L66-2-->L67: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_5| 5) (not (= v_~isNullA~0_3 0))) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~isNullA~0=v_~isNullA~0_3} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~isNullA~0=v_~isNullA~0_3} AuxVars[] AssignedVars[][198], [Black: 3256#(or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0))), Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 3255#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3275#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0)) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3277#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0)) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)), Black: 3217#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3211#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 3)), 61#L89-2true, Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))), 3244#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3224#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3231#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0)))), Black: 3227#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))), 3229#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), 203#true, Black: 1627#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3237#true, 116#L67true, 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3239#(or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))), Black: 3246#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= ~isNullB~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), 3283#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3242#(and (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= ~isNullB~0 0))), 3273#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3260#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))))), Black: 3258#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0)))]) [2022-11-16 11:50:21,814 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-16 11:50:21,815 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-16 11:50:21,815 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:50:21,815 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-16 11:50:21,829 INFO L130 PetriNetUnfolder]: 416/1998 cut-off events. [2022-11-16 11:50:21,829 INFO L131 PetriNetUnfolder]: For 2943/3003 co-relation queries the response was YES. [2022-11-16 11:50:21,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4297 conditions, 1998 events. 416/1998 cut-off events. For 2943/3003 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 16045 event pairs, 66 based on Foata normal form. 23/1869 useless extension candidates. Maximal degree in co-relation 4261. Up to 438 conditions per place. [2022-11-16 11:50:21,852 INFO L137 encePairwiseOnDemand]: 205/212 looper letters, 53 selfloop transitions, 9 changer transitions 2/275 dead transitions. [2022-11-16 11:50:21,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 275 transitions, 1391 flow [2022-11-16 11:50:21,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:50:21,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:50:21,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1123 transitions. [2022-11-16 11:50:21,856 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8828616352201258 [2022-11-16 11:50:21,856 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1123 transitions. [2022-11-16 11:50:21,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1123 transitions. [2022-11-16 11:50:21,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:21,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1123 transitions. [2022-11-16 11:50:21,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 187.16666666666666) internal successors, (1123), 6 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:21,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:21,863 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:21,864 INFO L175 Difference]: Start difference. First operand has 259 places, 254 transitions, 1140 flow. Second operand 6 states and 1123 transitions. [2022-11-16 11:50:21,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 275 transitions, 1391 flow [2022-11-16 11:50:21,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 275 transitions, 1357 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-11-16 11:50:21,882 INFO L231 Difference]: Finished difference. Result has 261 places, 255 transitions, 1154 flow [2022-11-16 11:50:21,883 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1112, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1154, PETRI_PLACES=261, PETRI_TRANSITIONS=255} [2022-11-16 11:50:21,883 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 72 predicate places. [2022-11-16 11:50:21,883 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 255 transitions, 1154 flow [2022-11-16 11:50:21,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:21,884 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:21,884 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:21,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:50:21,885 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 11:50:21,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:21,886 INFO L85 PathProgramCache]: Analyzing trace with hash 2042329695, now seen corresponding path program 10 times [2022-11-16 11:50:21,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:21,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137106923] [2022-11-16 11:50:21,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:21,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:22,170 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-16 11:50:22,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:22,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137106923] [2022-11-16 11:50:22,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137106923] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:22,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:22,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:50:22,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117578607] [2022-11-16 11:50:22,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:22,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:50:22,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:22,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:50:22,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:50:22,178 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-16 11:50:22,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 255 transitions, 1154 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:22,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:22,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-16 11:50:22,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:22,771 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] L66-2-->L66-3: Formula: (or (not (< |v_thread2Thread1of1ForFork0_~i~1#1_3| 5)) (= v_~isNullA~0_2 0)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~isNullA~0=v_~isNullA~0_2} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~isNullA~0=v_~isNullA~0_2} AuxVars[] AssignedVars[][180], [Black: 3256#(or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0))), Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), 3255#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3275#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0)) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3217#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3211#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 3)), 61#L89-2true, Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))), 3244#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3284#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0)) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0)))), Black: 3288#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0))), Black: 3290#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)), Black: 3224#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3231#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0)))), Black: 3227#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), Black: 1627#true, 203#true, Black: 3237#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3239#(or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))), Black: 3246#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= ~isNullB~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), 3283#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3242#(and (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= ~isNullB~0 0))), 3297#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), 28#L66-3true, 3273#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3260#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))))), Black: 3258#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0)))]) [2022-11-16 11:50:22,772 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-16 11:50:22,772 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:50:22,773 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-16 11:50:22,773 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-16 11:50:22,773 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([549] L66-2-->L67: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_5| 5) (not (= v_~isNullA~0_3 0))) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~isNullA~0=v_~isNullA~0_3} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~isNullA~0=v_~isNullA~0_3} AuxVars[] AssignedVars[][197], [Black: 3256#(or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0))), Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), 3255#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3275#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0)) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3217#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3211#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 3)), 61#L89-2true, Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))), 3244#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3284#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0)) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0)))), Black: 3288#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0))), Black: 3290#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)), Black: 3224#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3231#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0)))), Black: 3227#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), Black: 1627#true, 203#true, Black: 3237#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 116#L67true, 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3239#(or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))), 3283#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3246#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= ~isNullB~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3242#(and (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= ~isNullB~0 0))), 3297#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), 3273#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3260#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))))), Black: 3258#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0)))]) [2022-11-16 11:50:22,774 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-16 11:50:22,774 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:50:22,774 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-16 11:50:22,774 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-16 11:50:22,789 INFO L130 PetriNetUnfolder]: 413/1947 cut-off events. [2022-11-16 11:50:22,790 INFO L131 PetriNetUnfolder]: For 3023/3085 co-relation queries the response was YES. [2022-11-16 11:50:22,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4243 conditions, 1947 events. 413/1947 cut-off events. For 3023/3085 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 15443 event pairs, 48 based on Foata normal form. 30/1832 useless extension candidates. Maximal degree in co-relation 4205. Up to 438 conditions per place. [2022-11-16 11:50:22,810 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 49 selfloop transitions, 16 changer transitions 2/278 dead transitions. [2022-11-16 11:50:22,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 278 transitions, 1403 flow [2022-11-16 11:50:22,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:50:22,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:50:22,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1130 transitions. [2022-11-16 11:50:22,814 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8883647798742138 [2022-11-16 11:50:22,814 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1130 transitions. [2022-11-16 11:50:22,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1130 transitions. [2022-11-16 11:50:22,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:22,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1130 transitions. [2022-11-16 11:50:22,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 188.33333333333334) internal successors, (1130), 6 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:22,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:22,821 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:22,821 INFO L175 Difference]: Start difference. First operand has 261 places, 255 transitions, 1154 flow. Second operand 6 states and 1130 transitions. [2022-11-16 11:50:22,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 278 transitions, 1403 flow [2022-11-16 11:50:22,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 278 transitions, 1386 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-16 11:50:22,844 INFO L231 Difference]: Finished difference. Result has 265 places, 257 transitions, 1212 flow [2022-11-16 11:50:22,844 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1212, PETRI_PLACES=265, PETRI_TRANSITIONS=257} [2022-11-16 11:50:22,849 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 76 predicate places. [2022-11-16 11:50:22,849 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 257 transitions, 1212 flow [2022-11-16 11:50:22,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:22,850 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:22,850 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:22,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:50:22,851 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 11:50:22,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:22,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1814160987, now seen corresponding path program 11 times [2022-11-16 11:50:22,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:22,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112090837] [2022-11-16 11:50:22,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:22,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:23,130 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-16 11:50:23,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:23,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112090837] [2022-11-16 11:50:23,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112090837] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:23,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:23,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:50:23,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439134057] [2022-11-16 11:50:23,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:23,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:50:23,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:23,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:50:23,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:50:23,136 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-16 11:50:23,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 257 transitions, 1212 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:23,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:23,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-16 11:50:23,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:24,102 INFO L130 PetriNetUnfolder]: 539/2991 cut-off events. [2022-11-16 11:50:24,103 INFO L131 PetriNetUnfolder]: For 4048/4148 co-relation queries the response was YES. [2022-11-16 11:50:24,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6102 conditions, 2991 events. 539/2991 cut-off events. For 4048/4148 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 28293 event pairs, 129 based on Foata normal form. 40/2825 useless extension candidates. Maximal degree in co-relation 6062. Up to 554 conditions per place. [2022-11-16 11:50:24,147 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 53 selfloop transitions, 18 changer transitions 0/289 dead transitions. [2022-11-16 11:50:24,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 289 transitions, 1499 flow [2022-11-16 11:50:24,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:50:24,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:50:24,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1135 transitions. [2022-11-16 11:50:24,152 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8922955974842768 [2022-11-16 11:50:24,152 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1135 transitions. [2022-11-16 11:50:24,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1135 transitions. [2022-11-16 11:50:24,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:24,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1135 transitions. [2022-11-16 11:50:24,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 189.16666666666666) internal successors, (1135), 6 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:24,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:24,160 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:24,160 INFO L175 Difference]: Start difference. First operand has 265 places, 257 transitions, 1212 flow. Second operand 6 states and 1135 transitions. [2022-11-16 11:50:24,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 289 transitions, 1499 flow [2022-11-16 11:50:24,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 289 transitions, 1473 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-11-16 11:50:24,188 INFO L231 Difference]: Finished difference. Result has 266 places, 263 transitions, 1314 flow [2022-11-16 11:50:24,189 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1186, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1314, PETRI_PLACES=266, PETRI_TRANSITIONS=263} [2022-11-16 11:50:24,191 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 77 predicate places. [2022-11-16 11:50:24,191 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 263 transitions, 1314 flow [2022-11-16 11:50:24,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:24,192 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:24,192 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:24,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:50:24,193 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 11:50:24,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:24,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1202976121, now seen corresponding path program 12 times [2022-11-16 11:50:24,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:24,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360834507] [2022-11-16 11:50:24,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:24,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:24,478 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-16 11:50:24,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:24,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360834507] [2022-11-16 11:50:24,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360834507] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:24,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:24,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:50:24,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079878301] [2022-11-16 11:50:24,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:24,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:50:24,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:24,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:50:24,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:50:24,483 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-16 11:50:24,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 263 transitions, 1314 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:24,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:24,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-16 11:50:24,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:25,322 INFO L130 PetriNetUnfolder]: 723/3323 cut-off events. [2022-11-16 11:50:25,322 INFO L131 PetriNetUnfolder]: For 4782/4907 co-relation queries the response was YES. [2022-11-16 11:50:25,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6973 conditions, 3323 events. 723/3323 cut-off events. For 4782/4907 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 29883 event pairs, 117 based on Foata normal form. 52/3122 useless extension candidates. Maximal degree in co-relation 6932. Up to 548 conditions per place. [2022-11-16 11:50:25,363 INFO L137 encePairwiseOnDemand]: 203/212 looper letters, 47 selfloop transitions, 23 changer transitions 0/287 dead transitions. [2022-11-16 11:50:25,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 287 transitions, 1609 flow [2022-11-16 11:50:25,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:50:25,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:50:25,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1127 transitions. [2022-11-16 11:50:25,367 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8860062893081762 [2022-11-16 11:50:25,367 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1127 transitions. [2022-11-16 11:50:25,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1127 transitions. [2022-11-16 11:50:25,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:25,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1127 transitions. [2022-11-16 11:50:25,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 187.83333333333334) internal successors, (1127), 6 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:25,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:25,374 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:25,374 INFO L175 Difference]: Start difference. First operand has 266 places, 263 transitions, 1314 flow. Second operand 6 states and 1127 transitions. [2022-11-16 11:50:25,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 287 transitions, 1609 flow [2022-11-16 11:50:25,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 287 transitions, 1600 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-11-16 11:50:25,404 INFO L231 Difference]: Finished difference. Result has 274 places, 268 transitions, 1450 flow [2022-11-16 11:50:25,405 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1305, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1450, PETRI_PLACES=274, PETRI_TRANSITIONS=268} [2022-11-16 11:50:25,405 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 85 predicate places. [2022-11-16 11:50:25,406 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 268 transitions, 1450 flow [2022-11-16 11:50:25,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:25,406 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:25,407 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:25,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 11:50:25,407 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 11:50:25,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:25,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1751939715, now seen corresponding path program 13 times [2022-11-16 11:50:25,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:25,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940322849] [2022-11-16 11:50:25,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:25,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:25,667 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-16 11:50:25,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:25,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940322849] [2022-11-16 11:50:25,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940322849] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:25,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:25,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:50:25,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178012682] [2022-11-16 11:50:25,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:25,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:50:25,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:25,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:50:25,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:50:25,672 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-16 11:50:25,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 268 transitions, 1450 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:25,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:25,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-16 11:50:25,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:27,193 INFO L130 PetriNetUnfolder]: 787/4624 cut-off events. [2022-11-16 11:50:27,194 INFO L131 PetriNetUnfolder]: For 6888/7042 co-relation queries the response was YES. [2022-11-16 11:50:27,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9324 conditions, 4624 events. 787/4624 cut-off events. For 6888/7042 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 47631 event pairs, 144 based on Foata normal form. 47/4337 useless extension candidates. Maximal degree in co-relation 9279. Up to 510 conditions per place. [2022-11-16 11:50:27,265 INFO L137 encePairwiseOnDemand]: 205/212 looper letters, 56 selfloop transitions, 20 changer transitions 0/299 dead transitions. [2022-11-16 11:50:27,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 299 transitions, 1776 flow [2022-11-16 11:50:27,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:50:27,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:50:27,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1132 transitions. [2022-11-16 11:50:27,273 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.889937106918239 [2022-11-16 11:50:27,273 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1132 transitions. [2022-11-16 11:50:27,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1132 transitions. [2022-11-16 11:50:27,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:27,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1132 transitions. [2022-11-16 11:50:27,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 188.66666666666666) internal successors, (1132), 6 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:27,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:27,284 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:27,284 INFO L175 Difference]: Start difference. First operand has 274 places, 268 transitions, 1450 flow. Second operand 6 states and 1132 transitions. [2022-11-16 11:50:27,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 299 transitions, 1776 flow [2022-11-16 11:50:27,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 299 transitions, 1753 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-11-16 11:50:27,332 INFO L231 Difference]: Finished difference. Result has 282 places, 273 transitions, 1559 flow [2022-11-16 11:50:27,333 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1427, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1559, PETRI_PLACES=282, PETRI_TRANSITIONS=273} [2022-11-16 11:50:27,334 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 93 predicate places. [2022-11-16 11:50:27,334 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 273 transitions, 1559 flow [2022-11-16 11:50:27,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:27,335 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:27,335 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:27,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 11:50:27,336 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 11:50:27,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:27,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1223686054, now seen corresponding path program 1 times [2022-11-16 11:50:27,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:27,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440890203] [2022-11-16 11:50:27,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:27,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:27,643 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-16 11:50:27,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:27,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440890203] [2022-11-16 11:50:27,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440890203] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:27,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:27,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:50:27,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478715844] [2022-11-16 11:50:27,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:27,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:50:27,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:27,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:50:27,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:50:27,649 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-16 11:50:27,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 273 transitions, 1559 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:27,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:27,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-16 11:50:27,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:29,383 INFO L130 PetriNetUnfolder]: 797/4868 cut-off events. [2022-11-16 11:50:29,383 INFO L131 PetriNetUnfolder]: For 8448/8600 co-relation queries the response was YES. [2022-11-16 11:50:29,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9963 conditions, 4868 events. 797/4868 cut-off events. For 8448/8600 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 50811 event pairs, 150 based on Foata normal form. 33/4552 useless extension candidates. Maximal degree in co-relation 9914. Up to 509 conditions per place. [2022-11-16 11:50:29,432 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 65 selfloop transitions, 11 changer transitions 6/305 dead transitions. [2022-11-16 11:50:29,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 305 transitions, 1938 flow [2022-11-16 11:50:29,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:50:29,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:50:29,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1126 transitions. [2022-11-16 11:50:29,435 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8852201257861635 [2022-11-16 11:50:29,436 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1126 transitions. [2022-11-16 11:50:29,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1126 transitions. [2022-11-16 11:50:29,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:29,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1126 transitions. [2022-11-16 11:50:29,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 187.66666666666666) internal successors, (1126), 6 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:29,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:29,444 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:29,444 INFO L175 Difference]: Start difference. First operand has 282 places, 273 transitions, 1559 flow. Second operand 6 states and 1126 transitions. [2022-11-16 11:50:29,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 305 transitions, 1938 flow [2022-11-16 11:50:29,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 305 transitions, 1910 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-11-16 11:50:29,492 INFO L231 Difference]: Finished difference. Result has 290 places, 274 transitions, 1591 flow [2022-11-16 11:50:29,493 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1539, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1591, PETRI_PLACES=290, PETRI_TRANSITIONS=274} [2022-11-16 11:50:29,494 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 101 predicate places. [2022-11-16 11:50:29,494 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 274 transitions, 1591 flow [2022-11-16 11:50:29,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:29,495 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:29,495 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:29,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 11:50:29,496 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 11:50:29,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:29,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1774146388, now seen corresponding path program 2 times [2022-11-16 11:50:29,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:29,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516348682] [2022-11-16 11:50:29,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:29,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:29,842 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-16 11:50:29,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:29,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516348682] [2022-11-16 11:50:29,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516348682] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:29,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:29,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:50:29,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246089219] [2022-11-16 11:50:29,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:29,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:50:29,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:29,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:50:29,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:50:29,848 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-16 11:50:29,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 274 transitions, 1591 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:29,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:29,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-16 11:50:29,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:31,132 INFO L130 PetriNetUnfolder]: 779/4816 cut-off events. [2022-11-16 11:50:31,132 INFO L131 PetriNetUnfolder]: For 8635/8798 co-relation queries the response was YES. [2022-11-16 11:50:31,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9851 conditions, 4816 events. 779/4816 cut-off events. For 8635/8798 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 50306 event pairs, 108 based on Foata normal form. 53/4535 useless extension candidates. Maximal degree in co-relation 9798. Up to 509 conditions per place. [2022-11-16 11:50:31,193 INFO L137 encePairwiseOnDemand]: 201/212 looper letters, 59 selfloop transitions, 27 changer transitions 2/311 dead transitions. [2022-11-16 11:50:31,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 311 transitions, 1956 flow [2022-11-16 11:50:31,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:50:31,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:50:31,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1142 transitions. [2022-11-16 11:50:31,197 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8977987421383647 [2022-11-16 11:50:31,198 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1142 transitions. [2022-11-16 11:50:31,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1142 transitions. [2022-11-16 11:50:31,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:31,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1142 transitions. [2022-11-16 11:50:31,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 190.33333333333334) internal successors, (1142), 6 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:31,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:31,206 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:31,206 INFO L175 Difference]: Start difference. First operand has 290 places, 274 transitions, 1591 flow. Second operand 6 states and 1142 transitions. [2022-11-16 11:50:31,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 311 transitions, 1956 flow [2022-11-16 11:50:31,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 311 transitions, 1934 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-16 11:50:31,262 INFO L231 Difference]: Finished difference. Result has 293 places, 281 transitions, 1753 flow [2022-11-16 11:50:31,263 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1574, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1753, PETRI_PLACES=293, PETRI_TRANSITIONS=281} [2022-11-16 11:50:31,263 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 104 predicate places. [2022-11-16 11:50:31,264 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 281 transitions, 1753 flow [2022-11-16 11:50:31,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:31,264 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:31,265 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:31,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 11:50:31,265 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 11:50:31,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:31,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1497634582, now seen corresponding path program 3 times [2022-11-16 11:50:31,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:31,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969753285] [2022-11-16 11:50:31,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:31,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:31,609 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-16 11:50:31,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:31,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969753285] [2022-11-16 11:50:31,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969753285] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:31,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:31,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:50:31,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971145121] [2022-11-16 11:50:31,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:31,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:50:31,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:31,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:50:31,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:50:31,614 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-16 11:50:31,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 281 transitions, 1753 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:31,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:31,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-16 11:50:31,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:32,873 INFO L130 PetriNetUnfolder]: 756/4526 cut-off events. [2022-11-16 11:50:32,873 INFO L131 PetriNetUnfolder]: For 9507/9669 co-relation queries the response was YES. [2022-11-16 11:50:32,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9734 conditions, 4526 events. 756/4526 cut-off events. For 9507/9669 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 46021 event pairs, 142 based on Foata normal form. 46/4252 useless extension candidates. Maximal degree in co-relation 9679. Up to 510 conditions per place. [2022-11-16 11:50:32,923 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 58 selfloop transitions, 21 changer transitions 5/307 dead transitions. [2022-11-16 11:50:32,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 307 transitions, 2034 flow [2022-11-16 11:50:32,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:50:32,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:50:32,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1134 transitions. [2022-11-16 11:50:32,927 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8915094339622641 [2022-11-16 11:50:32,927 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1134 transitions. [2022-11-16 11:50:32,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1134 transitions. [2022-11-16 11:50:32,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:32,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1134 transitions. [2022-11-16 11:50:32,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:32,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:32,934 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:32,934 INFO L175 Difference]: Start difference. First operand has 293 places, 281 transitions, 1753 flow. Second operand 6 states and 1134 transitions. [2022-11-16 11:50:32,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 307 transitions, 2034 flow [2022-11-16 11:50:32,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 307 transitions, 2019 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-16 11:50:32,990 INFO L231 Difference]: Finished difference. Result has 298 places, 281 transitions, 1802 flow [2022-11-16 11:50:32,990 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1738, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1802, PETRI_PLACES=298, PETRI_TRANSITIONS=281} [2022-11-16 11:50:32,991 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 109 predicate places. [2022-11-16 11:50:32,991 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 281 transitions, 1802 flow [2022-11-16 11:50:32,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:32,992 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:32,992 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:32,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 11:50:32,993 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 11:50:32,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:32,994 INFO L85 PathProgramCache]: Analyzing trace with hash 962128846, now seen corresponding path program 1 times [2022-11-16 11:50:32,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:32,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738249479] [2022-11-16 11:50:32,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:32,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:33,252 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-16 11:50:33,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:33,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738249479] [2022-11-16 11:50:33,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738249479] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:33,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:33,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:50:33,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5163866] [2022-11-16 11:50:33,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:33,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:50:33,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:33,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:50:33,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:50:33,257 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-16 11:50:33,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 281 transitions, 1802 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:33,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:33,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-16 11:50:33,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:34,589 INFO L130 PetriNetUnfolder]: 788/4246 cut-off events. [2022-11-16 11:50:34,590 INFO L131 PetriNetUnfolder]: For 9244/9350 co-relation queries the response was YES. [2022-11-16 11:50:34,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9203 conditions, 4246 events. 788/4246 cut-off events. For 9244/9350 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 42709 event pairs, 133 based on Foata normal form. 25/3920 useless extension candidates. Maximal degree in co-relation 9146. Up to 662 conditions per place. [2022-11-16 11:50:34,636 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 60 selfloop transitions, 12 changer transitions 3/304 dead transitions. [2022-11-16 11:50:34,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 304 transitions, 2098 flow [2022-11-16 11:50:34,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:50:34,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:50:34,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1122 transitions. [2022-11-16 11:50:34,640 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8820754716981132 [2022-11-16 11:50:34,640 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1122 transitions. [2022-11-16 11:50:34,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1122 transitions. [2022-11-16 11:50:34,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:34,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1122 transitions. [2022-11-16 11:50:34,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 187.0) internal successors, (1122), 6 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:34,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:34,649 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:34,649 INFO L175 Difference]: Start difference. First operand has 298 places, 281 transitions, 1802 flow. Second operand 6 states and 1122 transitions. [2022-11-16 11:50:34,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 304 transitions, 2098 flow [2022-11-16 11:50:34,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 304 transitions, 2042 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-11-16 11:50:34,695 INFO L231 Difference]: Finished difference. Result has 300 places, 282 transitions, 1803 flow [2022-11-16 11:50:34,696 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1746, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1803, PETRI_PLACES=300, PETRI_TRANSITIONS=282} [2022-11-16 11:50:34,696 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 111 predicate places. [2022-11-16 11:50:34,696 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 282 transitions, 1803 flow [2022-11-16 11:50:34,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:34,697 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:34,697 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:34,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 11:50:34,698 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 11:50:34,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:34,698 INFO L85 PathProgramCache]: Analyzing trace with hash 74293658, now seen corresponding path program 2 times [2022-11-16 11:50:34,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:34,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817860682] [2022-11-16 11:50:34,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:34,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:34,958 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-16 11:50:34,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:34,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817860682] [2022-11-16 11:50:34,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817860682] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:34,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:34,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:50:34,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431020881] [2022-11-16 11:50:34,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:34,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:50:34,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:34,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:50:34,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:50:34,963 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-16 11:50:34,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 282 transitions, 1803 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:34,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:34,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-16 11:50:34,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:36,050 INFO L130 PetriNetUnfolder]: 785/4185 cut-off events. [2022-11-16 11:50:36,050 INFO L131 PetriNetUnfolder]: For 9604/9718 co-relation queries the response was YES. [2022-11-16 11:50:36,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9243 conditions, 4185 events. 785/4185 cut-off events. For 9604/9718 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 41831 event pairs, 126 based on Foata normal form. 45/3899 useless extension candidates. Maximal degree in co-relation 9184. Up to 596 conditions per place. [2022-11-16 11:50:36,235 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 51 selfloop transitions, 24 changer transitions 2/306 dead transitions. [2022-11-16 11:50:36,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 306 transitions, 2087 flow [2022-11-16 11:50:36,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:50:36,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:50:36,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1131 transitions. [2022-11-16 11:50:36,239 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8891509433962265 [2022-11-16 11:50:36,239 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1131 transitions. [2022-11-16 11:50:36,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1131 transitions. [2022-11-16 11:50:36,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:36,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1131 transitions. [2022-11-16 11:50:36,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 188.5) internal successors, (1131), 6 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:36,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:36,250 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:36,250 INFO L175 Difference]: Start difference. First operand has 300 places, 282 transitions, 1803 flow. Second operand 6 states and 1131 transitions. [2022-11-16 11:50:36,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 306 transitions, 2087 flow [2022-11-16 11:50:36,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 306 transitions, 2064 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-11-16 11:50:36,305 INFO L231 Difference]: Finished difference. Result has 302 places, 285 transitions, 1896 flow [2022-11-16 11:50:36,306 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1783, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1896, PETRI_PLACES=302, PETRI_TRANSITIONS=285} [2022-11-16 11:50:36,306 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 113 predicate places. [2022-11-16 11:50:36,306 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 285 transitions, 1896 flow [2022-11-16 11:50:36,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:36,309 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:36,309 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:36,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 11:50:36,310 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 11:50:36,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:36,310 INFO L85 PathProgramCache]: Analyzing trace with hash 273529386, now seen corresponding path program 3 times [2022-11-16 11:50:36,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:36,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069826112] [2022-11-16 11:50:36,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:36,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:36,596 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-16 11:50:36,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:36,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069826112] [2022-11-16 11:50:36,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069826112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:36,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:36,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:50:36,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459579746] [2022-11-16 11:50:36,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:36,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:50:36,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:36,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:50:36,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:50:36,601 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-16 11:50:36,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 285 transitions, 1896 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:36,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:36,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-16 11:50:36,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:37,932 INFO L130 PetriNetUnfolder]: 780/4060 cut-off events. [2022-11-16 11:50:37,932 INFO L131 PetriNetUnfolder]: For 10707/10822 co-relation queries the response was YES. [2022-11-16 11:50:37,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9253 conditions, 4060 events. 780/4060 cut-off events. For 10707/10822 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 39997 event pairs, 147 based on Foata normal form. 39/3768 useless extension candidates. Maximal degree in co-relation 9193. Up to 621 conditions per place. [2022-11-16 11:50:37,985 INFO L137 encePairwiseOnDemand]: 203/212 looper letters, 49 selfloop transitions, 20 changer transitions 4/302 dead transitions. [2022-11-16 11:50:37,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 302 transitions, 2137 flow [2022-11-16 11:50:37,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:50:37,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:50:37,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1123 transitions. [2022-11-16 11:50:37,990 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8828616352201258 [2022-11-16 11:50:37,990 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1123 transitions. [2022-11-16 11:50:37,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1123 transitions. [2022-11-16 11:50:37,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:37,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1123 transitions. [2022-11-16 11:50:37,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 187.16666666666666) internal successors, (1123), 6 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:37,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:37,999 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:37,999 INFO L175 Difference]: Start difference. First operand has 302 places, 285 transitions, 1896 flow. Second operand 6 states and 1123 transitions. [2022-11-16 11:50:37,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 302 transitions, 2137 flow [2022-11-16 11:50:38,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 302 transitions, 2111 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-11-16 11:50:38,069 INFO L231 Difference]: Finished difference. Result has 305 places, 284 transitions, 1897 flow [2022-11-16 11:50:38,070 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1870, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1897, PETRI_PLACES=305, PETRI_TRANSITIONS=284} [2022-11-16 11:50:38,071 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 116 predicate places. [2022-11-16 11:50:38,071 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 284 transitions, 1897 flow [2022-11-16 11:50:38,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:38,072 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:38,072 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:38,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 11:50:38,073 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 11:50:38,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:38,073 INFO L85 PathProgramCache]: Analyzing trace with hash 485639680, now seen corresponding path program 4 times [2022-11-16 11:50:38,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:38,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595543880] [2022-11-16 11:50:38,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:38,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:38,395 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-16 11:50:38,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:38,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595543880] [2022-11-16 11:50:38,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595543880] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:38,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:38,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:50:38,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797900350] [2022-11-16 11:50:38,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:38,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:50:38,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:38,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:50:38,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:50:38,403 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-16 11:50:38,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 284 transitions, 1897 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:38,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:38,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-16 11:50:38,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:39,675 INFO L130 PetriNetUnfolder]: 726/4367 cut-off events. [2022-11-16 11:50:39,675 INFO L131 PetriNetUnfolder]: For 11639/11810 co-relation queries the response was YES. [2022-11-16 11:50:39,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9723 conditions, 4367 events. 726/4367 cut-off events. For 11639/11810 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 43915 event pairs, 207 based on Foata normal form. 40/4104 useless extension candidates. Maximal degree in co-relation 9662. Up to 830 conditions per place. [2022-11-16 11:50:39,724 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 66 selfloop transitions, 16 changer transitions 4/312 dead transitions. [2022-11-16 11:50:39,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 312 transitions, 2222 flow [2022-11-16 11:50:39,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:50:39,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:50:39,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1131 transitions. [2022-11-16 11:50:39,728 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8891509433962265 [2022-11-16 11:50:39,729 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1131 transitions. [2022-11-16 11:50:39,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1131 transitions. [2022-11-16 11:50:39,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:39,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1131 transitions. [2022-11-16 11:50:39,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 188.5) internal successors, (1131), 6 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:39,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:39,736 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:39,736 INFO L175 Difference]: Start difference. First operand has 305 places, 284 transitions, 1897 flow. Second operand 6 states and 1131 transitions. [2022-11-16 11:50:39,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 312 transitions, 2222 flow [2022-11-16 11:50:39,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 312 transitions, 2149 flow, removed 7 selfloop flow, removed 8 redundant places. [2022-11-16 11:50:39,808 INFO L231 Difference]: Finished difference. Result has 302 places, 284 transitions, 1861 flow [2022-11-16 11:50:39,809 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1824, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1861, PETRI_PLACES=302, PETRI_TRANSITIONS=284} [2022-11-16 11:50:39,810 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 113 predicate places. [2022-11-16 11:50:39,810 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 284 transitions, 1861 flow [2022-11-16 11:50:39,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:39,811 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:39,811 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:39,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-16 11:50:39,812 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 11:50:39,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:39,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1970374542, now seen corresponding path program 5 times [2022-11-16 11:50:39,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:39,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534943627] [2022-11-16 11:50:39,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:39,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:40,121 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-16 11:50:40,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:40,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534943627] [2022-11-16 11:50:40,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534943627] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:40,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:40,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:50:40,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872566806] [2022-11-16 11:50:40,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:40,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:50:40,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:40,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:50:40,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:50:40,126 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-16 11:50:40,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 284 transitions, 1861 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:40,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:40,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-16 11:50:40,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:41,323 INFO L130 PetriNetUnfolder]: 714/4220 cut-off events. [2022-11-16 11:50:41,323 INFO L131 PetriNetUnfolder]: For 10100/10258 co-relation queries the response was YES. [2022-11-16 11:50:41,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9333 conditions, 4220 events. 714/4220 cut-off events. For 10100/10258 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 42073 event pairs, 201 based on Foata normal form. 42/3971 useless extension candidates. Maximal degree in co-relation 9274. Up to 830 conditions per place. [2022-11-16 11:50:41,374 INFO L137 encePairwiseOnDemand]: 203/212 looper letters, 63 selfloop transitions, 22 changer transitions 2/313 dead transitions. [2022-11-16 11:50:41,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 313 transitions, 2163 flow [2022-11-16 11:50:41,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:50:41,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:50:41,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1139 transitions. [2022-11-16 11:50:41,378 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8954402515723271 [2022-11-16 11:50:41,378 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1139 transitions. [2022-11-16 11:50:41,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1139 transitions. [2022-11-16 11:50:41,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:41,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1139 transitions. [2022-11-16 11:50:41,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 189.83333333333334) internal successors, (1139), 6 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:41,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:41,387 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:41,387 INFO L175 Difference]: Start difference. First operand has 302 places, 284 transitions, 1861 flow. Second operand 6 states and 1139 transitions. [2022-11-16 11:50:41,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 313 transitions, 2163 flow [2022-11-16 11:50:41,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 313 transitions, 2119 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-11-16 11:50:41,458 INFO L231 Difference]: Finished difference. Result has 304 places, 286 transitions, 1915 flow [2022-11-16 11:50:41,459 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1819, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1915, PETRI_PLACES=304, PETRI_TRANSITIONS=286} [2022-11-16 11:50:41,459 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 115 predicate places. [2022-11-16 11:50:41,460 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 286 transitions, 1915 flow [2022-11-16 11:50:41,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:41,460 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:41,461 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:41,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-16 11:50:41,461 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 11:50:41,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:41,462 INFO L85 PathProgramCache]: Analyzing trace with hash -858463852, now seen corresponding path program 6 times [2022-11-16 11:50:41,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:41,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261307275] [2022-11-16 11:50:41,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:41,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:41,768 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-16 11:50:41,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:41,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261307275] [2022-11-16 11:50:41,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261307275] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:41,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:41,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:50:41,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558119262] [2022-11-16 11:50:41,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:41,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:50:41,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:41,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:50:41,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:50:41,773 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-16 11:50:41,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 286 transitions, 1915 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:41,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:41,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-16 11:50:41,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:42,998 INFO L130 PetriNetUnfolder]: 704/4071 cut-off events. [2022-11-16 11:50:42,999 INFO L131 PetriNetUnfolder]: For 10072/10238 co-relation queries the response was YES. [2022-11-16 11:50:43,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9171 conditions, 4071 events. 704/4071 cut-off events. For 10072/10238 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 40193 event pairs, 141 based on Foata normal form. 50/3849 useless extension candidates. Maximal degree in co-relation 9111. Up to 699 conditions per place. [2022-11-16 11:50:43,046 INFO L137 encePairwiseOnDemand]: 203/212 looper letters, 59 selfloop transitions, 24 changer transitions 3/312 dead transitions. [2022-11-16 11:50:43,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 312 transitions, 2200 flow [2022-11-16 11:50:43,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:50:43,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:50:43,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1136 transitions. [2022-11-16 11:50:43,050 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8930817610062893 [2022-11-16 11:50:43,050 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1136 transitions. [2022-11-16 11:50:43,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1136 transitions. [2022-11-16 11:50:43,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:43,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1136 transitions. [2022-11-16 11:50:43,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 189.33333333333334) internal successors, (1136), 6 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:43,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:43,058 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:43,058 INFO L175 Difference]: Start difference. First operand has 304 places, 286 transitions, 1915 flow. Second operand 6 states and 1136 transitions. [2022-11-16 11:50:43,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 312 transitions, 2200 flow [2022-11-16 11:50:43,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 312 transitions, 2175 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-11-16 11:50:43,130 INFO L231 Difference]: Finished difference. Result has 306 places, 285 transitions, 1920 flow [2022-11-16 11:50:43,130 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1890, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1920, PETRI_PLACES=306, PETRI_TRANSITIONS=285} [2022-11-16 11:50:43,131 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 117 predicate places. [2022-11-16 11:50:43,131 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 285 transitions, 1920 flow [2022-11-16 11:50:43,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:43,132 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:43,132 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:43,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-16 11:50:43,133 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 11:50:43,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:43,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1994764753, now seen corresponding path program 1 times [2022-11-16 11:50:43,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:43,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185957534] [2022-11-16 11:50:43,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:43,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:44,657 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-16 11:50:44,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:44,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185957534] [2022-11-16 11:50:44,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185957534] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:44,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:44,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-16 11:50:44,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811604676] [2022-11-16 11:50:44,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:44,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-16 11:50:44,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:44,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 11:50:44,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-11-16 11:50:44,664 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 212 [2022-11-16 11:50:44,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 285 transitions, 1920 flow. Second operand has 19 states, 19 states have (on average 143.47368421052633) internal successors, (2726), 19 states have internal predecessors, (2726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:44,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:44,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 212 [2022-11-16 11:50:44,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:54,551 INFO L130 PetriNetUnfolder]: 13198/32757 cut-off events. [2022-11-16 11:50:54,551 INFO L131 PetriNetUnfolder]: For 80837/80937 co-relation queries the response was YES. [2022-11-16 11:50:55,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78403 conditions, 32757 events. 13198/32757 cut-off events. For 80837/80937 co-relation queries the response was YES. Maximal size of possible extension queue 1184. Compared 378463 event pairs, 4300 based on Foata normal form. 41/30313 useless extension candidates. Maximal degree in co-relation 78343. Up to 6886 conditions per place. [2022-11-16 11:50:55,832 INFO L137 encePairwiseOnDemand]: 184/212 looper letters, 276 selfloop transitions, 81 changer transitions 0/541 dead transitions. [2022-11-16 11:50:55,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 541 transitions, 4297 flow [2022-11-16 11:50:55,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 11:50:55,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-16 11:50:55,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3651 transitions. [2022-11-16 11:50:55,845 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7175707547169812 [2022-11-16 11:50:55,845 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3651 transitions. [2022-11-16 11:50:55,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3651 transitions. [2022-11-16 11:50:55,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:55,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3651 transitions. [2022-11-16 11:50:55,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 152.125) internal successors, (3651), 24 states have internal predecessors, (3651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:55,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 212.0) internal successors, (5300), 25 states have internal predecessors, (5300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:55,865 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 212.0) internal successors, (5300), 25 states have internal predecessors, (5300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:55,866 INFO L175 Difference]: Start difference. First operand has 306 places, 285 transitions, 1920 flow. Second operand 24 states and 3651 transitions. [2022-11-16 11:50:55,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 541 transitions, 4297 flow [2022-11-16 11:50:56,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 541 transitions, 4207 flow, removed 2 selfloop flow, removed 8 redundant places. [2022-11-16 11:50:56,079 INFO L231 Difference]: Finished difference. Result has 332 places, 337 transitions, 2773 flow [2022-11-16 11:50:56,080 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1845, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2773, PETRI_PLACES=332, PETRI_TRANSITIONS=337} [2022-11-16 11:50:56,080 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 143 predicate places. [2022-11-16 11:50:56,080 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 337 transitions, 2773 flow [2022-11-16 11:50:56,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 143.47368421052633) internal successors, (2726), 19 states have internal predecessors, (2726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:56,081 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:56,082 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:56,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-16 11:50:56,082 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 11:50:56,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:56,083 INFO L85 PathProgramCache]: Analyzing trace with hash 766347241, now seen corresponding path program 2 times [2022-11-16 11:50:56,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:56,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816366567] [2022-11-16 11:50:56,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:56,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:57,438 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-16 11:50:57,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:57,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816366567] [2022-11-16 11:50:57,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816366567] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:57,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:57,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-16 11:50:57,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360392195] [2022-11-16 11:50:57,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:57,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-16 11:50:57,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:57,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 11:50:57,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-11-16 11:50:57,442 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 212 [2022-11-16 11:50:57,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 337 transitions, 2773 flow. Second operand has 19 states, 19 states have (on average 143.47368421052633) internal successors, (2726), 19 states have internal predecessors, (2726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:57,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:57,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 212 [2022-11-16 11:50:57,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand