./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/chl-exp-term-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8e1c903 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a52e1d3-edcf-415d-a994-d69a9189a903/bin/uautomizer-IVEQpCNsaX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a52e1d3-edcf-415d-a994-d69a9189a903/bin/uautomizer-IVEQpCNsaX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a52e1d3-edcf-415d-a994-d69a9189a903/bin/uautomizer-IVEQpCNsaX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a52e1d3-edcf-415d-a994-d69a9189a903/bin/uautomizer-IVEQpCNsaX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-exp-term-subst.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a52e1d3-edcf-415d-a994-d69a9189a903/bin/uautomizer-IVEQpCNsaX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a52e1d3-edcf-415d-a994-d69a9189a903/bin/uautomizer-IVEQpCNsaX --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 a4208e364fc80ce33bd799516b7b127a7314c394860a88240a88c2fb8dc1fa8b --- Real Ultimate output --- This is Ultimate 0.2.1-dev-f8e1c90 [2021-11-09 08:32:44,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-09 08:32:44,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-09 08:32:44,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-09 08:32:44,492 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-09 08:32:44,494 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-09 08:32:44,496 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-09 08:32:44,498 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-09 08:32:44,500 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-09 08:32:44,501 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-09 08:32:44,503 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-09 08:32:44,504 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-09 08:32:44,505 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-09 08:32:44,506 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-09 08:32:44,508 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-09 08:32:44,510 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-09 08:32:44,511 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-09 08:32:44,512 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-09 08:32:44,514 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-09 08:32:44,516 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-09 08:32:44,518 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-09 08:32:44,520 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-09 08:32:44,521 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-09 08:32:44,522 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-09 08:32:44,526 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-09 08:32:44,527 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-09 08:32:44,527 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-09 08:32:44,528 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-09 08:32:44,529 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-09 08:32:44,530 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-09 08:32:44,530 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-09 08:32:44,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-09 08:32:44,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-09 08:32:44,533 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-09 08:32:44,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-09 08:32:44,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-09 08:32:44,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-09 08:32:44,536 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-09 08:32:44,537 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-09 08:32:44,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-09 08:32:44,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-09 08:32:44,540 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a52e1d3-edcf-415d-a994-d69a9189a903/bin/uautomizer-IVEQpCNsaX/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-09 08:32:44,565 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-09 08:32:44,566 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-09 08:32:44,566 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-09 08:32:44,567 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-09 08:32:44,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-09 08:32:44,568 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-09 08:32:44,568 INFO L138 SettingsManager]: * Use SBE=true [2021-11-09 08:32:44,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-09 08:32:44,568 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-09 08:32:44,569 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-09 08:32:44,569 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-09 08:32:44,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-09 08:32:44,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-09 08:32:44,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-09 08:32:44,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-09 08:32:44,570 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-09 08:32:44,570 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-09 08:32:44,570 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-09 08:32:44,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-09 08:32:44,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-09 08:32:44,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-09 08:32:44,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-09 08:32:44,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 08:32:44,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-09 08:32:44,571 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-09 08:32:44,571 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-09 08:32:44,571 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-09 08:32:44,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-09 08:32:44,572 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-09 08:32:44,572 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-09 08:32:44,572 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-09 08:32:44,573 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-09 08:32:44,573 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_7a52e1d3-edcf-415d-a994-d69a9189a903/bin/uautomizer-IVEQpCNsaX/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_7a52e1d3-edcf-415d-a994-d69a9189a903/bin/uautomizer-IVEQpCNsaX 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 -> a4208e364fc80ce33bd799516b7b127a7314c394860a88240a88c2fb8dc1fa8b [2021-11-09 08:32:44,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-09 08:32:44,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-09 08:32:44,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-09 08:32:44,865 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-09 08:32:44,866 INFO L275 PluginConnector]: CDTParser initialized [2021-11-09 08:32:44,867 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a52e1d3-edcf-415d-a994-d69a9189a903/bin/uautomizer-IVEQpCNsaX/../../sv-benchmarks/c/weaver/chl-exp-term-subst.wvr.c [2021-11-09 08:32:44,944 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a52e1d3-edcf-415d-a994-d69a9189a903/bin/uautomizer-IVEQpCNsaX/data/0c0342350/9fb37f2232c94200a49aad02969fb1da/FLAGf5e5c6d59 [2021-11-09 08:32:45,454 INFO L306 CDTParser]: Found 1 translation units. [2021-11-09 08:32:45,456 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a52e1d3-edcf-415d-a994-d69a9189a903/sv-benchmarks/c/weaver/chl-exp-term-subst.wvr.c [2021-11-09 08:32:45,471 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a52e1d3-edcf-415d-a994-d69a9189a903/bin/uautomizer-IVEQpCNsaX/data/0c0342350/9fb37f2232c94200a49aad02969fb1da/FLAGf5e5c6d59 [2021-11-09 08:32:45,783 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a52e1d3-edcf-415d-a994-d69a9189a903/bin/uautomizer-IVEQpCNsaX/data/0c0342350/9fb37f2232c94200a49aad02969fb1da [2021-11-09 08:32:45,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-09 08:32:45,791 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-09 08:32:45,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-09 08:32:45,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-09 08:32:45,806 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-09 08:32:45,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:32:45" (1/1) ... [2021-11-09 08:32:45,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72c7b6d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:32:45, skipping insertion in model container [2021-11-09 08:32:45,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:32:45" (1/1) ... [2021-11-09 08:32:45,817 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-09 08:32:45,837 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-09 08:32:46,068 WARN L228 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_7a52e1d3-edcf-415d-a994-d69a9189a903/sv-benchmarks/c/weaver/chl-exp-term-subst.wvr.c[3072,3085] [2021-11-09 08:32:46,077 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 08:32:46,086 INFO L203 MainTranslator]: Completed pre-run [2021-11-09 08:32:46,113 WARN L228 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_7a52e1d3-edcf-415d-a994-d69a9189a903/sv-benchmarks/c/weaver/chl-exp-term-subst.wvr.c[3072,3085] [2021-11-09 08:32:46,116 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 08:32:46,131 INFO L208 MainTranslator]: Completed translation [2021-11-09 08:32:46,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:32:46 WrapperNode [2021-11-09 08:32:46,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-09 08:32:46,135 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-09 08:32:46,135 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-09 08:32:46,135 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-09 08:32:46,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:32:46" (1/1) ... [2021-11-09 08:32:46,161 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:32:46" (1/1) ... [2021-11-09 08:32:46,194 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-09 08:32:46,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-09 08:32:46,195 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-09 08:32:46,195 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-09 08:32:46,204 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:32:46" (1/1) ... [2021-11-09 08:32:46,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:32:46" (1/1) ... [2021-11-09 08:32:46,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:32:46" (1/1) ... [2021-11-09 08:32:46,209 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:32:46" (1/1) ... [2021-11-09 08:32:46,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:32:46" (1/1) ... [2021-11-09 08:32:46,234 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:32:46" (1/1) ... [2021-11-09 08:32:46,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:32:46" (1/1) ... [2021-11-09 08:32:46,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-09 08:32:46,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-09 08:32:46,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-09 08:32:46,245 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-09 08:32:46,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:32:46" (1/1) ... [2021-11-09 08:32:46,259 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 08:32:46,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a52e1d3-edcf-415d-a994-d69a9189a903/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 08:32:46,284 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a52e1d3-edcf-415d-a994-d69a9189a903/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-09 08:32:46,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a52e1d3-edcf-415d-a994-d69a9189a903/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-09 08:32:46,332 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-11-09 08:32:46,332 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-11-09 08:32:46,333 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-11-09 08:32:46,333 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-11-09 08:32:46,333 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-11-09 08:32:46,333 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-11-09 08:32:46,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-09 08:32:46,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-09 08:32:46,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-09 08:32:46,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-09 08:32:46,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-09 08:32:46,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-09 08:32:46,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-09 08:32:46,336 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-09 08:32:46,878 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-09 08:32:46,883 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2021-11-09 08:32:46,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:32:46 BoogieIcfgContainer [2021-11-09 08:32:46,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-09 08:32:46,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-09 08:32:46,888 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-09 08:32:46,895 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-09 08:32:46,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:32:45" (1/3) ... [2021-11-09 08:32:46,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56444925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:32:46, skipping insertion in model container [2021-11-09 08:32:46,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:32:46" (2/3) ... [2021-11-09 08:32:46,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56444925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:32:46, skipping insertion in model container [2021-11-09 08:32:46,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:32:46" (3/3) ... [2021-11-09 08:32:46,898 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-exp-term-subst.wvr.c [2021-11-09 08:32:46,904 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-09 08:32:46,905 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-09 08:32:46,905 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-09 08:32:46,905 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-09 08:32:46,952 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,952 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,953 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,953 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,953 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,954 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,954 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,954 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,955 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,955 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,955 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,955 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,956 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,956 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,956 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,957 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,957 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,957 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,957 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,958 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,958 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,958 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,958 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,959 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,959 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,959 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,959 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,960 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,960 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,960 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,960 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,960 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,961 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,961 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,961 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,961 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,962 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,962 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,962 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,962 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,963 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,963 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,963 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,963 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,964 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,964 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,964 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,964 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,965 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,965 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,965 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,965 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,966 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,966 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,966 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,966 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,967 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,967 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,967 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,967 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,968 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,968 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,968 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,969 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,969 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,969 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,969 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,970 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,970 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,970 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,970 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,971 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,971 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,971 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,971 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,971 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,972 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,972 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,972 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,972 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,973 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,973 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,973 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,973 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,974 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,974 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,974 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,974 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,974 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,975 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,975 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,975 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,975 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,976 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,977 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,977 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,978 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,978 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,978 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,978 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,979 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,979 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,979 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,979 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,980 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,980 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,980 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,980 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,981 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,981 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,981 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,981 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,982 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,982 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,982 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,982 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,983 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,983 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,983 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,983 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,984 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,984 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,984 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,984 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,985 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,985 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,985 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,985 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,986 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,986 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,986 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,986 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,986 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,987 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,987 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,987 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,988 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,988 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,988 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,988 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,988 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,989 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,989 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,989 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,989 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,990 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,990 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,990 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,990 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,991 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,991 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,991 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,991 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,992 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,992 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,992 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,993 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,993 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,993 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,993 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,993 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,994 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,994 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,994 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,994 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,995 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,995 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,995 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,995 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,996 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,996 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,996 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,996 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,997 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,997 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,997 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,997 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,997 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,998 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,998 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,998 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,998 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,999 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,999 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,999 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:46,999 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,000 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,000 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,001 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,001 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,002 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,002 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,002 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,003 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,003 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,003 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,003 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,004 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,004 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,004 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,004 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,005 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,005 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,005 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,005 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,006 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,006 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,006 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,006 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,007 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,007 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,007 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,007 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,008 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,008 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,008 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,008 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,009 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,009 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,009 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,009 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,010 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,010 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,010 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,010 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,011 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,011 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,011 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,012 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,012 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,012 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,012 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,013 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,013 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,013 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,013 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,014 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,014 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,014 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,014 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,015 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,015 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,015 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,015 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,016 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,016 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,016 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,016 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,017 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,017 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,017 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,017 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,018 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,018 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,018 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,019 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,019 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,019 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,019 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,020 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,020 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,020 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,020 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,021 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,021 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,021 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,022 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,022 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,022 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,022 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,023 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,023 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,036 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,036 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,036 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,036 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,037 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,037 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,037 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,038 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,038 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,038 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,041 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,042 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,042 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,042 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,044 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,044 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,044 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,044 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,045 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,059 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,059 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,060 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,060 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,060 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,060 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,061 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,061 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,061 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,061 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,061 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,062 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,062 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,073 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,073 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,074 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,074 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,074 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,074 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,075 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,075 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,075 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,075 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,075 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,076 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,076 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:32:47,085 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-11-09 08:32:47,221 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-09 08:32:47,227 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-09 08:32:47,228 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-11-09 08:32:47,249 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 199 places, 206 transitions, 436 flow [2021-11-09 08:32:47,374 INFO L129 PetriNetUnfolder]: 17/203 cut-off events. [2021-11-09 08:32:47,374 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-11-09 08:32:47,390 INFO L84 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 17/203 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 446 event pairs, 0 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 136. Up to 2 conditions per place. [2021-11-09 08:32:47,390 INFO L82 GeneralOperation]: Start removeDead. Operand has 199 places, 206 transitions, 436 flow [2021-11-09 08:32:47,409 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 186 places, 193 transitions, 404 flow [2021-11-09 08:32:47,495 INFO L129 PetriNetUnfolder]: 17/192 cut-off events. [2021-11-09 08:32:47,496 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-11-09 08:32:47,496 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:32:47,497 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:32:47,498 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-09 08:32:47,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:32:47,504 INFO L85 PathProgramCache]: Analyzing trace with hash 248252607, now seen corresponding path program 1 times [2021-11-09 08:32:47,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:32:47,514 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796505025] [2021-11-09 08:32:47,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:32:47,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:32:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:32:48,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:32:48,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:32:48,201 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796505025] [2021-11-09 08:32:48,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796505025] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:32:48,202 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:32:48,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-09 08:32:48,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352687168] [2021-11-09 08:32:48,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-09 08:32:48,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:32:48,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-09 08:32:48,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-09 08:32:48,267 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 206 [2021-11-09 08:32:48,278 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 193 transitions, 404 flow. Second operand has 8 states, 8 states have (on average 177.25) internal successors, (1418), 8 states have internal predecessors, (1418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:32:48,279 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:32:48,279 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 206 [2021-11-09 08:32:48,280 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:32:48,656 INFO L129 PetriNetUnfolder]: 50/385 cut-off events. [2021-11-09 08:32:48,656 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-11-09 08:32:48,662 INFO L84 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 385 events. 50/385 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1780 event pairs, 8 based on Foata normal form. 104/458 useless extension candidates. Maximal degree in co-relation 400. Up to 32 conditions per place. [2021-11-09 08:32:48,668 INFO L132 encePairwiseOnDemand]: 185/206 looper letters, 37 selfloop transitions, 17 changer transitions 13/230 dead transitions. [2021-11-09 08:32:48,668 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 230 transitions, 618 flow [2021-11-09 08:32:48,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-09 08:32:48,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-11-09 08:32:48,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2375 transitions. [2021-11-09 08:32:48,704 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8868558625840179 [2021-11-09 08:32:48,705 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2375 transitions. [2021-11-09 08:32:48,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2375 transitions. [2021-11-09 08:32:48,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:32:48,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2375 transitions. [2021-11-09 08:32:48,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 182.69230769230768) internal successors, (2375), 13 states have internal predecessors, (2375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:32:48,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 206.0) internal successors, (2884), 14 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:32:48,756 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 206.0) internal successors, (2884), 14 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:32:48,758 INFO L186 Difference]: Start difference. First operand has 186 places, 193 transitions, 404 flow. Second operand 13 states and 2375 transitions. [2021-11-09 08:32:48,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 230 transitions, 618 flow [2021-11-09 08:32:48,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 230 transitions, 602 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-11-09 08:32:48,776 INFO L242 Difference]: Finished difference. Result has 199 places, 197 transitions, 485 flow [2021-11-09 08:32:48,779 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=485, PETRI_PLACES=199, PETRI_TRANSITIONS=197} [2021-11-09 08:32:48,780 INFO L334 CegarLoopForPetriNet]: 186 programPoint places, 13 predicate places. [2021-11-09 08:32:48,780 INFO L470 AbstractCegarLoop]: Abstraction has has 199 places, 197 transitions, 485 flow [2021-11-09 08:32:48,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 177.25) internal successors, (1418), 8 states have internal predecessors, (1418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:32:48,782 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:32:48,783 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:32:48,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-09 08:32:48,783 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-09 08:32:48,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:32:48,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1833090675, now seen corresponding path program 1 times [2021-11-09 08:32:48,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:32:48,785 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307163529] [2021-11-09 08:32:48,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:32:48,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:32:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:32:49,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:32:49,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:32:49,163 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307163529] [2021-11-09 08:32:49,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307163529] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:32:49,164 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:32:49,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:32:49,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974353568] [2021-11-09 08:32:49,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 08:32:49,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:32:49,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:32:49,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:32:49,175 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2021-11-09 08:32:49,177 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 197 transitions, 485 flow. Second operand has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:32:49,177 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:32:49,177 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2021-11-09 08:32:49,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:32:49,858 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([562] L56-15-->L56-16: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork1_#t~ite14_3|) InVars {thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} AuxVars[] AssignedVars[~result_8~0][149], [Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), 33#L50-16true, Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), Black: 226#(and (= ~result_8~0 0) (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~result_7~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 216#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 222#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 66#L56-16true, 38#L74-4true, 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 68#L44-2true, 202#true]) [2021-11-09 08:32:49,859 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2021-11-09 08:32:49,859 INFO L387 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2021-11-09 08:32:49,859 INFO L387 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2021-11-09 08:32:49,860 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-11-09 08:32:49,867 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([562] L56-15-->L56-16: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork1_#t~ite14_3|) InVars {thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} AuxVars[] AssignedVars[~result_8~0][149], [Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), 33#L50-16true, Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), Black: 226#(and (= ~result_8~0 0) (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~result_7~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 216#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 222#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 66#L56-16true, 38#L74-4true, 141#thread1ENTRYtrue, 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 202#true]) [2021-11-09 08:32:49,867 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is not cut-off event [2021-11-09 08:32:49,867 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is not cut-off event [2021-11-09 08:32:49,867 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is not cut-off event [2021-11-09 08:32:49,868 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2021-11-09 08:32:49,875 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([562] L56-15-->L56-16: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork1_#t~ite14_3|) InVars {thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} AuxVars[] AssignedVars[~result_8~0][149], [Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), 33#L50-16true, Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), 16#L44true, Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), Black: 226#(and (= ~result_8~0 0) (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~result_7~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 216#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 222#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 66#L56-16true, 38#L74-4true, 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 202#true]) [2021-11-09 08:32:49,875 INFO L384 tUnfolder$Statistics]: this new event has 63 ancestors and is not cut-off event [2021-11-09 08:32:49,875 INFO L387 tUnfolder$Statistics]: existing Event has 65 ancestors and is not cut-off event [2021-11-09 08:32:49,875 INFO L387 tUnfolder$Statistics]: existing Event has 65 ancestors and is not cut-off event [2021-11-09 08:32:49,876 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2021-11-09 08:32:49,955 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([562] L56-15-->L56-16: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork1_#t~ite14_3|) InVars {thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} AuxVars[] AssignedVars[~result_8~0][149], [Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), 33#L50-16true, Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), 122#L44-5true, Black: 226#(and (= ~result_8~0 0) (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~result_7~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 216#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 222#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 66#L56-16true, 38#L74-4true, 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 202#true]) [2021-11-09 08:32:49,955 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is not cut-off event [2021-11-09 08:32:49,956 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2021-11-09 08:32:49,960 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2021-11-09 08:32:49,960 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2021-11-09 08:32:49,991 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([562] L56-15-->L56-16: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork1_#t~ite14_3|) InVars {thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} AuxVars[] AssignedVars[~result_8~0][149], [Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), 33#L50-16true, Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), Black: 226#(and (= ~result_8~0 0) (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~result_7~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 216#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), 131#L44-6true, Black: 222#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 66#L56-16true, 38#L74-4true, 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 202#true]) [2021-11-09 08:32:49,991 INFO L384 tUnfolder$Statistics]: this new event has 65 ancestors and is not cut-off event [2021-11-09 08:32:49,991 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2021-11-09 08:32:49,991 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2021-11-09 08:32:49,992 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2021-11-09 08:32:50,001 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([562] L56-15-->L56-16: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork1_#t~ite14_3|) InVars {thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} AuxVars[] AssignedVars[~result_8~0][149], [Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), 33#L50-16true, Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), Black: 226#(and (= ~result_8~0 0) (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~result_7~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 216#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 222#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 66#L56-16true, 38#L74-4true, 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 19#L44-8true, 202#true]) [2021-11-09 08:32:50,001 INFO L384 tUnfolder$Statistics]: this new event has 65 ancestors and is not cut-off event [2021-11-09 08:32:50,001 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2021-11-09 08:32:50,002 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2021-11-09 08:32:50,002 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2021-11-09 08:32:50,377 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([603] thread2EXIT-->L76-2: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= 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~mem28=|v_ULTIMATE.start_main_#t~mem28_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28=|v_ULTIMATE.start_main_#t~mem28_5|} AuxVars[] AssignedVars[][210], [Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), 179#L76-2true, Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), Black: 226#(and (= ~result_8~0 0) (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~result_7~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 216#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), 123#L56true, Black: 222#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 202#true]) [2021-11-09 08:32:50,377 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is not cut-off event [2021-11-09 08:32:50,378 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is not cut-off event [2021-11-09 08:32:50,378 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is not cut-off event [2021-11-09 08:32:50,378 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is not cut-off event [2021-11-09 08:32:50,381 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([603] thread2EXIT-->L76-2: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= 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~mem28=|v_ULTIMATE.start_main_#t~mem28_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28=|v_ULTIMATE.start_main_#t~mem28_5|} AuxVars[] AssignedVars[][210], [Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), 179#L76-2true, Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), Black: 226#(and (= ~result_8~0 0) (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~result_7~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 216#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 222#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 91#L56-5true, 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 202#true]) [2021-11-09 08:32:50,381 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is not cut-off event [2021-11-09 08:32:50,382 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is not cut-off event [2021-11-09 08:32:50,382 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is not cut-off event [2021-11-09 08:32:50,383 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is not cut-off event [2021-11-09 08:32:50,386 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([603] thread2EXIT-->L76-2: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= 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~mem28=|v_ULTIMATE.start_main_#t~mem28_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28=|v_ULTIMATE.start_main_#t~mem28_5|} AuxVars[] AssignedVars[][210], [Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), 179#L76-2true, Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), Black: 226#(and (= ~result_8~0 0) (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~result_7~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 138#L56-8true, Black: 216#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 222#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 202#true]) [2021-11-09 08:32:50,386 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is not cut-off event [2021-11-09 08:32:50,386 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is not cut-off event [2021-11-09 08:32:50,387 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is not cut-off event [2021-11-09 08:32:50,387 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is not cut-off event [2021-11-09 08:32:50,387 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([603] thread2EXIT-->L76-2: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= 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~mem28=|v_ULTIMATE.start_main_#t~mem28_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28=|v_ULTIMATE.start_main_#t~mem28_5|} AuxVars[] AssignedVars[][210], [24#L56-6true, Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), 179#L76-2true, Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), Black: 226#(and (= ~result_8~0 0) (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~result_7~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 216#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 222#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 202#true]) [2021-11-09 08:32:50,388 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is not cut-off event [2021-11-09 08:32:50,388 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is not cut-off event [2021-11-09 08:32:50,388 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is not cut-off event [2021-11-09 08:32:50,388 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is not cut-off event [2021-11-09 08:32:50,418 INFO L129 PetriNetUnfolder]: 848/5404 cut-off events. [2021-11-09 08:32:50,418 INFO L130 PetriNetUnfolder]: For 376/490 co-relation queries the response was YES. [2021-11-09 08:32:50,459 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7648 conditions, 5404 events. 848/5404 cut-off events. For 376/490 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 66532 event pairs, 250 based on Foata normal form. 30/4712 useless extension candidates. Maximal degree in co-relation 7617. Up to 670 conditions per place. [2021-11-09 08:32:50,496 INFO L132 encePairwiseOnDemand]: 191/206 looper letters, 43 selfloop transitions, 14 changer transitions 0/230 dead transitions. [2021-11-09 08:32:50,496 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 230 transitions, 665 flow [2021-11-09 08:32:50,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 08:32:50,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-11-09 08:32:50,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 927 transitions. [2021-11-09 08:32:50,501 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9 [2021-11-09 08:32:50,501 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 927 transitions. [2021-11-09 08:32:50,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 927 transitions. [2021-11-09 08:32:50,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:32:50,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 927 transitions. [2021-11-09 08:32:50,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 185.4) internal successors, (927), 5 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:32:50,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:32:50,518 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:32:50,519 INFO L186 Difference]: Start difference. First operand has 199 places, 197 transitions, 485 flow. Second operand 5 states and 927 transitions. [2021-11-09 08:32:50,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 230 transitions, 665 flow [2021-11-09 08:32:50,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 230 transitions, 661 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-11-09 08:32:50,553 INFO L242 Difference]: Finished difference. Result has 198 places, 209 transitions, 591 flow [2021-11-09 08:32:50,555 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=591, PETRI_PLACES=198, PETRI_TRANSITIONS=209} [2021-11-09 08:32:50,556 INFO L334 CegarLoopForPetriNet]: 186 programPoint places, 12 predicate places. [2021-11-09 08:32:50,556 INFO L470 AbstractCegarLoop]: Abstraction has has 198 places, 209 transitions, 591 flow [2021-11-09 08:32:50,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:32:50,557 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:32:50,558 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:32:50,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-09 08:32:50,558 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-09 08:32:50,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:32:50,563 INFO L85 PathProgramCache]: Analyzing trace with hash 6847361, now seen corresponding path program 2 times [2021-11-09 08:32:50,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:32:50,564 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66264501] [2021-11-09 08:32:50,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:32:50,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:32:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:32:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:32:50,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:32:50,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66264501] [2021-11-09 08:32:50,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66264501] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:32:50,793 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:32:50,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:32:50,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764518753] [2021-11-09 08:32:50,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 08:32:50,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:32:50,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:32:50,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:32:50,798 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2021-11-09 08:32:50,799 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 209 transitions, 591 flow. Second operand has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:32:50,800 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:32:50,800 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2021-11-09 08:32:50,800 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:32:52,028 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([562] L56-15-->L56-16: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork1_#t~ite14_3|) InVars {thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} AuxVars[] AssignedVars[~result_8~0][158], [247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), 33#L50-16true, Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), Black: 216#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), 66#L56-16true, 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 38#L74-4true, Black: 235#true, Black: 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 126#L44-3true, 202#true]) [2021-11-09 08:32:52,028 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2021-11-09 08:32:52,028 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-11-09 08:32:52,029 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-11-09 08:32:52,029 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-11-09 08:32:52,067 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([603] thread2EXIT-->L76-2: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= 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~mem28=|v_ULTIMATE.start_main_#t~mem28_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28=|v_ULTIMATE.start_main_#t~mem28_5|} AuxVars[] AssignedVars[][238], [24#L56-6true, Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), Black: 216#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 235#true, Black: 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 179#L76-2true, Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 202#true]) [2021-11-09 08:32:52,067 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is not cut-off event [2021-11-09 08:32:52,067 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is not cut-off event [2021-11-09 08:32:52,067 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is not cut-off event [2021-11-09 08:32:52,068 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is not cut-off event [2021-11-09 08:32:52,127 INFO L129 PetriNetUnfolder]: 907/6159 cut-off events. [2021-11-09 08:32:52,127 INFO L130 PetriNetUnfolder]: For 1542/2772 co-relation queries the response was YES. [2021-11-09 08:32:52,176 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9896 conditions, 6159 events. 907/6159 cut-off events. For 1542/2772 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 75924 event pairs, 323 based on Foata normal form. 58/5773 useless extension candidates. Maximal degree in co-relation 9231. Up to 618 conditions per place. [2021-11-09 08:32:52,219 INFO L132 encePairwiseOnDemand]: 189/206 looper letters, 66 selfloop transitions, 19 changer transitions 0/258 dead transitions. [2021-11-09 08:32:52,220 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 258 transitions, 983 flow [2021-11-09 08:32:52,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 08:32:52,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-11-09 08:32:52,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 930 transitions. [2021-11-09 08:32:52,224 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9029126213592233 [2021-11-09 08:32:52,224 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 930 transitions. [2021-11-09 08:32:52,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 930 transitions. [2021-11-09 08:32:52,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:32:52,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 930 transitions. [2021-11-09 08:32:52,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 186.0) internal successors, (930), 5 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:32:52,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:32:52,235 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:32:52,235 INFO L186 Difference]: Start difference. First operand has 198 places, 209 transitions, 591 flow. Second operand 5 states and 930 transitions. [2021-11-09 08:32:52,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 258 transitions, 983 flow [2021-11-09 08:32:52,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 258 transitions, 983 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-11-09 08:32:52,279 INFO L242 Difference]: Finished difference. Result has 206 places, 224 transitions, 775 flow [2021-11-09 08:32:52,280 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=775, PETRI_PLACES=206, PETRI_TRANSITIONS=224} [2021-11-09 08:32:52,280 INFO L334 CegarLoopForPetriNet]: 186 programPoint places, 20 predicate places. [2021-11-09 08:32:52,281 INFO L470 AbstractCegarLoop]: Abstraction has has 206 places, 224 transitions, 775 flow [2021-11-09 08:32:52,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:32:52,281 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:32:52,282 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:32:52,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-09 08:32:52,282 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-09 08:32:52,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:32:52,284 INFO L85 PathProgramCache]: Analyzing trace with hash 725235927, now seen corresponding path program 3 times [2021-11-09 08:32:52,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:32:52,284 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648449784] [2021-11-09 08:32:52,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:32:52,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:32:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:32:52,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:32:52,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:32:52,592 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648449784] [2021-11-09 08:32:52,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648449784] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:32:52,593 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:32:52,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:32:52,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990353506] [2021-11-09 08:32:52,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 08:32:52,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:32:52,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:32:52,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:32:52,597 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2021-11-09 08:32:52,598 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 224 transitions, 775 flow. Second operand has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:32:52,598 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:32:52,599 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2021-11-09 08:32:52,599 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:32:53,271 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([562] L56-15-->L56-16: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork1_#t~ite14_3|) InVars {thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} AuxVars[] AssignedVars[~result_8~0][165], [248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), 33#L50-16true, Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), 16#L44true, Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), Black: 216#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), 66#L56-16true, 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), 38#L74-4true, Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 202#true, Black: 245#true]) [2021-11-09 08:32:53,272 INFO L384 tUnfolder$Statistics]: this new event has 63 ancestors and is not cut-off event [2021-11-09 08:32:53,272 INFO L387 tUnfolder$Statistics]: existing Event has 65 ancestors and is not cut-off event [2021-11-09 08:32:53,272 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2021-11-09 08:32:53,272 INFO L387 tUnfolder$Statistics]: existing Event has 65 ancestors and is not cut-off event [2021-11-09 08:32:53,896 INFO L129 PetriNetUnfolder]: 854/6217 cut-off events. [2021-11-09 08:32:53,897 INFO L130 PetriNetUnfolder]: For 3000/5130 co-relation queries the response was YES. [2021-11-09 08:32:53,949 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10760 conditions, 6217 events. 854/6217 cut-off events. For 3000/5130 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 76757 event pairs, 234 based on Foata normal form. 99/5966 useless extension candidates. Maximal degree in co-relation 9988. Up to 587 conditions per place. [2021-11-09 08:32:53,985 INFO L132 encePairwiseOnDemand]: 191/206 looper letters, 74 selfloop transitions, 37 changer transitions 0/284 dead transitions. [2021-11-09 08:32:53,986 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 284 transitions, 1403 flow [2021-11-09 08:32:53,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 08:32:53,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-11-09 08:32:53,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 931 transitions. [2021-11-09 08:32:53,990 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.903883495145631 [2021-11-09 08:32:53,990 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 931 transitions. [2021-11-09 08:32:53,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 931 transitions. [2021-11-09 08:32:53,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:32:53,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 931 transitions. [2021-11-09 08:32:53,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 186.2) internal successors, (931), 5 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:32:53,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:32:53,999 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:32:54,000 INFO L186 Difference]: Start difference. First operand has 206 places, 224 transitions, 775 flow. Second operand 5 states and 931 transitions. [2021-11-09 08:32:54,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 284 transitions, 1403 flow [2021-11-09 08:32:54,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 284 transitions, 1403 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-11-09 08:32:54,040 INFO L242 Difference]: Finished difference. Result has 214 places, 254 transitions, 1195 flow [2021-11-09 08:32:54,041 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1195, PETRI_PLACES=214, PETRI_TRANSITIONS=254} [2021-11-09 08:32:54,041 INFO L334 CegarLoopForPetriNet]: 186 programPoint places, 28 predicate places. [2021-11-09 08:32:54,042 INFO L470 AbstractCegarLoop]: Abstraction has has 214 places, 254 transitions, 1195 flow [2021-11-09 08:32:54,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:32:54,043 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:32:54,043 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:32:54,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-09 08:32:54,043 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-09 08:32:54,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:32:54,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1570650603, now seen corresponding path program 4 times [2021-11-09 08:32:54,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:32:54,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624043567] [2021-11-09 08:32:54,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:32:54,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:32:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:32:54,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:32:54,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:32:54,281 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624043567] [2021-11-09 08:32:54,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624043567] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:32:54,282 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:32:54,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:32:54,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565131433] [2021-11-09 08:32:54,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 08:32:54,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:32:54,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:32:54,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:32:54,287 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2021-11-09 08:32:54,288 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 254 transitions, 1195 flow. Second operand has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:32:54,289 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:32:54,289 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2021-11-09 08:32:54,289 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:32:55,540 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([562] L56-15-->L56-16: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork1_#t~ite14_3|) InVars {thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} AuxVars[] AssignedVars[~result_8~0][163], [248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), 33#L50-16true, Black: 255#true, Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 216#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), 66#L56-16true, 38#L74-4true, Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 68#L44-2true, Black: 245#true, 202#true]) [2021-11-09 08:32:55,540 INFO L384 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2021-11-09 08:32:55,541 INFO L387 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2021-11-09 08:32:55,541 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-11-09 08:32:55,541 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-11-09 08:32:55,822 INFO L129 PetriNetUnfolder]: 882/6827 cut-off events. [2021-11-09 08:32:55,822 INFO L130 PetriNetUnfolder]: For 4938/7375 co-relation queries the response was YES. [2021-11-09 08:32:55,882 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12526 conditions, 6827 events. 882/6827 cut-off events. For 4938/7375 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 86847 event pairs, 249 based on Foata normal form. 71/6539 useless extension candidates. Maximal degree in co-relation 11544. Up to 649 conditions per place. [2021-11-09 08:32:55,922 INFO L132 encePairwiseOnDemand]: 190/206 looper letters, 104 selfloop transitions, 46 changer transitions 1/324 dead transitions. [2021-11-09 08:32:55,922 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 324 transitions, 2117 flow [2021-11-09 08:32:55,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 08:32:55,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-11-09 08:32:55,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 932 transitions. [2021-11-09 08:32:55,927 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9048543689320389 [2021-11-09 08:32:55,927 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 932 transitions. [2021-11-09 08:32:55,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 932 transitions. [2021-11-09 08:32:55,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:32:55,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 932 transitions. [2021-11-09 08:32:55,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 186.4) internal successors, (932), 5 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:32:55,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:32:55,935 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:32:55,936 INFO L186 Difference]: Start difference. First operand has 214 places, 254 transitions, 1195 flow. Second operand 5 states and 932 transitions. [2021-11-09 08:32:55,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 324 transitions, 2117 flow [2021-11-09 08:32:55,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 324 transitions, 2117 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-11-09 08:32:55,986 INFO L242 Difference]: Finished difference. Result has 222 places, 286 transitions, 1751 flow [2021-11-09 08:32:55,987 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=1195, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1751, PETRI_PLACES=222, PETRI_TRANSITIONS=286} [2021-11-09 08:32:55,987 INFO L334 CegarLoopForPetriNet]: 186 programPoint places, 36 predicate places. [2021-11-09 08:32:55,987 INFO L470 AbstractCegarLoop]: Abstraction has has 222 places, 286 transitions, 1751 flow [2021-11-09 08:32:55,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:32:55,988 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:32:55,988 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:32:55,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-09 08:32:55,989 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-09 08:32:55,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:32:55,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2107441599, now seen corresponding path program 1 times [2021-11-09 08:32:55,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:32:55,991 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354957707] [2021-11-09 08:32:55,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:32:55,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:32:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:32:56,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:32:56,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:32:56,220 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354957707] [2021-11-09 08:32:56,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354957707] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:32:56,220 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:32:56,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:32:56,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771898487] [2021-11-09 08:32:56,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 08:32:56,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:32:56,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:32:56,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:32:56,225 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2021-11-09 08:32:56,226 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 286 transitions, 1751 flow. Second operand has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:32:56,227 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:32:56,227 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2021-11-09 08:32:56,227 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:32:57,233 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([562] L56-15-->L56-16: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork1_#t~ite14_3|) InVars {thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} AuxVars[] AssignedVars[~result_8~0][194], [33#L50-16true, Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 66#L56-16true, 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 19#L44-8true, 202#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), Black: 216#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), 38#L74-4true, Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 245#true]) [2021-11-09 08:32:57,234 INFO L384 tUnfolder$Statistics]: this new event has 65 ancestors and is not cut-off event [2021-11-09 08:32:57,234 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2021-11-09 08:32:57,234 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2021-11-09 08:32:57,234 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2021-11-09 08:32:57,667 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([523] L50-15-->L50-16: Formula: (= v_~result_7~0_1 |v_thread2Thread1of1ForFork0_#t~ite10_3|) InVars {thread2Thread1of1ForFork0_#t~ite10=|v_thread2Thread1of1ForFork0_#t~ite10_3|} OutVars{~result_7~0=v_~result_7~0_1, thread2Thread1of1ForFork0_#t~ite10=|v_thread2Thread1of1ForFork0_#t~ite10_3|} AuxVars[] AssignedVars[~result_7~0][343], [33#L50-16true, Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 66#L56-16true, 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 19#L44-8true, 202#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), Black: 216#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), 38#L74-4true, Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 245#true]) [2021-11-09 08:32:57,668 INFO L384 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2021-11-09 08:32:57,668 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-11-09 08:32:57,668 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-11-09 08:32:57,669 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-11-09 08:32:57,685 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([562] L56-15-->L56-16: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork1_#t~ite14_3|) InVars {thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} AuxVars[] AssignedVars[~result_8~0][194], [33#L50-16true, Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), 66#L56-16true, Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 19#L44-8true, 202#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), Black: 216#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), 38#L74-4true, Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 245#true]) [2021-11-09 08:32:57,686 INFO L384 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2021-11-09 08:32:57,686 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-11-09 08:32:57,686 INFO L387 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2021-11-09 08:32:57,686 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-11-09 08:32:57,687 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-11-09 08:32:57,694 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([562] L56-15-->L56-16: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork1_#t~ite14_3|) InVars {thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} AuxVars[] AssignedVars[~result_8~0][194], [33#L50-16true, Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), 66#L56-16true, Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 202#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), 16#L44true, Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), Black: 216#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), 38#L74-4true, Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 245#true]) [2021-11-09 08:32:57,694 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2021-11-09 08:32:57,694 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-11-09 08:32:57,695 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2021-11-09 08:32:57,695 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-11-09 08:32:57,706 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([562] L56-15-->L56-16: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork1_#t~ite14_3|) InVars {thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} AuxVars[] AssignedVars[~result_8~0][194], [33#L50-16true, Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 66#L56-16true, 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 202#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), 122#L44-5true, Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), Black: 216#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), 38#L74-4true, Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 245#true]) [2021-11-09 08:32:57,707 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2021-11-09 08:32:57,707 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-11-09 08:32:57,707 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2021-11-09 08:32:57,707 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2021-11-09 08:32:57,877 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([562] L56-15-->L56-16: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork1_#t~ite14_3|) InVars {thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} AuxVars[] AssignedVars[~result_8~0][194], [33#L50-16true, Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 131#L44-6true, 66#L56-16true, 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 202#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), Black: 216#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), 38#L74-4true, Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 245#true]) [2021-11-09 08:32:57,877 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2021-11-09 08:32:57,877 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2021-11-09 08:32:57,877 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-11-09 08:32:57,877 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-11-09 08:32:58,044 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([603] thread2EXIT-->L76-2: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= 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~mem28=|v_ULTIMATE.start_main_#t~mem28_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28=|v_ULTIMATE.start_main_#t~mem28_5|} AuxVars[] AssignedVars[][371], [Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 124#thread3ENTRYtrue, 202#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), Black: 216#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 179#L76-2true, 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 245#true]) [2021-11-09 08:32:58,045 INFO L384 tUnfolder$Statistics]: this new event has 97 ancestors and is not cut-off event [2021-11-09 08:32:58,045 INFO L387 tUnfolder$Statistics]: existing Event has 117 ancestors and is not cut-off event [2021-11-09 08:32:58,045 INFO L387 tUnfolder$Statistics]: existing Event has 101 ancestors and is not cut-off event [2021-11-09 08:32:58,045 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is not cut-off event [2021-11-09 08:32:58,053 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([603] thread2EXIT-->L76-2: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= 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~mem28=|v_ULTIMATE.start_main_#t~mem28_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28=|v_ULTIMATE.start_main_#t~mem28_5|} AuxVars[] AssignedVars[][371], [Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 202#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), Black: 216#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 179#L76-2true, 123#L56true, 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 245#true]) [2021-11-09 08:32:58,054 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is not cut-off event [2021-11-09 08:32:58,054 INFO L387 tUnfolder$Statistics]: existing Event has 102 ancestors and is not cut-off event [2021-11-09 08:32:58,054 INFO L387 tUnfolder$Statistics]: existing Event has 100 ancestors and is not cut-off event [2021-11-09 08:32:58,054 INFO L387 tUnfolder$Statistics]: existing Event has 102 ancestors and is not cut-off event [2021-11-09 08:32:58,055 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([603] thread2EXIT-->L76-2: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= 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~mem28=|v_ULTIMATE.start_main_#t~mem28_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28=|v_ULTIMATE.start_main_#t~mem28_5|} AuxVars[] AssignedVars[][371], [Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 202#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), 14#L56-2true, Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), Black: 216#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 179#L76-2true, 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 245#true]) [2021-11-09 08:32:58,055 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is not cut-off event [2021-11-09 08:32:58,056 INFO L387 tUnfolder$Statistics]: existing Event has 102 ancestors and is not cut-off event [2021-11-09 08:32:58,056 INFO L387 tUnfolder$Statistics]: existing Event has 100 ancestors and is not cut-off event [2021-11-09 08:32:58,056 INFO L387 tUnfolder$Statistics]: existing Event has 118 ancestors and is not cut-off event [2021-11-09 08:32:58,064 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([603] thread2EXIT-->L76-2: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= 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~mem28=|v_ULTIMATE.start_main_#t~mem28_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28=|v_ULTIMATE.start_main_#t~mem28_5|} AuxVars[] AssignedVars[][371], [Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 202#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), Black: 216#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), 146#L56-3true, Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 179#L76-2true, 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 245#true]) [2021-11-09 08:32:58,064 INFO L384 tUnfolder$Statistics]: this new event has 99 ancestors and is not cut-off event [2021-11-09 08:32:58,064 INFO L387 tUnfolder$Statistics]: existing Event has 101 ancestors and is not cut-off event [2021-11-09 08:32:58,065 INFO L387 tUnfolder$Statistics]: existing Event has 119 ancestors and is not cut-off event [2021-11-09 08:32:58,065 INFO L387 tUnfolder$Statistics]: existing Event has 103 ancestors and is not cut-off event [2021-11-09 08:32:58,078 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([604] thread3EXIT-->L77-2: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem29=|v_ULTIMATE.start_main_#t~mem29_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem29=|v_ULTIMATE.start_main_#t~mem29_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][380], [248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 205#(= ~result_7~0 0), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), Black: 255#true, Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 216#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), 117#L77-2true, Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 235#true, Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 245#true]) [2021-11-09 08:32:58,078 INFO L384 tUnfolder$Statistics]: this new event has 111 ancestors and is cut-off event [2021-11-09 08:32:58,079 INFO L387 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2021-11-09 08:32:58,079 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2021-11-09 08:32:58,079 INFO L387 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2021-11-09 08:32:58,129 INFO L129 PetriNetUnfolder]: 922/8177 cut-off events. [2021-11-09 08:32:58,130 INFO L130 PetriNetUnfolder]: For 7518/11298 co-relation queries the response was YES. [2021-11-09 08:32:58,210 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15330 conditions, 8177 events. 922/8177 cut-off events. For 7518/11298 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 107811 event pairs, 125 based on Foata normal form. 130/7884 useless extension candidates. Maximal degree in co-relation 14036. Up to 630 conditions per place. [2021-11-09 08:32:58,261 INFO L132 encePairwiseOnDemand]: 190/206 looper letters, 162 selfloop transitions, 52 changer transitions 8/391 dead transitions. [2021-11-09 08:32:58,261 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 391 transitions, 3341 flow [2021-11-09 08:32:58,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 08:32:58,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-11-09 08:32:58,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 934 transitions. [2021-11-09 08:32:58,266 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9067961165048544 [2021-11-09 08:32:58,267 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 934 transitions. [2021-11-09 08:32:58,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 934 transitions. [2021-11-09 08:32:58,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:32:58,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 934 transitions. [2021-11-09 08:32:58,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 186.8) internal successors, (934), 5 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:32:58,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:32:58,279 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:32:58,279 INFO L186 Difference]: Start difference. First operand has 222 places, 286 transitions, 1751 flow. Second operand 5 states and 934 transitions. [2021-11-09 08:32:58,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 391 transitions, 3341 flow [2021-11-09 08:32:58,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 391 transitions, 3341 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-11-09 08:32:58,366 INFO L242 Difference]: Finished difference. Result has 230 places, 322 transitions, 2423 flow [2021-11-09 08:32:58,367 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=1751, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2423, PETRI_PLACES=230, PETRI_TRANSITIONS=322} [2021-11-09 08:32:58,367 INFO L334 CegarLoopForPetriNet]: 186 programPoint places, 44 predicate places. [2021-11-09 08:32:58,367 INFO L470 AbstractCegarLoop]: Abstraction has has 230 places, 322 transitions, 2423 flow [2021-11-09 08:32:58,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:32:58,368 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:32:58,369 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:32:58,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-09 08:32:58,369 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-09 08:32:58,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:32:58,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1742886631, now seen corresponding path program 2 times [2021-11-09 08:32:58,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:32:58,371 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647862477] [2021-11-09 08:32:58,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:32:58,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:32:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:32:58,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:32:58,572 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:32:58,573 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647862477] [2021-11-09 08:32:58,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647862477] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:32:58,573 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:32:58,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:32:58,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826258422] [2021-11-09 08:32:58,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 08:32:58,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:32:58,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:32:58,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:32:58,582 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2021-11-09 08:32:58,584 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 322 transitions, 2423 flow. Second operand has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:32:58,584 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:32:58,584 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2021-11-09 08:32:58,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:32:59,592 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([562] L56-15-->L56-16: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork1_#t~ite14_3|) InVars {thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} AuxVars[] AssignedVars[~result_8~0][193], [33#L50-16true, 288#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 66#L56-16true, 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 278#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 277#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 275#true, 19#L44-8true, 202#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), Black: 216#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), 38#L74-4true, Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 245#true]) [2021-11-09 08:32:59,592 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2021-11-09 08:32:59,593 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-11-09 08:32:59,593 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-11-09 08:32:59,593 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-11-09 08:33:00,188 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([562] L56-15-->L56-16: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork1_#t~ite14_3|) InVars {thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} AuxVars[] AssignedVars[~result_8~0][193], [33#L50-16true, 288#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), 66#L56-16true, Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 278#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 277#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 275#true, 202#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), 16#L44true, Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), Black: 216#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), 38#L74-4true, Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 245#true]) [2021-11-09 08:33:00,189 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2021-11-09 08:33:00,189 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2021-11-09 08:33:00,189 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2021-11-09 08:33:00,190 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-11-09 08:33:00,442 INFO L129 PetriNetUnfolder]: 906/8499 cut-off events. [2021-11-09 08:33:00,443 INFO L130 PetriNetUnfolder]: For 11557/21337 co-relation queries the response was YES. [2021-11-09 08:33:00,526 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16898 conditions, 8499 events. 906/8499 cut-off events. For 11557/21337 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 113860 event pairs, 158 based on Foata normal form. 112/8212 useless extension candidates. Maximal degree in co-relation 15422. Up to 650 conditions per place. [2021-11-09 08:33:00,567 INFO L132 encePairwiseOnDemand]: 189/206 looper letters, 194 selfloop transitions, 45 changer transitions 4/412 dead transitions. [2021-11-09 08:33:00,567 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 412 transitions, 4013 flow [2021-11-09 08:33:00,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 08:33:00,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-11-09 08:33:00,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 937 transitions. [2021-11-09 08:33:00,571 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9097087378640777 [2021-11-09 08:33:00,572 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 937 transitions. [2021-11-09 08:33:00,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 937 transitions. [2021-11-09 08:33:00,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:33:00,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 937 transitions. [2021-11-09 08:33:00,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 187.4) internal successors, (937), 5 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:00,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:00,580 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:00,580 INFO L186 Difference]: Start difference. First operand has 230 places, 322 transitions, 2423 flow. Second operand 5 states and 937 transitions. [2021-11-09 08:33:00,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 412 transitions, 4013 flow [2021-11-09 08:33:00,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 412 transitions, 3997 flow, removed 8 selfloop flow, removed 1 redundant places. [2021-11-09 08:33:00,774 INFO L242 Difference]: Finished difference. Result has 235 places, 335 transitions, 2760 flow [2021-11-09 08:33:00,775 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=2407, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2760, PETRI_PLACES=235, PETRI_TRANSITIONS=335} [2021-11-09 08:33:00,775 INFO L334 CegarLoopForPetriNet]: 186 programPoint places, 49 predicate places. [2021-11-09 08:33:00,776 INFO L470 AbstractCegarLoop]: Abstraction has has 235 places, 335 transitions, 2760 flow [2021-11-09 08:33:00,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:00,776 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:33:00,777 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:33:00,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-09 08:33:00,777 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-09 08:33:00,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:33:00,778 INFO L85 PathProgramCache]: Analyzing trace with hash -2137991299, now seen corresponding path program 3 times [2021-11-09 08:33:00,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:33:00,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374106004] [2021-11-09 08:33:00,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:33:00,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:33:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:33:00,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:33:00,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:33:00,933 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374106004] [2021-11-09 08:33:00,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374106004] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:33:00,934 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:33:00,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:33:00,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847066209] [2021-11-09 08:33:00,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 08:33:00,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:33:00,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:33:00,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:33:00,937 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2021-11-09 08:33:00,938 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 335 transitions, 2760 flow. Second operand has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:00,938 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:33:00,938 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2021-11-09 08:33:00,939 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:33:01,842 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([562] L56-15-->L56-16: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork1_#t~ite14_3|) InVars {thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} AuxVars[] AssignedVars[~result_8~0][200], [33#L50-16true, 288#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 66#L56-16true, 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 278#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 277#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 19#L44-8true, Black: 275#true, 202#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 289#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), 298#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 287#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), 38#L74-4true, Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 245#true]) [2021-11-09 08:33:01,842 INFO L384 tUnfolder$Statistics]: this new event has 65 ancestors and is not cut-off event [2021-11-09 08:33:01,843 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2021-11-09 08:33:01,843 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2021-11-09 08:33:01,843 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2021-11-09 08:33:02,098 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([562] L56-15-->L56-16: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork1_#t~ite14_3|) InVars {thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} AuxVars[] AssignedVars[~result_8~0][200], [33#L50-16true, 288#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 66#L56-16true, 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 278#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 277#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 275#true, 202#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 289#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), 298#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 287#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), 16#L44true, Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), 38#L74-4true, Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 245#true]) [2021-11-09 08:33:02,098 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2021-11-09 08:33:02,098 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-11-09 08:33:02,098 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2021-11-09 08:33:02,099 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-11-09 08:33:02,343 INFO L129 PetriNetUnfolder]: 869/8435 cut-off events. [2021-11-09 08:33:02,343 INFO L130 PetriNetUnfolder]: For 13479/25711 co-relation queries the response was YES. [2021-11-09 08:33:02,427 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16816 conditions, 8435 events. 869/8435 cut-off events. For 13479/25711 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 112904 event pairs, 133 based on Foata normal form. 120/8164 useless extension candidates. Maximal degree in co-relation 15239. Up to 625 conditions per place. [2021-11-09 08:33:02,477 INFO L132 encePairwiseOnDemand]: 190/206 looper letters, 200 selfloop transitions, 78 changer transitions 1/448 dead transitions. [2021-11-09 08:33:02,478 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 448 transitions, 4808 flow [2021-11-09 08:33:02,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 08:33:02,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-11-09 08:33:02,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 932 transitions. [2021-11-09 08:33:02,482 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9048543689320389 [2021-11-09 08:33:02,483 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 932 transitions. [2021-11-09 08:33:02,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 932 transitions. [2021-11-09 08:33:02,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:33:02,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 932 transitions. [2021-11-09 08:33:02,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 186.4) internal successors, (932), 5 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:02,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:02,493 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:02,494 INFO L186 Difference]: Start difference. First operand has 235 places, 335 transitions, 2760 flow. Second operand 5 states and 932 transitions. [2021-11-09 08:33:02,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 448 transitions, 4808 flow [2021-11-09 08:33:02,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 448 transitions, 4773 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-11-09 08:33:02,580 INFO L242 Difference]: Finished difference. Result has 242 places, 378 transitions, 3705 flow [2021-11-09 08:33:02,581 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=2735, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3705, PETRI_PLACES=242, PETRI_TRANSITIONS=378} [2021-11-09 08:33:02,582 INFO L334 CegarLoopForPetriNet]: 186 programPoint places, 56 predicate places. [2021-11-09 08:33:02,582 INFO L470 AbstractCegarLoop]: Abstraction has has 242 places, 378 transitions, 3705 flow [2021-11-09 08:33:02,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:02,583 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:33:02,583 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:33:02,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-09 08:33:02,583 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-09 08:33:02,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:33:02,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1482723397, now seen corresponding path program 4 times [2021-11-09 08:33:02,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:33:02,584 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090622210] [2021-11-09 08:33:02,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:33:02,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:33:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:33:02,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:33:02,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:33:02,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090622210] [2021-11-09 08:33:02,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090622210] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:33:02,759 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:33:02,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:33:02,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077492266] [2021-11-09 08:33:02,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 08:33:02,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:33:02,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:33:02,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:33:02,763 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2021-11-09 08:33:02,764 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 378 transitions, 3705 flow. Second operand has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:02,765 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:33:02,765 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2021-11-09 08:33:02,765 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:33:03,627 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([562] L56-15-->L56-16: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork1_#t~ite14_3|) InVars {thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} AuxVars[] AssignedVars[~result_8~0][219], [308#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), 288#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 33#L50-16true, Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), 66#L56-16true, Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 278#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 277#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 275#true, 19#L44-8true, 202#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 289#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), 298#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 287#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), Black: 297#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 294#true, Black: 296#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 38#L74-4true, Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 245#true]) [2021-11-09 08:33:03,627 INFO L384 tUnfolder$Statistics]: this new event has 65 ancestors and is not cut-off event [2021-11-09 08:33:03,627 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2021-11-09 08:33:03,627 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2021-11-09 08:33:03,627 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2021-11-09 08:33:04,114 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([562] L56-15-->L56-16: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork1_#t~ite14_3|) InVars {thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} AuxVars[] AssignedVars[~result_8~0][219], [308#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), 33#L50-16true, 288#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), 66#L56-16true, Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 278#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 277#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 275#true, 202#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 289#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), 298#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 287#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), 16#L44true, Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), Black: 297#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 294#true, Black: 296#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 38#L74-4true, Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 245#true]) [2021-11-09 08:33:04,114 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2021-11-09 08:33:04,114 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-11-09 08:33:04,114 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-11-09 08:33:04,114 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2021-11-09 08:33:04,531 INFO L129 PetriNetUnfolder]: 867/8594 cut-off events. [2021-11-09 08:33:04,531 INFO L130 PetriNetUnfolder]: For 18134/44290 co-relation queries the response was YES. [2021-11-09 08:33:04,610 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17882 conditions, 8594 events. 867/8594 cut-off events. For 18134/44290 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 115896 event pairs, 173 based on Foata normal form. 139/8340 useless extension candidates. Maximal degree in co-relation 16194. Up to 656 conditions per place. [2021-11-09 08:33:04,660 INFO L132 encePairwiseOnDemand]: 189/206 looper letters, 185 selfloop transitions, 95 changer transitions 3/452 dead transitions. [2021-11-09 08:33:04,660 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 452 transitions, 5309 flow [2021-11-09 08:33:04,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 08:33:04,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-11-09 08:33:04,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 931 transitions. [2021-11-09 08:33:04,664 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.903883495145631 [2021-11-09 08:33:04,664 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 931 transitions. [2021-11-09 08:33:04,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 931 transitions. [2021-11-09 08:33:04,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:33:04,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 931 transitions. [2021-11-09 08:33:04,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 186.2) internal successors, (931), 5 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:04,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:04,673 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:04,673 INFO L186 Difference]: Start difference. First operand has 242 places, 378 transitions, 3705 flow. Second operand 5 states and 931 transitions. [2021-11-09 08:33:04,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 452 transitions, 5309 flow [2021-11-09 08:33:04,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 452 transitions, 5309 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-11-09 08:33:04,762 INFO L242 Difference]: Finished difference. Result has 250 places, 407 transitions, 4593 flow [2021-11-09 08:33:04,763 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=3675, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4593, PETRI_PLACES=250, PETRI_TRANSITIONS=407} [2021-11-09 08:33:04,763 INFO L334 CegarLoopForPetriNet]: 186 programPoint places, 64 predicate places. [2021-11-09 08:33:04,764 INFO L470 AbstractCegarLoop]: Abstraction has has 250 places, 407 transitions, 4593 flow [2021-11-09 08:33:04,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:04,764 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:33:04,765 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:33:04,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-09 08:33:04,765 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-09 08:33:04,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:33:04,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1953263115, now seen corresponding path program 5 times [2021-11-09 08:33:04,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:33:04,766 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080063888] [2021-11-09 08:33:04,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:33:04,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:33:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:33:04,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:33:04,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:33:04,895 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080063888] [2021-11-09 08:33:04,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080063888] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:33:04,895 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:33:04,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:33:04,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053973540] [2021-11-09 08:33:04,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 08:33:04,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:33:04,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:33:04,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:33:04,904 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2021-11-09 08:33:04,905 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 407 transitions, 4593 flow. Second operand has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:04,906 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:33:04,906 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2021-11-09 08:33:04,906 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:33:05,944 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([562] L56-15-->L56-16: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork1_#t~ite14_3|) InVars {thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} AuxVars[] AssignedVars[~result_8~0][230], [308#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), 288#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 33#L50-16true, Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), 66#L56-16true, Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 278#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 277#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 275#true, 19#L44-8true, 318#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), 202#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 289#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 298#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), Black: 287#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), Black: 297#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 294#true, Black: 296#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 38#L74-4true, Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 304#true, Black: 306#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 307#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 245#true]) [2021-11-09 08:33:05,944 INFO L384 tUnfolder$Statistics]: this new event has 65 ancestors and is not cut-off event [2021-11-09 08:33:05,944 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2021-11-09 08:33:05,944 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2021-11-09 08:33:05,944 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2021-11-09 08:33:06,410 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([523] L50-15-->L50-16: Formula: (= v_~result_7~0_1 |v_thread2Thread1of1ForFork0_#t~ite10_3|) InVars {thread2Thread1of1ForFork0_#t~ite10=|v_thread2Thread1of1ForFork0_#t~ite10_3|} OutVars{~result_7~0=v_~result_7~0_1, thread2Thread1of1ForFork0_#t~ite10=|v_thread2Thread1of1ForFork0_#t~ite10_3|} AuxVars[] AssignedVars[~result_7~0][436], [308#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), 288#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 33#L50-16true, Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 66#L56-16true, 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 278#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 277#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 318#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 275#true, 202#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 289#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), 298#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 287#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), 16#L44true, Black: 297#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 294#true, Black: 296#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 38#L74-4true, Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 304#true, Black: 306#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 307#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 245#true]) [2021-11-09 08:33:06,410 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2021-11-09 08:33:06,410 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2021-11-09 08:33:06,410 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-11-09 08:33:06,410 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2021-11-09 08:33:06,413 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([562] L56-15-->L56-16: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork1_#t~ite14_3|) InVars {thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} AuxVars[] AssignedVars[~result_8~0][230], [308#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), 33#L50-16true, 288#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 66#L56-16true, 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 278#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 277#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 275#true, 318#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), 202#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 289#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 298#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 287#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), 16#L44true, Black: 297#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 294#true, Black: 296#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 38#L74-4true, Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 304#true, Black: 306#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 307#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 245#true]) [2021-11-09 08:33:06,413 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2021-11-09 08:33:06,413 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2021-11-09 08:33:06,413 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-11-09 08:33:06,413 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2021-11-09 08:33:06,422 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([562] L56-15-->L56-16: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork1_#t~ite14_3|) InVars {thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} AuxVars[] AssignedVars[~result_8~0][230], [308#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), 288#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 33#L50-16true, Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 66#L56-16true, 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 278#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 277#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 318#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 275#true, 202#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 289#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), 298#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 287#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), 16#L44true, Black: 297#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 294#true, Black: 296#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 38#L74-4true, Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 304#true, Black: 306#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 307#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 245#true]) [2021-11-09 08:33:06,422 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2021-11-09 08:33:06,422 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2021-11-09 08:33:06,423 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-11-09 08:33:06,423 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-11-09 08:33:06,423 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2021-11-09 08:33:06,583 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([603] thread2EXIT-->L76-2: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= 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~mem28=|v_ULTIMATE.start_main_#t~mem28_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28=|v_ULTIMATE.start_main_#t~mem28_5|} AuxVars[] AssignedVars[][464], [308#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), 288#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 278#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 277#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 318#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 275#true, 202#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 289#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), 298#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 287#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), Black: 297#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 294#true, Black: 296#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 146#L56-3true, Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 179#L76-2true, Black: 304#true, Black: 306#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 307#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 245#true]) [2021-11-09 08:33:06,583 INFO L384 tUnfolder$Statistics]: this new event has 99 ancestors and is not cut-off event [2021-11-09 08:33:06,583 INFO L387 tUnfolder$Statistics]: existing Event has 103 ancestors and is not cut-off event [2021-11-09 08:33:06,583 INFO L387 tUnfolder$Statistics]: existing Event has 101 ancestors and is not cut-off event [2021-11-09 08:33:06,583 INFO L387 tUnfolder$Statistics]: existing Event has 119 ancestors and is not cut-off event [2021-11-09 08:33:06,593 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([604] thread3EXIT-->L77-2: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem29=|v_ULTIMATE.start_main_#t~mem29_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem29=|v_ULTIMATE.start_main_#t~mem29_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][473], [308#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), 288#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 278#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 277#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 275#true, 318#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 205#(= ~result_7~0 0), Black: 289#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), 298#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 287#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), 117#L77-2true, Black: 297#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 294#true, Black: 296#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 304#true, Black: 306#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 307#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 245#true]) [2021-11-09 08:33:06,594 INFO L384 tUnfolder$Statistics]: this new event has 111 ancestors and is cut-off event [2021-11-09 08:33:06,594 INFO L387 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2021-11-09 08:33:06,594 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2021-11-09 08:33:06,594 INFO L387 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2021-11-09 08:33:06,626 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([604] thread3EXIT-->L77-2: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem29=|v_ULTIMATE.start_main_#t~mem29_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem29=|v_ULTIMATE.start_main_#t~mem29_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][473], [308#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), 288#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 278#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 277#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 275#true, 318#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), 202#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 289#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), 298#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 287#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), 117#L77-2true, Black: 297#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 294#true, Black: 296#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 304#true, Black: 306#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 307#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 245#true]) [2021-11-09 08:33:06,626 INFO L384 tUnfolder$Statistics]: this new event has 111 ancestors and is cut-off event [2021-11-09 08:33:06,626 INFO L387 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2021-11-09 08:33:06,627 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2021-11-09 08:33:06,627 INFO L387 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2021-11-09 08:33:06,667 INFO L129 PetriNetUnfolder]: 863/8691 cut-off events. [2021-11-09 08:33:06,667 INFO L130 PetriNetUnfolder]: For 23267/53854 co-relation queries the response was YES. [2021-11-09 08:33:06,726 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18580 conditions, 8691 events. 863/8691 cut-off events. For 23267/53854 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 117113 event pairs, 160 based on Foata normal form. 190/8481 useless extension candidates. Maximal degree in co-relation 16901. Up to 670 conditions per place. [2021-11-09 08:33:06,774 INFO L132 encePairwiseOnDemand]: 190/206 looper letters, 214 selfloop transitions, 91 changer transitions 10/484 dead transitions. [2021-11-09 08:33:06,775 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 484 transitions, 6435 flow [2021-11-09 08:33:06,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 08:33:06,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-11-09 08:33:06,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1118 transitions. [2021-11-09 08:33:06,780 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9045307443365695 [2021-11-09 08:33:06,780 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1118 transitions. [2021-11-09 08:33:06,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1118 transitions. [2021-11-09 08:33:06,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:33:06,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1118 transitions. [2021-11-09 08:33:06,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 186.33333333333334) internal successors, (1118), 6 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:06,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:06,791 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:06,791 INFO L186 Difference]: Start difference. First operand has 250 places, 407 transitions, 4593 flow. Second operand 6 states and 1118 transitions. [2021-11-09 08:33:06,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 484 transitions, 6435 flow [2021-11-09 08:33:06,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 484 transitions, 6429 flow, removed 3 selfloop flow, removed 0 redundant places. [2021-11-09 08:33:06,907 INFO L242 Difference]: Finished difference. Result has 259 places, 420 transitions, 5132 flow [2021-11-09 08:33:06,908 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=4451, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5132, PETRI_PLACES=259, PETRI_TRANSITIONS=420} [2021-11-09 08:33:06,908 INFO L334 CegarLoopForPetriNet]: 186 programPoint places, 73 predicate places. [2021-11-09 08:33:06,908 INFO L470 AbstractCegarLoop]: Abstraction has has 259 places, 420 transitions, 5132 flow [2021-11-09 08:33:06,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:06,909 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:33:06,909 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:33:06,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-09 08:33:06,910 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-09 08:33:06,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:33:06,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1952901951, now seen corresponding path program 6 times [2021-11-09 08:33:06,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:33:06,911 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409022296] [2021-11-09 08:33:06,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:33:06,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:33:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:33:07,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:33:07,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:33:07,043 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409022296] [2021-11-09 08:33:07,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409022296] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:33:07,043 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:33:07,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:33:07,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809898142] [2021-11-09 08:33:07,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 08:33:07,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:33:07,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:33:07,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:33:07,050 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2021-11-09 08:33:07,051 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 420 transitions, 5132 flow. Second operand has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:07,052 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:33:07,052 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2021-11-09 08:33:07,052 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:33:08,467 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([562] L56-15-->L56-16: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork1_#t~ite14_3|) InVars {thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} AuxVars[] AssignedVars[~result_8~0][231], [Black: 317#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 308#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 316#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 33#L50-16true, Black: 320#(and (or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))))), 288#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), 66#L56-16true, Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 278#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 277#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 275#true, 318#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), 202#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 289#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), 298#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 287#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), 16#L44true, Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), 328#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 297#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 294#true, Black: 296#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 38#L74-4true, Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 304#true, Black: 306#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 307#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 245#true]) [2021-11-09 08:33:08,468 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2021-11-09 08:33:08,468 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-11-09 08:33:08,468 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2021-11-09 08:33:08,468 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-11-09 08:33:08,648 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([604] thread3EXIT-->L77-2: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem29=|v_ULTIMATE.start_main_#t~mem29_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem29=|v_ULTIMATE.start_main_#t~mem29_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][475], [Black: 317#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 308#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 316#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 320#(and (or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))))), 288#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 278#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 277#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 318#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 275#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 289#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 205#(= ~result_7~0 0), 298#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), Black: 287#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), 328#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 117#L77-2true, Black: 297#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 294#true, Black: 296#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 304#true, Black: 306#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 307#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 245#true]) [2021-11-09 08:33:08,649 INFO L384 tUnfolder$Statistics]: this new event has 111 ancestors and is cut-off event [2021-11-09 08:33:08,649 INFO L387 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2021-11-09 08:33:08,649 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2021-11-09 08:33:08,649 INFO L387 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2021-11-09 08:33:08,673 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([604] thread3EXIT-->L77-2: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem29=|v_ULTIMATE.start_main_#t~mem29_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem29=|v_ULTIMATE.start_main_#t~mem29_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][475], [308#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 317#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 316#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 320#(and (or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))))), 288#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 278#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 277#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 275#true, 318#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), 202#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 289#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 298#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 287#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), 328#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 117#L77-2true, Black: 297#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 294#true, Black: 296#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 304#true, Black: 306#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 307#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 245#true]) [2021-11-09 08:33:08,673 INFO L384 tUnfolder$Statistics]: this new event has 113 ancestors and is cut-off event [2021-11-09 08:33:08,673 INFO L387 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2021-11-09 08:33:08,673 INFO L387 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2021-11-09 08:33:08,674 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2021-11-09 08:33:08,703 INFO L129 PetriNetUnfolder]: 841/8452 cut-off events. [2021-11-09 08:33:08,703 INFO L130 PetriNetUnfolder]: For 25867/55767 co-relation queries the response was YES. [2021-11-09 08:33:08,778 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18455 conditions, 8452 events. 841/8452 cut-off events. For 25867/55767 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 113443 event pairs, 150 based on Foata normal form. 161/8229 useless extension candidates. Maximal degree in co-relation 17117. Up to 685 conditions per place. [2021-11-09 08:33:08,828 INFO L132 encePairwiseOnDemand]: 193/206 looper letters, 244 selfloop transitions, 72 changer transitions 1/486 dead transitions. [2021-11-09 08:33:08,828 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 486 transitions, 6994 flow [2021-11-09 08:33:08,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 08:33:08,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-11-09 08:33:08,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 923 transitions. [2021-11-09 08:33:08,833 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8961165048543689 [2021-11-09 08:33:08,833 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 923 transitions. [2021-11-09 08:33:08,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 923 transitions. [2021-11-09 08:33:08,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:33:08,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 923 transitions. [2021-11-09 08:33:08,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 184.6) internal successors, (923), 5 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:08,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:08,843 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:08,843 INFO L186 Difference]: Start difference. First operand has 259 places, 420 transitions, 5132 flow. Second operand 5 states and 923 transitions. [2021-11-09 08:33:08,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 486 transitions, 6994 flow [2021-11-09 08:33:09,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 486 transitions, 6900 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-11-09 08:33:09,172 INFO L242 Difference]: Finished difference. Result has 264 places, 432 transitions, 5647 flow [2021-11-09 08:33:09,173 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=4969, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5647, PETRI_PLACES=264, PETRI_TRANSITIONS=432} [2021-11-09 08:33:09,173 INFO L334 CegarLoopForPetriNet]: 186 programPoint places, 78 predicate places. [2021-11-09 08:33:09,174 INFO L470 AbstractCegarLoop]: Abstraction has has 264 places, 432 transitions, 5647 flow [2021-11-09 08:33:09,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:09,174 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:33:09,175 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:33:09,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-09 08:33:09,175 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-09 08:33:09,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:33:09,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1983189157, now seen corresponding path program 7 times [2021-11-09 08:33:09,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:33:09,176 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173400116] [2021-11-09 08:33:09,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:33:09,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:33:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:33:09,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:33:09,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:33:09,313 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173400116] [2021-11-09 08:33:09,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173400116] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:33:09,314 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:33:09,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:33:09,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474560862] [2021-11-09 08:33:09,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 08:33:09,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:33:09,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:33:09,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:33:09,318 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2021-11-09 08:33:09,331 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 432 transitions, 5647 flow. Second operand has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:09,340 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:33:09,341 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2021-11-09 08:33:09,341 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:33:11,172 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([562] L56-15-->L56-16: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork1_#t~ite14_3|) InVars {thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} AuxVars[] AssignedVars[~result_8~0][230], [Black: 317#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 308#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 316#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 288#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 320#(and (or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))))), 33#L50-16true, Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 66#L56-16true, 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 329#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 332#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 278#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 277#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 275#true, 202#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 289#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), 298#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 287#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), 16#L44true, 328#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 339#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 297#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 294#true, Black: 296#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 38#L74-4true, Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 304#true, Black: 306#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 307#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 245#true]) [2021-11-09 08:33:11,172 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2021-11-09 08:33:11,172 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2021-11-09 08:33:11,172 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-11-09 08:33:11,173 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-11-09 08:33:11,338 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([604] thread3EXIT-->L77-2: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem29=|v_ULTIMATE.start_main_#t~mem29_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem29=|v_ULTIMATE.start_main_#t~mem29_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][470], [Black: 317#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 308#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 316#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 320#(and (or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))))), 288#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 329#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 332#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 278#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 277#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 275#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 205#(= ~result_7~0 0), Black: 289#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), 298#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 287#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), 328#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 117#L77-2true, 339#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 297#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 294#true, Black: 296#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 304#true, Black: 306#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 307#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 245#true]) [2021-11-09 08:33:11,338 INFO L384 tUnfolder$Statistics]: this new event has 111 ancestors and is cut-off event [2021-11-09 08:33:11,339 INFO L387 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2021-11-09 08:33:11,339 INFO L387 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2021-11-09 08:33:11,339 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2021-11-09 08:33:11,365 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([604] thread3EXIT-->L77-2: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem29=|v_ULTIMATE.start_main_#t~mem29_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem29=|v_ULTIMATE.start_main_#t~mem29_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][470], [308#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 317#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 316#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 288#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 320#(and (or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))))), Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 329#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 332#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 278#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 277#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 275#true, 202#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 289#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 298#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 287#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), 328#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 339#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 117#L77-2true, Black: 297#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 294#true, Black: 296#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 304#true, Black: 306#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 307#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 245#true]) [2021-11-09 08:33:11,366 INFO L384 tUnfolder$Statistics]: this new event has 113 ancestors and is cut-off event [2021-11-09 08:33:11,366 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2021-11-09 08:33:11,366 INFO L387 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2021-11-09 08:33:11,366 INFO L387 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2021-11-09 08:33:11,406 INFO L129 PetriNetUnfolder]: 836/8407 cut-off events. [2021-11-09 08:33:11,406 INFO L130 PetriNetUnfolder]: For 29372/61565 co-relation queries the response was YES. [2021-11-09 08:33:11,491 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18579 conditions, 8407 events. 836/8407 cut-off events. For 29372/61565 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 112818 event pairs, 150 based on Foata normal form. 156/8186 useless extension candidates. Maximal degree in co-relation 17275. Up to 685 conditions per place. [2021-11-09 08:33:11,536 INFO L132 encePairwiseOnDemand]: 194/206 looper letters, 251 selfloop transitions, 60 changer transitions 1/481 dead transitions. [2021-11-09 08:33:11,536 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 481 transitions, 7100 flow [2021-11-09 08:33:11,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 08:33:11,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-11-09 08:33:11,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 917 transitions. [2021-11-09 08:33:11,541 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8902912621359224 [2021-11-09 08:33:11,541 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 917 transitions. [2021-11-09 08:33:11,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 917 transitions. [2021-11-09 08:33:11,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:33:11,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 917 transitions. [2021-11-09 08:33:11,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 183.4) internal successors, (917), 5 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:11,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:11,550 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:11,550 INFO L186 Difference]: Start difference. First operand has 264 places, 432 transitions, 5647 flow. Second operand 5 states and 917 transitions. [2021-11-09 08:33:11,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 481 transitions, 7100 flow [2021-11-09 08:33:11,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 481 transitions, 7078 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-11-09 08:33:11,722 INFO L242 Difference]: Finished difference. Result has 269 places, 434 transitions, 5781 flow [2021-11-09 08:33:11,723 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=5469, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5781, PETRI_PLACES=269, PETRI_TRANSITIONS=434} [2021-11-09 08:33:11,723 INFO L334 CegarLoopForPetriNet]: 186 programPoint places, 83 predicate places. [2021-11-09 08:33:11,724 INFO L470 AbstractCegarLoop]: Abstraction has has 269 places, 434 transitions, 5781 flow [2021-11-09 08:33:11,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:11,724 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:33:11,724 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:33:11,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-09 08:33:11,725 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-09 08:33:11,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:33:11,726 INFO L85 PathProgramCache]: Analyzing trace with hash -826891889, now seen corresponding path program 8 times [2021-11-09 08:33:11,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:33:11,726 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913334896] [2021-11-09 08:33:11,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:33:11,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:33:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:33:11,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:33:11,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:33:11,893 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913334896] [2021-11-09 08:33:11,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913334896] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:33:11,893 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:33:11,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:33:11,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188687885] [2021-11-09 08:33:11,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 08:33:11,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:33:11,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:33:11,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:33:11,897 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2021-11-09 08:33:11,900 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 434 transitions, 5781 flow. Second operand has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:11,915 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:33:11,916 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2021-11-09 08:33:11,916 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:33:13,368 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([562] L56-15-->L56-16: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork1_#t~ite14_3|) InVars {thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork1_#t~ite14=|v_thread3Thread1of1ForFork1_#t~ite14_3|} AuxVars[] AssignedVars[~result_8~0][229], [Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 66#L56-16true, Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 278#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 277#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 275#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 289#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 298#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 287#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 16#L44true, 328#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 297#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 294#true, Black: 296#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 304#true, Black: 306#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 307#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 317#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 308#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 316#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 33#L50-16true, Black: 320#(and (or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))))), 288#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 329#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 332#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 351#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 340#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 343#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 202#true, Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), 339#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 38#L74-4true, Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 245#true]) [2021-11-09 08:33:13,368 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2021-11-09 08:33:13,368 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-11-09 08:33:13,368 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2021-11-09 08:33:13,368 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-11-09 08:33:13,535 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([604] thread3EXIT-->L77-2: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem29=|v_ULTIMATE.start_main_#t~mem29_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem29=|v_ULTIMATE.start_main_#t~mem29_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][472], [Black: 317#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 308#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 316#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 320#(and (or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))))), 288#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 329#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 332#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 278#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 351#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 340#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 343#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 277#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 275#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 289#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 205#(= ~result_7~0 0), 298#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), Black: 287#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), 328#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 339#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 117#L77-2true, Black: 297#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 294#true, Black: 296#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 304#true, Black: 306#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 307#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 245#true]) [2021-11-09 08:33:13,535 INFO L384 tUnfolder$Statistics]: this new event has 111 ancestors and is cut-off event [2021-11-09 08:33:13,535 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2021-11-09 08:33:13,535 INFO L387 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2021-11-09 08:33:13,535 INFO L387 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2021-11-09 08:33:13,557 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([604] thread3EXIT-->L77-2: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem29=|v_ULTIMATE.start_main_#t~mem29_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem29=|v_ULTIMATE.start_main_#t~mem29_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][472], [Black: 317#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 308#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 316#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 288#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 320#(and (or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))))), Black: 255#true, Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 329#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 332#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 278#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 340#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 351#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 343#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 277#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 275#true, 202#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 289#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), 298#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 287#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 205#(= ~result_7~0 0), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), 328#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 117#L77-2true, 339#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 297#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 294#true, Black: 296#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 304#true, Black: 306#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 307#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 245#true]) [2021-11-09 08:33:13,557 INFO L384 tUnfolder$Statistics]: this new event has 113 ancestors and is cut-off event [2021-11-09 08:33:13,557 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2021-11-09 08:33:13,557 INFO L387 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2021-11-09 08:33:13,557 INFO L387 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2021-11-09 08:33:13,593 INFO L129 PetriNetUnfolder]: 817/8266 cut-off events. [2021-11-09 08:33:13,593 INFO L130 PetriNetUnfolder]: For 29635/60761 co-relation queries the response was YES. [2021-11-09 08:33:13,668 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18442 conditions, 8266 events. 817/8266 cut-off events. For 29635/60761 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 110529 event pairs, 151 based on Foata normal form. 151/8037 useless extension candidates. Maximal degree in co-relation 17651. Up to 622 conditions per place. [2021-11-09 08:33:13,704 INFO L132 encePairwiseOnDemand]: 191/206 looper letters, 229 selfloop transitions, 84 changer transitions 1/483 dead transitions. [2021-11-09 08:33:13,705 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 483 transitions, 7311 flow [2021-11-09 08:33:13,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 08:33:13,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-11-09 08:33:13,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 929 transitions. [2021-11-09 08:33:13,712 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9019417475728155 [2021-11-09 08:33:13,713 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 929 transitions. [2021-11-09 08:33:13,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 929 transitions. [2021-11-09 08:33:13,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:33:13,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 929 transitions. [2021-11-09 08:33:13,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 185.8) internal successors, (929), 5 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:13,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:13,721 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:13,721 INFO L186 Difference]: Start difference. First operand has 269 places, 434 transitions, 5781 flow. Second operand 5 states and 929 transitions. [2021-11-09 08:33:13,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 483 transitions, 7311 flow [2021-11-09 08:33:13,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 483 transitions, 7238 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-11-09 08:33:13,905 INFO L242 Difference]: Finished difference. Result has 273 places, 439 transitions, 6086 flow [2021-11-09 08:33:13,906 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=5683, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6086, PETRI_PLACES=273, PETRI_TRANSITIONS=439} [2021-11-09 08:33:13,908 INFO L334 CegarLoopForPetriNet]: 186 programPoint places, 87 predicate places. [2021-11-09 08:33:13,908 INFO L470 AbstractCegarLoop]: Abstraction has has 273 places, 439 transitions, 6086 flow [2021-11-09 08:33:13,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:13,909 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:33:13,909 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:33:13,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-09 08:33:13,909 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-09 08:33:13,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:33:13,910 INFO L85 PathProgramCache]: Analyzing trace with hash 37356925, now seen corresponding path program 5 times [2021-11-09 08:33:13,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:33:13,911 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343777619] [2021-11-09 08:33:13,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:33:13,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:33:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:33:14,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:33:14,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:33:14,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343777619] [2021-11-09 08:33:14,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343777619] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:33:14,036 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:33:14,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:33:14,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325443341] [2021-11-09 08:33:14,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 08:33:14,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:33:14,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:33:14,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:33:14,039 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2021-11-09 08:33:14,041 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 439 transitions, 6086 flow. Second operand has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:14,041 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:33:14,041 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2021-11-09 08:33:14,041 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:33:16,073 INFO L129 PetriNetUnfolder]: 814/8151 cut-off events. [2021-11-09 08:33:16,073 INFO L130 PetriNetUnfolder]: For 30784/62738 co-relation queries the response was YES. [2021-11-09 08:33:16,389 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18523 conditions, 8151 events. 814/8151 cut-off events. For 30784/62738 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 109032 event pairs, 149 based on Foata normal form. 182/7968 useless extension candidates. Maximal degree in co-relation 17718. Up to 650 conditions per place. [2021-11-09 08:33:16,416 INFO L132 encePairwiseOnDemand]: 190/206 looper letters, 236 selfloop transitions, 101 changer transitions 4/510 dead transitions. [2021-11-09 08:33:16,417 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 510 transitions, 8023 flow [2021-11-09 08:33:16,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 08:33:16,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-11-09 08:33:16,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 930 transitions. [2021-11-09 08:33:16,421 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9029126213592233 [2021-11-09 08:33:16,421 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 930 transitions. [2021-11-09 08:33:16,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 930 transitions. [2021-11-09 08:33:16,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:33:16,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 930 transitions. [2021-11-09 08:33:16,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 186.0) internal successors, (930), 5 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:16,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:16,430 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:16,430 INFO L186 Difference]: Start difference. First operand has 273 places, 439 transitions, 6086 flow. Second operand 5 states and 930 transitions. [2021-11-09 08:33:16,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 510 transitions, 8023 flow [2021-11-09 08:33:16,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 510 transitions, 7847 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-11-09 08:33:16,583 INFO L242 Difference]: Finished difference. Result has 277 places, 454 transitions, 6613 flow [2021-11-09 08:33:16,584 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=5951, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6613, PETRI_PLACES=277, PETRI_TRANSITIONS=454} [2021-11-09 08:33:16,584 INFO L334 CegarLoopForPetriNet]: 186 programPoint places, 91 predicate places. [2021-11-09 08:33:16,584 INFO L470 AbstractCegarLoop]: Abstraction has has 277 places, 454 transitions, 6613 flow [2021-11-09 08:33:16,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:16,584 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:33:16,584 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:33:16,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-09 08:33:16,585 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-09 08:33:16,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:33:16,585 INFO L85 PathProgramCache]: Analyzing trace with hash 2082996615, now seen corresponding path program 9 times [2021-11-09 08:33:16,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:33:16,586 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328454079] [2021-11-09 08:33:16,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:33:16,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:33:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:33:16,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:33:16,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:33:16,696 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328454079] [2021-11-09 08:33:16,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328454079] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:33:16,697 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:33:16,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:33:16,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516146794] [2021-11-09 08:33:16,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 08:33:16,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:33:16,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:33:16,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:33:16,700 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2021-11-09 08:33:16,701 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 454 transitions, 6613 flow. Second operand has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:16,702 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:33:16,702 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2021-11-09 08:33:16,702 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:33:18,307 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([604] thread3EXIT-->L77-2: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem29=|v_ULTIMATE.start_main_#t~mem29_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem29=|v_ULTIMATE.start_main_#t~mem29_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][504], [Black: 255#true, 359#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 257#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 258#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 265#true, Black: 269#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 267#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 278#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 277#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 275#true, 248#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 289#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 298#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 287#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 117#L77-2true, Black: 297#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 294#true, Black: 296#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 304#true, Black: 306#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 307#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 367#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 238#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), 308#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 317#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 316#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), 288#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))), Black: 320#(and (or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256)))))), 259#(= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))), Black: 329#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 332#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 340#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 343#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256)))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), Black: 350#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 205#(= ~result_7~0 0), Black: 214#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread3Thread1of1ForFork1_#t~ite14| 0)), Black: 211#(and (= ~result_8~0 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork0_#t~ite10| 0)), Black: 207#(and (= ~result_8~0 0) (= ~result_7~0 0)), Black: 357#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 358#(or (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), 339#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 235#true, Black: 239#(and (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))))), 268#(or (and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), Black: 237#(or (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256))) (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))) (not (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))))), Black: 247#(or (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (= ~sort_label_is_null_1~0 (* 256 (div ~sort_label_is_null_1~0 256)))), 279#(= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))), Black: 249#(and (= ~sort_label_is_null_5~0 (* 256 (div ~sort_label_is_null_5~0 256))) (not (= ~sort_label_is_null_3~0 (* 256 (div ~sort_label_is_null_3~0 256))))), Black: 245#true]) [2021-11-09 08:33:18,307 INFO L384 tUnfolder$Statistics]: this new event has 111 ancestors and is cut-off event [2021-11-09 08:33:18,307 INFO L387 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2021-11-09 08:33:18,308 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2021-11-09 08:33:18,308 INFO L387 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2021-11-09 08:33:18,369 INFO L129 PetriNetUnfolder]: 805/8131 cut-off events. [2021-11-09 08:33:18,369 INFO L130 PetriNetUnfolder]: For 33763/72679 co-relation queries the response was YES. [2021-11-09 08:33:18,452 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18712 conditions, 8131 events. 805/8131 cut-off events. For 33763/72679 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 108589 event pairs, 175 based on Foata normal form. 174/7945 useless extension candidates. Maximal degree in co-relation 17948. Up to 726 conditions per place. [2021-11-09 08:33:18,481 INFO L132 encePairwiseOnDemand]: 194/206 looper letters, 254 selfloop transitions, 85 changer transitions 7/515 dead transitions. [2021-11-09 08:33:18,481 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 515 transitions, 8456 flow [2021-11-09 08:33:18,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 08:33:18,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-11-09 08:33:18,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 916 transitions. [2021-11-09 08:33:18,485 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8893203883495145 [2021-11-09 08:33:18,486 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 916 transitions. [2021-11-09 08:33:18,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 916 transitions. [2021-11-09 08:33:18,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:33:18,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 916 transitions. [2021-11-09 08:33:18,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 183.2) internal successors, (916), 5 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:18,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:18,494 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:18,494 INFO L186 Difference]: Start difference. First operand has 277 places, 454 transitions, 6613 flow. Second operand 5 states and 916 transitions. [2021-11-09 08:33:18,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 515 transitions, 8456 flow [2021-11-09 08:33:18,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 515 transitions, 8413 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-11-09 08:33:18,687 INFO L242 Difference]: Finished difference. Result has 284 places, 472 transitions, 7287 flow [2021-11-09 08:33:18,688 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=6573, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7287, PETRI_PLACES=284, PETRI_TRANSITIONS=472} [2021-11-09 08:33:18,688 INFO L334 CegarLoopForPetriNet]: 186 programPoint places, 98 predicate places. [2021-11-09 08:33:18,688 INFO L470 AbstractCegarLoop]: Abstraction has has 284 places, 472 transitions, 7287 flow [2021-11-09 08:33:18,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:18,689 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:33:18,689 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:33:18,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-09 08:33:18,690 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-09 08:33:18,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:33:18,690 INFO L85 PathProgramCache]: Analyzing trace with hash 387477949, now seen corresponding path program 6 times [2021-11-09 08:33:18,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:33:18,691 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428446071] [2021-11-09 08:33:18,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:33:18,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:33:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:33:18,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:33:18,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:33:18,775 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428446071] [2021-11-09 08:33:18,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428446071] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:33:18,776 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:33:18,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:33:18,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408051520] [2021-11-09 08:33:18,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 08:33:18,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:33:18,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:33:18,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:33:18,779 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2021-11-09 08:33:18,780 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 472 transitions, 7287 flow. Second operand has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:18,780 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:33:18,780 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2021-11-09 08:33:18,780 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:33:20,774 INFO L129 PetriNetUnfolder]: 813/8174 cut-off events. [2021-11-09 08:33:20,775 INFO L130 PetriNetUnfolder]: For 36666/77555 co-relation queries the response was YES. [2021-11-09 08:33:20,859 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19166 conditions, 8174 events. 813/8174 cut-off events. For 36666/77555 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 109312 event pairs, 164 based on Foata normal form. 193/8008 useless extension candidates. Maximal degree in co-relation 18394. Up to 633 conditions per place. [2021-11-09 08:33:20,891 INFO L132 encePairwiseOnDemand]: 191/206 looper letters, 239 selfloop transitions, 107 changer transitions 5/520 dead transitions. [2021-11-09 08:33:20,891 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 520 transitions, 8869 flow [2021-11-09 08:33:20,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 08:33:20,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-11-09 08:33:20,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 924 transitions. [2021-11-09 08:33:20,896 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8970873786407767 [2021-11-09 08:33:20,896 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 924 transitions. [2021-11-09 08:33:20,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 924 transitions. [2021-11-09 08:33:20,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:33:20,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 924 transitions. [2021-11-09 08:33:20,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 184.8) internal successors, (924), 5 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:20,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:20,905 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:20,905 INFO L186 Difference]: Start difference. First operand has 284 places, 472 transitions, 7287 flow. Second operand 5 states and 924 transitions. [2021-11-09 08:33:20,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 520 transitions, 8869 flow [2021-11-09 08:33:21,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 520 transitions, 8869 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-11-09 08:33:21,181 INFO L242 Difference]: Finished difference. Result has 290 places, 478 transitions, 7817 flow [2021-11-09 08:33:21,182 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=7287, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7817, PETRI_PLACES=290, PETRI_TRANSITIONS=478} [2021-11-09 08:33:21,182 INFO L334 CegarLoopForPetriNet]: 186 programPoint places, 104 predicate places. [2021-11-09 08:33:21,183 INFO L470 AbstractCegarLoop]: Abstraction has has 290 places, 478 transitions, 7817 flow [2021-11-09 08:33:21,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:21,183 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:33:21,184 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:33:21,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-09 08:33:21,184 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-09 08:33:21,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:33:21,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1294739373, now seen corresponding path program 7 times [2021-11-09 08:33:21,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:33:21,185 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120895701] [2021-11-09 08:33:21,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:33:21,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:33:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:33:21,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:33:21,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:33:21,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120895701] [2021-11-09 08:33:21,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120895701] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:33:21,318 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:33:21,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:33:21,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322102351] [2021-11-09 08:33:21,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 08:33:21,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:33:21,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:33:21,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:33:21,324 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2021-11-09 08:33:21,325 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 478 transitions, 7817 flow. Second operand has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:21,325 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:33:21,326 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2021-11-09 08:33:21,326 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:33:23,247 INFO L129 PetriNetUnfolder]: 775/8008 cut-off events. [2021-11-09 08:33:23,247 INFO L130 PetriNetUnfolder]: For 41190/81657 co-relation queries the response was YES. [2021-11-09 08:33:23,328 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18841 conditions, 8008 events. 775/8008 cut-off events. For 41190/81657 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 106939 event pairs, 138 based on Foata normal form. 209/7865 useless extension candidates. Maximal degree in co-relation 18064. Up to 742 conditions per place. [2021-11-09 08:33:23,356 INFO L132 encePairwiseOnDemand]: 191/206 looper letters, 270 selfloop transitions, 67 changer transitions 6/512 dead transitions. [2021-11-09 08:33:23,356 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 512 transitions, 8936 flow [2021-11-09 08:33:23,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 08:33:23,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-11-09 08:33:23,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 925 transitions. [2021-11-09 08:33:23,360 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8980582524271845 [2021-11-09 08:33:23,360 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 925 transitions. [2021-11-09 08:33:23,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 925 transitions. [2021-11-09 08:33:23,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:33:23,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 925 transitions. [2021-11-09 08:33:23,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:23,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:23,368 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:23,368 INFO L186 Difference]: Start difference. First operand has 290 places, 478 transitions, 7817 flow. Second operand 5 states and 925 transitions. [2021-11-09 08:33:23,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 512 transitions, 8936 flow [2021-11-09 08:33:23,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 512 transitions, 8807 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-11-09 08:33:23,551 INFO L242 Difference]: Finished difference. Result has 293 places, 478 transitions, 7792 flow [2021-11-09 08:33:23,551 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=7480, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7792, PETRI_PLACES=293, PETRI_TRANSITIONS=478} [2021-11-09 08:33:23,551 INFO L334 CegarLoopForPetriNet]: 186 programPoint places, 107 predicate places. [2021-11-09 08:33:23,552 INFO L470 AbstractCegarLoop]: Abstraction has has 293 places, 478 transitions, 7792 flow [2021-11-09 08:33:23,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:23,552 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:33:23,552 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:33:23,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-09 08:33:23,552 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-09 08:33:23,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:33:23,553 INFO L85 PathProgramCache]: Analyzing trace with hash -2065041031, now seen corresponding path program 10 times [2021-11-09 08:33:23,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:33:23,553 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707395659] [2021-11-09 08:33:23,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:33:23,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:33:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:33:23,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:33:23,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:33:23,640 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707395659] [2021-11-09 08:33:23,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707395659] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:33:23,640 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:33:23,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:33:23,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966593207] [2021-11-09 08:33:23,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 08:33:23,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:33:23,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:33:23,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:33:23,644 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2021-11-09 08:33:23,645 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 478 transitions, 7792 flow. Second operand has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:23,645 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:33:23,645 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2021-11-09 08:33:23,645 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:33:25,384 INFO L129 PetriNetUnfolder]: 790/7921 cut-off events. [2021-11-09 08:33:25,384 INFO L130 PetriNetUnfolder]: For 40538/81431 co-relation queries the response was YES. [2021-11-09 08:33:25,476 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18875 conditions, 7921 events. 790/7921 cut-off events. For 40538/81431 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 104998 event pairs, 159 based on Foata normal form. 195/7762 useless extension candidates. Maximal degree in co-relation 18094. Up to 604 conditions per place. [2021-11-09 08:33:25,505 INFO L132 encePairwiseOnDemand]: 193/206 looper letters, 246 selfloop transitions, 94 changer transitions 5/514 dead transitions. [2021-11-09 08:33:25,506 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 514 transitions, 9150 flow [2021-11-09 08:33:25,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 08:33:25,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-11-09 08:33:25,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 918 transitions. [2021-11-09 08:33:25,509 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8912621359223301 [2021-11-09 08:33:25,510 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 918 transitions. [2021-11-09 08:33:25,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 918 transitions. [2021-11-09 08:33:25,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:33:25,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 918 transitions. [2021-11-09 08:33:25,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 183.6) internal successors, (918), 5 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:25,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:25,517 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:25,517 INFO L186 Difference]: Start difference. First operand has 293 places, 478 transitions, 7792 flow. Second operand 5 states and 918 transitions. [2021-11-09 08:33:25,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 514 transitions, 9150 flow [2021-11-09 08:33:25,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 514 transitions, 9103 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-11-09 08:33:25,721 INFO L242 Difference]: Finished difference. Result has 297 places, 479 transitions, 7995 flow [2021-11-09 08:33:25,721 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=7633, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7995, PETRI_PLACES=297, PETRI_TRANSITIONS=479} [2021-11-09 08:33:25,722 INFO L334 CegarLoopForPetriNet]: 186 programPoint places, 111 predicate places. [2021-11-09 08:33:25,722 INFO L470 AbstractCegarLoop]: Abstraction has has 297 places, 479 transitions, 7995 flow [2021-11-09 08:33:25,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:25,722 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:33:25,723 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:33:25,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-09 08:33:25,723 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-09 08:33:25,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:33:25,724 INFO L85 PathProgramCache]: Analyzing trace with hash 773512927, now seen corresponding path program 8 times [2021-11-09 08:33:25,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:33:25,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163739782] [2021-11-09 08:33:25,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:33:25,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:33:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:33:25,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:33:25,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:33:25,792 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163739782] [2021-11-09 08:33:25,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163739782] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:33:25,792 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:33:25,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:33:25,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378132611] [2021-11-09 08:33:25,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 08:33:25,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:33:25,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:33:25,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:33:25,796 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2021-11-09 08:33:25,797 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 479 transitions, 7995 flow. Second operand has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:25,797 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:33:25,797 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2021-11-09 08:33:25,797 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:33:27,292 INFO L129 PetriNetUnfolder]: 790/7881 cut-off events. [2021-11-09 08:33:27,292 INFO L130 PetriNetUnfolder]: For 41697/83996 co-relation queries the response was YES. [2021-11-09 08:33:27,591 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19239 conditions, 7881 events. 790/7881 cut-off events. For 41697/83996 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 104288 event pairs, 107 based on Foata normal form. 193/7716 useless extension candidates. Maximal degree in co-relation 18456. Up to 618 conditions per place. [2021-11-09 08:33:27,630 INFO L132 encePairwiseOnDemand]: 189/206 looper letters, 247 selfloop transitions, 119 changer transitions 9/544 dead transitions. [2021-11-09 08:33:27,630 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 544 transitions, 10012 flow [2021-11-09 08:33:27,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 08:33:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-11-09 08:33:27,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1108 transitions. [2021-11-09 08:33:27,644 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8964401294498382 [2021-11-09 08:33:27,644 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1108 transitions. [2021-11-09 08:33:27,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1108 transitions. [2021-11-09 08:33:27,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:33:27,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1108 transitions. [2021-11-09 08:33:27,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 184.66666666666666) internal successors, (1108), 6 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:27,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:27,653 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:27,653 INFO L186 Difference]: Start difference. First operand has 297 places, 479 transitions, 7995 flow. Second operand 6 states and 1108 transitions. [2021-11-09 08:33:27,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 544 transitions, 10012 flow [2021-11-09 08:33:27,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 544 transitions, 9889 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-11-09 08:33:27,895 INFO L242 Difference]: Finished difference. Result has 304 places, 494 transitions, 8687 flow [2021-11-09 08:33:27,895 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=7889, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8687, PETRI_PLACES=304, PETRI_TRANSITIONS=494} [2021-11-09 08:33:27,896 INFO L334 CegarLoopForPetriNet]: 186 programPoint places, 118 predicate places. [2021-11-09 08:33:27,896 INFO L470 AbstractCegarLoop]: Abstraction has has 304 places, 494 transitions, 8687 flow [2021-11-09 08:33:27,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:27,897 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:33:27,897 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:33:27,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-09 08:33:27,897 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-09 08:33:27,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:33:27,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1388133653, now seen corresponding path program 9 times [2021-11-09 08:33:27,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:33:27,898 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732245081] [2021-11-09 08:33:27,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:33:27,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:33:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:33:27,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:33:27,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:33:27,985 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732245081] [2021-11-09 08:33:27,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732245081] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:33:27,986 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:33:27,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:33:27,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164184751] [2021-11-09 08:33:27,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 08:33:27,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:33:27,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:33:27,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:33:27,989 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2021-11-09 08:33:27,991 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 494 transitions, 8687 flow. Second operand has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:27,991 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:33:27,991 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2021-11-09 08:33:27,991 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:33:30,081 INFO L129 PetriNetUnfolder]: 774/7710 cut-off events. [2021-11-09 08:33:30,082 INFO L130 PetriNetUnfolder]: For 47271/94569 co-relation queries the response was YES. [2021-11-09 08:33:30,170 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19235 conditions, 7710 events. 774/7710 cut-off events. For 47271/94569 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 101758 event pairs, 130 based on Foata normal form. 173/7531 useless extension candidates. Maximal degree in co-relation 18444. Up to 608 conditions per place. [2021-11-09 08:33:30,202 INFO L132 encePairwiseOnDemand]: 192/206 looper letters, 309 selfloop transitions, 72 changer transitions 3/553 dead transitions. [2021-11-09 08:33:30,203 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 553 transitions, 10523 flow [2021-11-09 08:33:30,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 08:33:30,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-11-09 08:33:30,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 927 transitions. [2021-11-09 08:33:30,205 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9 [2021-11-09 08:33:30,206 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 927 transitions. [2021-11-09 08:33:30,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 927 transitions. [2021-11-09 08:33:30,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:33:30,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 927 transitions. [2021-11-09 08:33:30,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 185.4) internal successors, (927), 5 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:30,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:30,213 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:30,213 INFO L186 Difference]: Start difference. First operand has 304 places, 494 transitions, 8687 flow. Second operand 5 states and 927 transitions. [2021-11-09 08:33:30,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 553 transitions, 10523 flow [2021-11-09 08:33:30,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 553 transitions, 10464 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-11-09 08:33:30,497 INFO L242 Difference]: Finished difference. Result has 310 places, 507 transitions, 9211 flow [2021-11-09 08:33:30,498 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=8592, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=493, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9211, PETRI_PLACES=310, PETRI_TRANSITIONS=507} [2021-11-09 08:33:30,498 INFO L334 CegarLoopForPetriNet]: 186 programPoint places, 124 predicate places. [2021-11-09 08:33:30,498 INFO L470 AbstractCegarLoop]: Abstraction has has 310 places, 507 transitions, 9211 flow [2021-11-09 08:33:30,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:30,499 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:33:30,499 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:33:30,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-09 08:33:30,500 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-09 08:33:30,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:33:30,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1773851685, now seen corresponding path program 10 times [2021-11-09 08:33:30,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:33:30,501 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337561602] [2021-11-09 08:33:30,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:33:30,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:33:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:33:30,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:33:30,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:33:30,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337561602] [2021-11-09 08:33:30,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337561602] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:33:30,630 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:33:30,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:33:30,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764797995] [2021-11-09 08:33:30,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 08:33:30,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:33:30,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:33:30,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:33:30,634 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2021-11-09 08:33:30,636 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 507 transitions, 9211 flow. Second operand has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:30,636 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:33:30,636 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2021-11-09 08:33:30,636 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:33:32,397 INFO L129 PetriNetUnfolder]: 777/7739 cut-off events. [2021-11-09 08:33:32,397 INFO L130 PetriNetUnfolder]: For 51498/96028 co-relation queries the response was YES. [2021-11-09 08:33:32,497 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19569 conditions, 7739 events. 777/7739 cut-off events. For 51498/96028 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 102154 event pairs, 101 based on Foata normal form. 251/7640 useless extension candidates. Maximal degree in co-relation 18749. Up to 651 conditions per place. [2021-11-09 08:33:32,527 INFO L132 encePairwiseOnDemand]: 188/206 looper letters, 270 selfloop transitions, 107 changer transitions 6/552 dead transitions. [2021-11-09 08:33:32,527 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 552 transitions, 10763 flow [2021-11-09 08:33:32,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-09 08:33:32,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-11-09 08:33:32,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1284 transitions. [2021-11-09 08:33:32,529 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8904299583911235 [2021-11-09 08:33:32,530 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1284 transitions. [2021-11-09 08:33:32,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1284 transitions. [2021-11-09 08:33:32,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:33:32,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1284 transitions. [2021-11-09 08:33:32,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 183.42857142857142) internal successors, (1284), 7 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:32,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:32,537 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:32,537 INFO L186 Difference]: Start difference. First operand has 310 places, 507 transitions, 9211 flow. Second operand 7 states and 1284 transitions. [2021-11-09 08:33:32,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 552 transitions, 10763 flow [2021-11-09 08:33:32,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 552 transitions, 10723 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-11-09 08:33:32,843 INFO L242 Difference]: Finished difference. Result has 317 places, 513 transitions, 9578 flow [2021-11-09 08:33:32,844 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=9141, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9578, PETRI_PLACES=317, PETRI_TRANSITIONS=513} [2021-11-09 08:33:32,844 INFO L334 CegarLoopForPetriNet]: 186 programPoint places, 131 predicate places. [2021-11-09 08:33:32,844 INFO L470 AbstractCegarLoop]: Abstraction has has 317 places, 513 transitions, 9578 flow [2021-11-09 08:33:32,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:32,844 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:33:32,845 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:33:32,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-09 08:33:32,845 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-09 08:33:32,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:33:32,846 INFO L85 PathProgramCache]: Analyzing trace with hash -826221783, now seen corresponding path program 11 times [2021-11-09 08:33:32,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:33:32,846 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509305503] [2021-11-09 08:33:32,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:33:32,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:33:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:33:32,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:33:32,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:33:32,933 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509305503] [2021-11-09 08:33:32,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509305503] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:33:32,933 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:33:32,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:33:32,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825771034] [2021-11-09 08:33:32,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 08:33:32,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:33:32,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:33:32,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:33:32,937 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2021-11-09 08:33:32,938 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 513 transitions, 9578 flow. Second operand has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:32,938 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:33:32,938 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2021-11-09 08:33:32,938 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:33:34,456 INFO L129 PetriNetUnfolder]: 771/7789 cut-off events. [2021-11-09 08:33:34,456 INFO L130 PetriNetUnfolder]: For 53577/96899 co-relation queries the response was YES. [2021-11-09 08:33:34,551 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19756 conditions, 7789 events. 771/7789 cut-off events. For 53577/96899 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 103134 event pairs, 131 based on Foata normal form. 164/7604 useless extension candidates. Maximal degree in co-relation 18882. Up to 605 conditions per place. [2021-11-09 08:33:34,578 INFO L132 encePairwiseOnDemand]: 194/206 looper letters, 323 selfloop transitions, 60 changer transitions 3/555 dead transitions. [2021-11-09 08:33:34,578 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 555 transitions, 11013 flow [2021-11-09 08:33:34,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 08:33:34,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-11-09 08:33:34,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 920 transitions. [2021-11-09 08:33:34,580 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8932038834951457 [2021-11-09 08:33:34,580 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 920 transitions. [2021-11-09 08:33:34,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 920 transitions. [2021-11-09 08:33:34,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:33:34,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 920 transitions. [2021-11-09 08:33:34,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 184.0) internal successors, (920), 5 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:34,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:34,583 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:34,583 INFO L186 Difference]: Start difference. First operand has 317 places, 513 transitions, 9578 flow. Second operand 5 states and 920 transitions. [2021-11-09 08:33:34,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 555 transitions, 11013 flow [2021-11-09 08:33:34,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 555 transitions, 10826 flow, removed 25 selfloop flow, removed 4 redundant places. [2021-11-09 08:33:35,048 INFO L242 Difference]: Finished difference. Result has 319 places, 516 transitions, 9538 flow [2021-11-09 08:33:35,049 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=9231, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9538, PETRI_PLACES=319, PETRI_TRANSITIONS=516} [2021-11-09 08:33:35,049 INFO L334 CegarLoopForPetriNet]: 186 programPoint places, 133 predicate places. [2021-11-09 08:33:35,050 INFO L470 AbstractCegarLoop]: Abstraction has has 319 places, 516 transitions, 9538 flow [2021-11-09 08:33:35,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:35,050 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:33:35,050 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:33:35,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-09 08:33:35,051 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-09 08:33:35,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:33:35,051 INFO L85 PathProgramCache]: Analyzing trace with hash 369890675, now seen corresponding path program 12 times [2021-11-09 08:33:35,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:33:35,052 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767209126] [2021-11-09 08:33:35,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:33:35,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:33:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:33:35,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:33:35,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:33:35,152 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767209126] [2021-11-09 08:33:35,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767209126] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:33:35,152 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:33:35,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:33:35,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455263175] [2021-11-09 08:33:35,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 08:33:35,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:33:35,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:33:35,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:33:35,155 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2021-11-09 08:33:35,156 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 516 transitions, 9538 flow. Second operand has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:35,156 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:33:35,157 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2021-11-09 08:33:35,157 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:33:37,189 INFO L129 PetriNetUnfolder]: 787/8145 cut-off events. [2021-11-09 08:33:37,189 INFO L130 PetriNetUnfolder]: For 52656/100123 co-relation queries the response was YES. [2021-11-09 08:33:37,264 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20318 conditions, 8145 events. 787/8145 cut-off events. For 52656/100123 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 109050 event pairs, 128 based on Foata normal form. 176/7956 useless extension candidates. Maximal degree in co-relation 19431. Up to 624 conditions per place. [2021-11-09 08:33:37,293 INFO L132 encePairwiseOnDemand]: 191/206 looper letters, 301 selfloop transitions, 82 changer transitions 5/557 dead transitions. [2021-11-09 08:33:37,294 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 557 transitions, 11018 flow [2021-11-09 08:33:37,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 08:33:37,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-11-09 08:33:37,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 915 transitions. [2021-11-09 08:33:37,295 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8883495145631068 [2021-11-09 08:33:37,295 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 915 transitions. [2021-11-09 08:33:37,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 915 transitions. [2021-11-09 08:33:37,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:33:37,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 915 transitions. [2021-11-09 08:33:37,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:37,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:37,300 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:37,300 INFO L186 Difference]: Start difference. First operand has 319 places, 516 transitions, 9538 flow. Second operand 5 states and 915 transitions. [2021-11-09 08:33:37,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 557 transitions, 11018 flow [2021-11-09 08:33:37,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 557 transitions, 10967 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-11-09 08:33:37,664 INFO L242 Difference]: Finished difference. Result has 323 places, 521 transitions, 9850 flow [2021-11-09 08:33:37,664 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=9292, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9850, PETRI_PLACES=323, PETRI_TRANSITIONS=521} [2021-11-09 08:33:37,665 INFO L334 CegarLoopForPetriNet]: 186 programPoint places, 137 predicate places. [2021-11-09 08:33:37,665 INFO L470 AbstractCegarLoop]: Abstraction has has 323 places, 521 transitions, 9850 flow [2021-11-09 08:33:37,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:37,666 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:33:37,666 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:33:37,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-09 08:33:37,666 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-09 08:33:37,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:33:37,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1147264383, now seen corresponding path program 11 times [2021-11-09 08:33:37,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:33:37,667 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051052924] [2021-11-09 08:33:37,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:33:37,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:33:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:33:37,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:33:37,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:33:37,748 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051052924] [2021-11-09 08:33:37,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051052924] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:33:37,748 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:33:37,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:33:37,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228804001] [2021-11-09 08:33:37,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 08:33:37,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:33:37,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:33:37,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:33:37,752 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2021-11-09 08:33:37,753 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 521 transitions, 9850 flow. Second operand has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:37,753 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:33:37,753 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2021-11-09 08:33:37,753 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:33:39,748 INFO L129 PetriNetUnfolder]: 801/8200 cut-off events. [2021-11-09 08:33:39,749 INFO L130 PetriNetUnfolder]: For 53749/102269 co-relation queries the response was YES. [2021-11-09 08:33:39,859 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20715 conditions, 8200 events. 801/8200 cut-off events. For 53749/102269 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 109670 event pairs, 142 based on Foata normal form. 210/8044 useless extension candidates. Maximal degree in co-relation 19586. Up to 641 conditions per place. [2021-11-09 08:33:39,894 INFO L132 encePairwiseOnDemand]: 193/206 looper letters, 282 selfloop transitions, 96 changer transitions 5/552 dead transitions. [2021-11-09 08:33:39,894 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 552 transitions, 11262 flow [2021-11-09 08:33:39,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 08:33:39,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-11-09 08:33:39,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 922 transitions. [2021-11-09 08:33:39,897 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8951456310679612 [2021-11-09 08:33:39,898 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 922 transitions. [2021-11-09 08:33:39,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 922 transitions. [2021-11-09 08:33:39,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:33:39,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 922 transitions. [2021-11-09 08:33:39,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 184.4) internal successors, (922), 5 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:39,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:39,904 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:39,904 INFO L186 Difference]: Start difference. First operand has 323 places, 521 transitions, 9850 flow. Second operand 5 states and 922 transitions. [2021-11-09 08:33:39,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 552 transitions, 11262 flow [2021-11-09 08:33:40,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 552 transitions, 11178 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-11-09 08:33:40,238 INFO L242 Difference]: Finished difference. Result has 325 places, 521 transitions, 10024 flow [2021-11-09 08:33:40,239 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=9743, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=10024, PETRI_PLACES=325, PETRI_TRANSITIONS=521} [2021-11-09 08:33:40,239 INFO L334 CegarLoopForPetriNet]: 186 programPoint places, 139 predicate places. [2021-11-09 08:33:40,240 INFO L470 AbstractCegarLoop]: Abstraction has has 325 places, 521 transitions, 10024 flow [2021-11-09 08:33:40,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:40,240 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:33:40,241 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:33:40,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-09 08:33:40,241 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-09 08:33:40,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:33:40,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1286444623, now seen corresponding path program 12 times [2021-11-09 08:33:40,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:33:40,242 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390550121] [2021-11-09 08:33:40,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:33:40,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:33:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:33:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:33:40,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:33:40,352 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390550121] [2021-11-09 08:33:40,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390550121] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:33:40,353 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:33:40,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:33:40,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358307672] [2021-11-09 08:33:40,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 08:33:40,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:33:40,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:33:40,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:33:40,356 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2021-11-09 08:33:40,358 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 521 transitions, 10024 flow. Second operand has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:40,358 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:33:40,359 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2021-11-09 08:33:40,359 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:33:42,400 INFO L129 PetriNetUnfolder]: 793/8288 cut-off events. [2021-11-09 08:33:42,400 INFO L130 PetriNetUnfolder]: For 55035/103050 co-relation queries the response was YES. [2021-11-09 08:33:42,508 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20970 conditions, 8288 events. 793/8288 cut-off events. For 55035/103050 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 111254 event pairs, 126 based on Foata normal form. 151/8073 useless extension candidates. Maximal degree in co-relation 19908. Up to 662 conditions per place. [2021-11-09 08:33:42,841 INFO L132 encePairwiseOnDemand]: 193/206 looper letters, 301 selfloop transitions, 110 changer transitions 13/593 dead transitions. [2021-11-09 08:33:42,841 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 593 transitions, 12471 flow [2021-11-09 08:33:42,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-09 08:33:42,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-11-09 08:33:42,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1285 transitions. [2021-11-09 08:33:42,844 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.891123439667129 [2021-11-09 08:33:42,844 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1285 transitions. [2021-11-09 08:33:42,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1285 transitions. [2021-11-09 08:33:42,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:33:42,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1285 transitions. [2021-11-09 08:33:42,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 183.57142857142858) internal successors, (1285), 7 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:42,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:42,851 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:42,851 INFO L186 Difference]: Start difference. First operand has 325 places, 521 transitions, 10024 flow. Second operand 7 states and 1285 transitions. [2021-11-09 08:33:42,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 593 transitions, 12471 flow [2021-11-09 08:33:43,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 593 transitions, 12300 flow, removed 1 selfloop flow, removed 4 redundant places. [2021-11-09 08:33:43,165 INFO L242 Difference]: Finished difference. Result has 332 places, 534 transitions, 10497 flow [2021-11-09 08:33:43,167 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=9832, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10497, PETRI_PLACES=332, PETRI_TRANSITIONS=534} [2021-11-09 08:33:43,167 INFO L334 CegarLoopForPetriNet]: 186 programPoint places, 146 predicate places. [2021-11-09 08:33:43,167 INFO L470 AbstractCegarLoop]: Abstraction has has 332 places, 534 transitions, 10497 flow [2021-11-09 08:33:43,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:43,168 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:33:43,168 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:33:43,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-09 08:33:43,168 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-09 08:33:43,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:33:43,169 INFO L85 PathProgramCache]: Analyzing trace with hash -29818072, now seen corresponding path program 1 times [2021-11-09 08:33:43,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:33:43,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128351710] [2021-11-09 08:33:43,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:33:43,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:33:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:33:43,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:33:43,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:33:43,252 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128351710] [2021-11-09 08:33:43,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128351710] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:33:43,252 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:33:43,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:33:43,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534206339] [2021-11-09 08:33:43,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 08:33:43,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:33:43,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:33:43,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:33:43,255 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2021-11-09 08:33:43,256 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 534 transitions, 10497 flow. Second operand has 5 states, 5 states have (on average 175.2) internal successors, (876), 5 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:43,257 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:33:43,257 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2021-11-09 08:33:43,257 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:33:45,299 INFO L129 PetriNetUnfolder]: 800/8675 cut-off events. [2021-11-09 08:33:45,299 INFO L130 PetriNetUnfolder]: For 60194/120880 co-relation queries the response was YES. [2021-11-09 08:33:45,408 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21654 conditions, 8675 events. 800/8675 cut-off events. For 60194/120880 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 116990 event pairs, 118 based on Foata normal form. 246/8540 useless extension candidates. Maximal degree in co-relation 20989. Up to 668 conditions per place. [2021-11-09 08:33:45,440 INFO L132 encePairwiseOnDemand]: 192/206 looper letters, 311 selfloop transitions, 105 changer transitions 0/585 dead transitions. [2021-11-09 08:33:45,441 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 585 transitions, 12271 flow [2021-11-09 08:33:45,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 08:33:45,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-11-09 08:33:45,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 931 transitions. [2021-11-09 08:33:45,442 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.903883495145631 [2021-11-09 08:33:45,442 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 931 transitions. [2021-11-09 08:33:45,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 931 transitions. [2021-11-09 08:33:45,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:33:45,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 931 transitions. [2021-11-09 08:33:45,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 186.2) internal successors, (931), 5 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:45,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:45,446 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:45,446 INFO L186 Difference]: Start difference. First operand has 332 places, 534 transitions, 10497 flow. Second operand 5 states and 931 transitions. [2021-11-09 08:33:45,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 585 transitions, 12271 flow [2021-11-09 08:33:45,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 585 transitions, 12241 flow, removed 12 selfloop flow, removed 1 redundant places. [2021-11-09 08:33:45,872 INFO L242 Difference]: Finished difference. Result has 337 places, 536 transitions, 10804 flow [2021-11-09 08:33:45,873 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=10471, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=10804, PETRI_PLACES=337, PETRI_TRANSITIONS=536} [2021-11-09 08:33:45,873 INFO L334 CegarLoopForPetriNet]: 186 programPoint places, 151 predicate places. [2021-11-09 08:33:45,873 INFO L470 AbstractCegarLoop]: Abstraction has has 337 places, 536 transitions, 10804 flow [2021-11-09 08:33:45,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.2) internal successors, (876), 5 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:45,874 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:33:45,874 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:33:45,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-09 08:33:45,875 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-09 08:33:45,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:33:45,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1689531442, now seen corresponding path program 2 times [2021-11-09 08:33:45,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:33:45,876 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237775997] [2021-11-09 08:33:45,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:33:45,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:33:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:33:45,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:33:45,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:33:45,978 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237775997] [2021-11-09 08:33:45,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237775997] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:33:45,978 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:33:45,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:33:45,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076371360] [2021-11-09 08:33:45,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 08:33:45,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:33:45,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:33:45,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:33:45,981 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2021-11-09 08:33:45,982 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 536 transitions, 10804 flow. Second operand has 5 states, 5 states have (on average 175.2) internal successors, (876), 5 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:45,982 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:33:45,982 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2021-11-09 08:33:45,983 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:33:48,375 INFO L129 PetriNetUnfolder]: 762/8714 cut-off events. [2021-11-09 08:33:48,375 INFO L130 PetriNetUnfolder]: For 64960/129709 co-relation queries the response was YES. [2021-11-09 08:33:48,512 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21991 conditions, 8714 events. 762/8714 cut-off events. For 64960/129709 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 118152 event pairs, 106 based on Foata normal form. 237/8573 useless extension candidates. Maximal degree in co-relation 20911. Up to 663 conditions per place. [2021-11-09 08:33:48,555 INFO L132 encePairwiseOnDemand]: 186/206 looper letters, 349 selfloop transitions, 105 changer transitions 4/627 dead transitions. [2021-11-09 08:33:48,555 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 627 transitions, 13864 flow [2021-11-09 08:33:48,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 08:33:48,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-11-09 08:33:48,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 935 transitions. [2021-11-09 08:33:48,557 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9077669902912622 [2021-11-09 08:33:48,557 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 935 transitions. [2021-11-09 08:33:48,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 935 transitions. [2021-11-09 08:33:48,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:33:48,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 935 transitions. [2021-11-09 08:33:48,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:48,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:48,560 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:48,560 INFO L186 Difference]: Start difference. First operand has 337 places, 536 transitions, 10804 flow. Second operand 5 states and 935 transitions. [2021-11-09 08:33:48,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 627 transitions, 13864 flow [2021-11-09 08:33:48,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 627 transitions, 13766 flow, removed 8 selfloop flow, removed 2 redundant places. [2021-11-09 08:33:48,984 INFO L242 Difference]: Finished difference. Result has 343 places, 557 transitions, 11724 flow [2021-11-09 08:33:48,985 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=10722, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=11724, PETRI_PLACES=343, PETRI_TRANSITIONS=557} [2021-11-09 08:33:48,986 INFO L334 CegarLoopForPetriNet]: 186 programPoint places, 157 predicate places. [2021-11-09 08:33:48,986 INFO L470 AbstractCegarLoop]: Abstraction has has 343 places, 557 transitions, 11724 flow [2021-11-09 08:33:48,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.2) internal successors, (876), 5 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:48,986 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:33:48,987 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:33:48,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-09 08:33:48,987 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-09 08:33:48,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:33:48,988 INFO L85 PathProgramCache]: Analyzing trace with hash 137272522, now seen corresponding path program 1 times [2021-11-09 08:33:48,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:33:48,988 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888245715] [2021-11-09 08:33:48,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:33:48,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:33:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:33:49,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:33:49,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:33:49,183 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888245715] [2021-11-09 08:33:49,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888245715] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:33:49,183 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:33:49,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:33:49,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735497860] [2021-11-09 08:33:49,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 08:33:49,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:33:49,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:33:49,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:33:49,187 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2021-11-09 08:33:49,188 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 557 transitions, 11724 flow. Second operand has 5 states, 5 states have (on average 175.2) internal successors, (876), 5 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:49,188 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:33:49,188 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2021-11-09 08:33:49,188 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:33:51,652 INFO L129 PetriNetUnfolder]: 758/9028 cut-off events. [2021-11-09 08:33:51,652 INFO L130 PetriNetUnfolder]: For 70906/150970 co-relation queries the response was YES. [2021-11-09 08:33:51,760 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22867 conditions, 9028 events. 758/9028 cut-off events. For 70906/150970 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 123170 event pairs, 131 based on Foata normal form. 352/9004 useless extension candidates. Maximal degree in co-relation 21773. Up to 665 conditions per place. [2021-11-09 08:33:51,790 INFO L132 encePairwiseOnDemand]: 193/206 looper letters, 362 selfloop transitions, 99 changer transitions 0/630 dead transitions. [2021-11-09 08:33:51,791 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 630 transitions, 14258 flow [2021-11-09 08:33:51,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-09 08:33:51,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-11-09 08:33:51,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1293 transitions. [2021-11-09 08:33:51,795 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8966712898751734 [2021-11-09 08:33:51,795 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1293 transitions. [2021-11-09 08:33:51,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1293 transitions. [2021-11-09 08:33:51,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:33:51,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1293 transitions. [2021-11-09 08:33:51,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 184.71428571428572) internal successors, (1293), 7 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:51,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:51,799 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:51,799 INFO L186 Difference]: Start difference. First operand has 343 places, 557 transitions, 11724 flow. Second operand 7 states and 1293 transitions. [2021-11-09 08:33:51,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 630 transitions, 14258 flow [2021-11-09 08:33:52,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 630 transitions, 14226 flow, removed 16 selfloop flow, removed 0 redundant places. [2021-11-09 08:33:52,220 INFO L242 Difference]: Finished difference. Result has 354 places, 577 transitions, 12569 flow [2021-11-09 08:33:52,221 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=11706, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12569, PETRI_PLACES=354, PETRI_TRANSITIONS=577} [2021-11-09 08:33:52,221 INFO L334 CegarLoopForPetriNet]: 186 programPoint places, 168 predicate places. [2021-11-09 08:33:52,221 INFO L470 AbstractCegarLoop]: Abstraction has has 354 places, 577 transitions, 12569 flow [2021-11-09 08:33:52,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.2) internal successors, (876), 5 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:52,222 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:33:52,222 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:33:52,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-09 08:33:52,222 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-09 08:33:52,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:33:52,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1745004672, now seen corresponding path program 2 times [2021-11-09 08:33:52,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:33:52,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3803357] [2021-11-09 08:33:52,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:33:52,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:33:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:33:52,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:33:52,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:33:52,345 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3803357] [2021-11-09 08:33:52,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3803357] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:33:52,345 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:33:52,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:33:52,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601163071] [2021-11-09 08:33:52,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 08:33:52,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:33:52,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:33:52,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:33:52,348 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2021-11-09 08:33:52,349 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 577 transitions, 12569 flow. Second operand has 5 states, 5 states have (on average 175.2) internal successors, (876), 5 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:52,350 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:33:52,350 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2021-11-09 08:33:52,350 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:33:54,784 INFO L129 PetriNetUnfolder]: 780/9355 cut-off events. [2021-11-09 08:33:54,784 INFO L130 PetriNetUnfolder]: For 76525/160763 co-relation queries the response was YES. [2021-11-09 08:33:54,929 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24146 conditions, 9355 events. 780/9355 cut-off events. For 76525/160763 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 128489 event pairs, 101 based on Foata normal form. 256/9228 useless extension candidates. Maximal degree in co-relation 23042. Up to 687 conditions per place. [2021-11-09 08:33:54,966 INFO L132 encePairwiseOnDemand]: 186/206 looper letters, 399 selfloop transitions, 127 changer transitions 3/698 dead transitions. [2021-11-09 08:33:54,966 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 698 transitions, 16587 flow [2021-11-09 08:33:54,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 08:33:54,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-11-09 08:33:54,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 937 transitions. [2021-11-09 08:33:54,968 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9097087378640777 [2021-11-09 08:33:54,968 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 937 transitions. [2021-11-09 08:33:54,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 937 transitions. [2021-11-09 08:33:54,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:33:54,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 937 transitions. [2021-11-09 08:33:54,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 187.4) internal successors, (937), 5 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:54,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:54,971 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:54,971 INFO L186 Difference]: Start difference. First operand has 354 places, 577 transitions, 12569 flow. Second operand 5 states and 937 transitions. [2021-11-09 08:33:54,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 698 transitions, 16587 flow [2021-11-09 08:33:55,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 698 transitions, 16577 flow, removed 5 selfloop flow, removed 0 redundant places. [2021-11-09 08:33:55,855 INFO L242 Difference]: Finished difference. Result has 362 places, 617 transitions, 14141 flow [2021-11-09 08:33:55,856 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=12559, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=14141, PETRI_PLACES=362, PETRI_TRANSITIONS=617} [2021-11-09 08:33:55,860 INFO L334 CegarLoopForPetriNet]: 186 programPoint places, 176 predicate places. [2021-11-09 08:33:55,860 INFO L470 AbstractCegarLoop]: Abstraction has has 362 places, 617 transitions, 14141 flow [2021-11-09 08:33:55,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.2) internal successors, (876), 5 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:55,860 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:33:55,861 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:33:55,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-09 08:33:55,861 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-09 08:33:55,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:33:55,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1305035057, now seen corresponding path program 1 times [2021-11-09 08:33:55,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:33:55,862 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359179423] [2021-11-09 08:33:55,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:33:55,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:33:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:33:55,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:33:55,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:33:55,999 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359179423] [2021-11-09 08:33:55,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359179423] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:33:55,999 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:33:55,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-09 08:33:55,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737900379] [2021-11-09 08:33:56,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-09 08:33:56,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:33:56,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-09 08:33:56,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-09 08:33:56,003 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 206 [2021-11-09 08:33:56,004 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 617 transitions, 14141 flow. Second operand has 10 states, 10 states have (on average 171.2) internal successors, (1712), 10 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:33:56,005 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:33:56,005 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 206 [2021-11-09 08:33:56,005 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand