/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-nzb-file-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:08:18,807 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:08:18,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:08:18,838 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:08:18,838 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:08:18,841 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:08:18,843 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:08:18,846 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:08:18,849 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:08:18,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:08:18,853 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:08:18,855 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:08:18,855 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:08:18,857 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:08:18,857 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:08:18,858 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:08:18,860 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:08:18,860 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:08:18,862 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:08:18,866 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:08:18,868 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:08:18,869 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:08:18,870 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:08:18,871 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:08:18,873 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:08:18,873 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:08:18,873 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:08:18,874 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:08:18,875 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:08:18,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:08:18,875 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:08:18,877 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:08:18,878 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:08:18,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:08:18,879 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:08:18,879 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:08:18,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:08:18,880 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:08:18,880 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:08:18,880 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:08:18,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:08:18,881 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:08:18,905 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:08:18,905 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:08:18,907 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:08:18,907 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:08:18,907 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:08:18,907 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:08:18,908 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:08:18,908 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:08:18,908 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:08:18,908 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:08:18,908 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:08:18,908 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:08:18,909 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:08:18,909 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:08:18,909 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:08:18,909 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:08:18,909 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:08:18,909 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:08:18,909 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:08:18,909 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:08:18,909 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:08:18,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:08:18,910 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:08:18,910 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:08:18,910 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:08:18,910 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:08:18,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:08:18,910 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:08:18,910 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2022-12-06 05:08:19,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:08:19,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:08:19,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:08:19,213 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:08:19,214 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:08:19,215 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-nzb-file-trans.wvr.c [2022-12-06 05:08:20,162 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:08:20,312 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:08:20,313 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-trans.wvr.c [2022-12-06 05:08:20,318 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aba7b7e3e/a294566ef6344123b9a640c61545cbec/FLAG068f00c43 [2022-12-06 05:08:20,327 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aba7b7e3e/a294566ef6344123b9a640c61545cbec [2022-12-06 05:08:20,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:08:20,330 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:08:20,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:08:20,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:08:20,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:08:20,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:08:20" (1/1) ... [2022-12-06 05:08:20,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26267e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:08:20, skipping insertion in model container [2022-12-06 05:08:20,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:08:20" (1/1) ... [2022-12-06 05:08:20,338 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:08:20,354 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:08:20,527 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-trans.wvr.c[6450,6463] [2022-12-06 05:08:20,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:08:20,551 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:08:20,599 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-trans.wvr.c[6450,6463] [2022-12-06 05:08:20,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:08:20,619 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:08:20,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:08:20 WrapperNode [2022-12-06 05:08:20,620 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:08:20,621 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:08:20,621 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:08:20,622 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:08:20,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:08:20" (1/1) ... [2022-12-06 05:08:20,651 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:08:20" (1/1) ... [2022-12-06 05:08:20,686 INFO L138 Inliner]: procedures = 26, calls = 76, calls flagged for inlining = 28, calls inlined = 42, statements flattened = 574 [2022-12-06 05:08:20,686 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:08:20,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:08:20,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:08:20,688 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:08:20,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:08:20" (1/1) ... [2022-12-06 05:08:20,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:08:20" (1/1) ... [2022-12-06 05:08:20,702 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:08:20" (1/1) ... [2022-12-06 05:08:20,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:08:20" (1/1) ... [2022-12-06 05:08:20,720 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:08:20" (1/1) ... [2022-12-06 05:08:20,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:08:20" (1/1) ... [2022-12-06 05:08:20,730 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:08:20" (1/1) ... [2022-12-06 05:08:20,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:08:20" (1/1) ... [2022-12-06 05:08:20,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:08:20,735 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:08:20,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:08:20,736 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:08:20,736 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:08:20" (1/1) ... [2022-12-06 05:08:20,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:08:20,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:08:20,761 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:08:20,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:08:20,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:08:20,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:08:20,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:08:20,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:08:20,798 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:08:20,798 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:08:20,798 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:08:20,798 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:08:20,799 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:08:20,799 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:08:20,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:08:20,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:08:20,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:08:20,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:08:20,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:08:20,800 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:08:20,911 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:08:20,912 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:08:21,591 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:08:21,606 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:08:21,606 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 05:08:21,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:08:21 BoogieIcfgContainer [2022-12-06 05:08:21,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:08:21,610 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:08:21,610 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:08:21,612 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:08:21,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:08:20" (1/3) ... [2022-12-06 05:08:21,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bead9ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:08:21, skipping insertion in model container [2022-12-06 05:08:21,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:08:20" (2/3) ... [2022-12-06 05:08:21,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bead9ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:08:21, skipping insertion in model container [2022-12-06 05:08:21,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:08:21" (3/3) ... [2022-12-06 05:08:21,613 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-trans.wvr.c [2022-12-06 05:08:21,625 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:08:21,626 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:08:21,626 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:08:21,757 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 05:08:21,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 627 places, 690 transitions, 1404 flow [2022-12-06 05:08:22,054 INFO L130 PetriNetUnfolder]: 73/687 cut-off events. [2022-12-06 05:08:22,054 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:08:22,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 687 events. 73/687 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2360 event pairs, 0 based on Foata normal form. 0/613 useless extension candidates. Maximal degree in co-relation 507. Up to 2 conditions per place. [2022-12-06 05:08:22,072 INFO L82 GeneralOperation]: Start removeDead. Operand has 627 places, 690 transitions, 1404 flow [2022-12-06 05:08:22,084 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 614 places, 677 transitions, 1372 flow [2022-12-06 05:08:22,086 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:08:22,101 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 614 places, 677 transitions, 1372 flow [2022-12-06 05:08:22,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 614 places, 677 transitions, 1372 flow [2022-12-06 05:08:22,238 INFO L130 PetriNetUnfolder]: 73/677 cut-off events. [2022-12-06 05:08:22,238 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:08:22,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 677 events. 73/677 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2359 event pairs, 0 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 507. Up to 2 conditions per place. [2022-12-06 05:08:22,293 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 614 places, 677 transitions, 1372 flow [2022-12-06 05:08:22,293 INFO L188 LiptonReduction]: Number of co-enabled transitions 153384 [2022-12-06 05:08:46,589 INFO L203 LiptonReduction]: Total number of compositions: 632 [2022-12-06 05:08:46,600 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:08:46,620 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@38d32d85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:08:46,620 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 05:08:46,626 INFO L130 PetriNetUnfolder]: 13/48 cut-off events. [2022-12-06 05:08:46,627 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:08:46,627 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:08:46,627 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:08:46,627 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:08:46,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:08:46,631 INFO L85 PathProgramCache]: Analyzing trace with hash -759560692, now seen corresponding path program 1 times [2022-12-06 05:08:46,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:08:46,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412450491] [2022-12-06 05:08:46,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:46,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:08:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:47,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:08:47,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:08:47,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412450491] [2022-12-06 05:08:47,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412450491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:08:47,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:08:47,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:08:47,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571966852] [2022-12-06 05:08:47,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:08:47,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:08:47,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:08:47,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:08:47,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:08:47,026 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 05:08:47,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 49 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:08:47,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:08:47,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 05:08:47,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:08:47,525 INFO L130 PetriNetUnfolder]: 2776/3671 cut-off events. [2022-12-06 05:08:47,526 INFO L131 PetriNetUnfolder]: For 168/168 co-relation queries the response was YES. [2022-12-06 05:08:47,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7603 conditions, 3671 events. 2776/3671 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12995 event pairs, 1657 based on Foata normal form. 0/2552 useless extension candidates. Maximal degree in co-relation 7072. Up to 3669 conditions per place. [2022-12-06 05:08:47,542 INFO L137 encePairwiseOnDemand]: 42/49 looper letters, 46 selfloop transitions, 6 changer transitions 0/52 dead transitions. [2022-12-06 05:08:47,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 226 flow [2022-12-06 05:08:47,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:08:47,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:08:47,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-06 05:08:47,552 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3741496598639456 [2022-12-06 05:08:47,553 INFO L175 Difference]: Start difference. First operand has 46 places, 49 transitions, 116 flow. Second operand 3 states and 55 transitions. [2022-12-06 05:08:47,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 226 flow [2022-12-06 05:08:47,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 214 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 05:08:47,559 INFO L231 Difference]: Finished difference. Result has 43 places, 52 transitions, 136 flow [2022-12-06 05:08:47,561 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=43, PETRI_TRANSITIONS=52} [2022-12-06 05:08:47,564 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2022-12-06 05:08:47,564 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:08:47,565 INFO L89 Accepts]: Start accepts. Operand has 43 places, 52 transitions, 136 flow [2022-12-06 05:08:47,567 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:08:47,568 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:08:47,568 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 52 transitions, 136 flow [2022-12-06 05:08:47,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 52 transitions, 136 flow [2022-12-06 05:08:47,583 INFO L130 PetriNetUnfolder]: 13/52 cut-off events. [2022-12-06 05:08:47,583 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:08:47,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 52 events. 13/52 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 91 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 49. Up to 8 conditions per place. [2022-12-06 05:08:47,584 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 52 transitions, 136 flow [2022-12-06 05:08:47,584 INFO L188 LiptonReduction]: Number of co-enabled transitions 846 [2022-12-06 05:08:47,688 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:08:47,690 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-06 05:08:47,690 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 52 transitions, 136 flow [2022-12-06 05:08:47,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:08:47,690 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:08:47,691 INFO L213 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] [2022-12-06 05:08:47,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:08:47,694 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:08:47,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:08:47,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1800656135, now seen corresponding path program 1 times [2022-12-06 05:08:47,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:08:47,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338450344] [2022-12-06 05:08:47,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:47,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:08:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:47,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:08:47,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:08:47,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338450344] [2022-12-06 05:08:47,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338450344] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:08:47,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249947407] [2022-12-06 05:08:47,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:47,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:08:47,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:08:47,888 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:08:47,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 05:08:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:48,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 05:08:48,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:08:48,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:08:48,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:08:48,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:08:48,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249947407] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:08:48,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:08:48,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-12-06 05:08:48,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870135858] [2022-12-06 05:08:48,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:08:48,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:08:48,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:08:48,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:08:48,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:08:48,121 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 05:08:48,122 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 52 transitions, 136 flow. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:08:48,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:08:48,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 05:08:48,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:08:48,667 INFO L130 PetriNetUnfolder]: 2776/3680 cut-off events. [2022-12-06 05:08:48,667 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-06 05:08:48,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7497 conditions, 3680 events. 2776/3680 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13032 event pairs, 1657 based on Foata normal form. 6/2569 useless extension candidates. Maximal degree in co-relation 7448. Up to 3669 conditions per place. [2022-12-06 05:08:48,686 INFO L137 encePairwiseOnDemand]: 42/49 looper letters, 46 selfloop transitions, 15 changer transitions 0/61 dead transitions. [2022-12-06 05:08:48,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 61 transitions, 294 flow [2022-12-06 05:08:48,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:08:48,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:08:48,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-12-06 05:08:48,689 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23809523809523808 [2022-12-06 05:08:48,689 INFO L175 Difference]: Start difference. First operand has 43 places, 52 transitions, 136 flow. Second operand 6 states and 70 transitions. [2022-12-06 05:08:48,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 61 transitions, 294 flow [2022-12-06 05:08:48,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 61 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:08:48,691 INFO L231 Difference]: Finished difference. Result has 50 places, 61 transitions, 226 flow [2022-12-06 05:08:48,691 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=226, PETRI_PLACES=50, PETRI_TRANSITIONS=61} [2022-12-06 05:08:48,691 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 4 predicate places. [2022-12-06 05:08:48,692 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:08:48,692 INFO L89 Accepts]: Start accepts. Operand has 50 places, 61 transitions, 226 flow [2022-12-06 05:08:48,693 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:08:48,693 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:08:48,693 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 61 transitions, 226 flow [2022-12-06 05:08:48,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 61 transitions, 226 flow [2022-12-06 05:08:48,699 INFO L130 PetriNetUnfolder]: 13/61 cut-off events. [2022-12-06 05:08:48,700 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 05:08:48,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 61 events. 13/61 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 91 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 50. Up to 17 conditions per place. [2022-12-06 05:08:48,700 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 61 transitions, 226 flow [2022-12-06 05:08:48,700 INFO L188 LiptonReduction]: Number of co-enabled transitions 846 [2022-12-06 05:08:48,702 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:08:48,702 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 05:08:48,702 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 61 transitions, 226 flow [2022-12-06 05:08:48,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:08:48,703 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:08:48,703 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:08:48,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 05:08:48,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:08:48,908 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:08:48,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:08:48,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1416607028, now seen corresponding path program 2 times [2022-12-06 05:08:48,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:08:48,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510153738] [2022-12-06 05:08:48,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:48,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:08:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:49,029 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 05:08:49,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:08:49,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510153738] [2022-12-06 05:08:49,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510153738] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:08:49,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666147908] [2022-12-06 05:08:49,030 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:08:49,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:08:49,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:08:49,040 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:08:49,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 05:08:49,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-06 05:08:49,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:08:49,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:08:49,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:08:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-06 05:08:49,941 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:08:49,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666147908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:08:49,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:08:49,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2022-12-06 05:08:49,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271588272] [2022-12-06 05:08:49,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:08:49,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:08:49,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:08:49,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:08:49,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:08:49,943 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 05:08:49,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 61 transitions, 226 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:08:49,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:08:49,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 05:08:49,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:08:51,009 INFO L130 PetriNetUnfolder]: 3116/4199 cut-off events. [2022-12-06 05:08:51,010 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-06 05:08:51,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8577 conditions, 4199 events. 3116/4199 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 16257 event pairs, 1657 based on Foata normal form. 1/2930 useless extension candidates. Maximal degree in co-relation 8489. Up to 3599 conditions per place. [2022-12-06 05:08:51,024 INFO L137 encePairwiseOnDemand]: 45/49 looper letters, 99 selfloop transitions, 2 changer transitions 7/108 dead transitions. [2022-12-06 05:08:51,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 108 transitions, 548 flow [2022-12-06 05:08:51,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:08:51,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:08:51,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-12-06 05:08:51,025 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39591836734693875 [2022-12-06 05:08:51,026 INFO L175 Difference]: Start difference. First operand has 50 places, 61 transitions, 226 flow. Second operand 5 states and 97 transitions. [2022-12-06 05:08:51,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 108 transitions, 548 flow [2022-12-06 05:08:51,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 108 transitions, 524 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-06 05:08:51,028 INFO L231 Difference]: Finished difference. Result has 56 places, 62 transitions, 217 flow [2022-12-06 05:08:51,028 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=217, PETRI_PLACES=56, PETRI_TRANSITIONS=62} [2022-12-06 05:08:51,029 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 10 predicate places. [2022-12-06 05:08:51,029 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:08:51,029 INFO L89 Accepts]: Start accepts. Operand has 56 places, 62 transitions, 217 flow [2022-12-06 05:08:51,030 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:08:51,030 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:08:51,030 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 62 transitions, 217 flow [2022-12-06 05:08:51,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 62 transitions, 217 flow [2022-12-06 05:08:51,039 INFO L130 PetriNetUnfolder]: 12/78 cut-off events. [2022-12-06 05:08:51,055 INFO L131 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2022-12-06 05:08:51,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 78 events. 12/78 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 178 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 123. Up to 8 conditions per place. [2022-12-06 05:08:51,056 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 62 transitions, 217 flow [2022-12-06 05:08:51,056 INFO L188 LiptonReduction]: Number of co-enabled transitions 860 [2022-12-06 05:08:51,057 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:08:51,058 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 05:08:51,058 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 62 transitions, 217 flow [2022-12-06 05:08:51,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:08:51,058 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:08:51,058 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:08:51,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 05:08:51,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-12-06 05:08:51,278 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:08:51,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:08:51,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1329956240, now seen corresponding path program 3 times [2022-12-06 05:08:51,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:08:51,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644484857] [2022-12-06 05:08:51,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:51,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:08:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:51,417 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 05:08:51,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:08:51,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644484857] [2022-12-06 05:08:51,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644484857] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:08:51,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909839888] [2022-12-06 05:08:51,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 05:08:51,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:08:51,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:08:51,422 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:08:51,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 05:08:51,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-06 05:08:51,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:08:51,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:08:51,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:08:52,182 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-06 05:08:52,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:08:52,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909839888] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:08:52,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:08:52,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-06 05:08:52,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042294199] [2022-12-06 05:08:52,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:08:52,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:08:52,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:08:52,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:08:52,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:08:52,184 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 05:08:52,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 62 transitions, 217 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:08:52,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:08:52,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 05:08:52,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:08:53,133 INFO L130 PetriNetUnfolder]: 3316/4549 cut-off events. [2022-12-06 05:08:53,134 INFO L131 PetriNetUnfolder]: For 701/701 co-relation queries the response was YES. [2022-12-06 05:08:53,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9787 conditions, 4549 events. 3316/4549 cut-off events. For 701/701 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 18781 event pairs, 1919 based on Foata normal form. 1/3672 useless extension candidates. Maximal degree in co-relation 9755. Up to 4051 conditions per place. [2022-12-06 05:08:53,149 INFO L137 encePairwiseOnDemand]: 45/49 looper letters, 104 selfloop transitions, 3 changer transitions 7/114 dead transitions. [2022-12-06 05:08:53,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 114 transitions, 571 flow [2022-12-06 05:08:53,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:08:53,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:08:53,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-12-06 05:08:53,150 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4163265306122449 [2022-12-06 05:08:53,150 INFO L175 Difference]: Start difference. First operand has 55 places, 62 transitions, 217 flow. Second operand 5 states and 102 transitions. [2022-12-06 05:08:53,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 114 transitions, 571 flow [2022-12-06 05:08:53,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 114 transitions, 562 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 05:08:53,154 INFO L231 Difference]: Finished difference. Result has 60 places, 63 transitions, 234 flow [2022-12-06 05:08:53,154 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=234, PETRI_PLACES=60, PETRI_TRANSITIONS=63} [2022-12-06 05:08:53,154 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 14 predicate places. [2022-12-06 05:08:53,155 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:08:53,155 INFO L89 Accepts]: Start accepts. Operand has 60 places, 63 transitions, 234 flow [2022-12-06 05:08:53,156 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:08:53,156 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:08:53,156 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 63 transitions, 234 flow [2022-12-06 05:08:53,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 63 transitions, 234 flow [2022-12-06 05:08:53,166 INFO L130 PetriNetUnfolder]: 11/100 cut-off events. [2022-12-06 05:08:53,166 INFO L131 PetriNetUnfolder]: For 28/30 co-relation queries the response was YES. [2022-12-06 05:08:53,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 100 events. 11/100 cut-off events. For 28/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 314 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 157. Up to 8 conditions per place. [2022-12-06 05:08:53,166 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 63 transitions, 234 flow [2022-12-06 05:08:53,167 INFO L188 LiptonReduction]: Number of co-enabled transitions 892 [2022-12-06 05:08:53,168 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:08:53,168 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 05:08:53,169 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 63 transitions, 234 flow [2022-12-06 05:08:53,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:08:53,169 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:08:53,169 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:08:53,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 05:08:53,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:08:53,373 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:08:53,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:08:53,374 INFO L85 PathProgramCache]: Analyzing trace with hash 2032434040, now seen corresponding path program 4 times [2022-12-06 05:08:53,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:08:53,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606925080] [2022-12-06 05:08:53,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:53,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:08:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:53,541 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 05:08:53,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:08:53,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606925080] [2022-12-06 05:08:53,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606925080] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:08:53,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424748981] [2022-12-06 05:08:53,542 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 05:08:53,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:08:53,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:08:53,543 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:08:53,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 05:08:53,690 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 05:08:53,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:08:53,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:08:53,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:08:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 05:08:53,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:08:53,787 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 05:08:53,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424748981] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:08:53,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:08:53,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-06 05:08:53,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18030687] [2022-12-06 05:08:53,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:08:53,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:08:53,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:08:53,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:08:53,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2022-12-06 05:08:53,788 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 05:08:53,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 63 transitions, 234 flow. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:08:53,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:08:53,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 05:08:53,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:08:54,384 INFO L130 PetriNetUnfolder]: 3315/4544 cut-off events. [2022-12-06 05:08:54,384 INFO L131 PetriNetUnfolder]: For 1833/1833 co-relation queries the response was YES. [2022-12-06 05:08:54,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10297 conditions, 4544 events. 3315/4544 cut-off events. For 1833/1833 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 18486 event pairs, 2136 based on Foata normal form. 1/3667 useless extension candidates. Maximal degree in co-relation 10263. Up to 4530 conditions per place. [2022-12-06 05:08:54,399 INFO L137 encePairwiseOnDemand]: 42/49 looper letters, 48 selfloop transitions, 18 changer transitions 0/66 dead transitions. [2022-12-06 05:08:54,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 66 transitions, 384 flow [2022-12-06 05:08:54,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:08:54,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:08:54,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-12-06 05:08:54,400 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19533527696793002 [2022-12-06 05:08:54,400 INFO L175 Difference]: Start difference. First operand has 59 places, 63 transitions, 234 flow. Second operand 7 states and 67 transitions. [2022-12-06 05:08:54,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 66 transitions, 384 flow [2022-12-06 05:08:54,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 66 transitions, 378 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 05:08:54,403 INFO L231 Difference]: Finished difference. Result has 64 places, 66 transitions, 296 flow [2022-12-06 05:08:54,403 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=296, PETRI_PLACES=64, PETRI_TRANSITIONS=66} [2022-12-06 05:08:54,404 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 18 predicate places. [2022-12-06 05:08:54,404 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:08:54,404 INFO L89 Accepts]: Start accepts. Operand has 64 places, 66 transitions, 296 flow [2022-12-06 05:08:54,405 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:08:54,405 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:08:54,405 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 66 transitions, 296 flow [2022-12-06 05:08:54,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 66 transitions, 296 flow [2022-12-06 05:08:54,414 INFO L130 PetriNetUnfolder]: 11/103 cut-off events. [2022-12-06 05:08:54,414 INFO L131 PetriNetUnfolder]: For 20/22 co-relation queries the response was YES. [2022-12-06 05:08:54,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 103 events. 11/103 cut-off events. For 20/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 338 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 171. Up to 11 conditions per place. [2022-12-06 05:08:54,415 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 66 transitions, 296 flow [2022-12-06 05:08:54,415 INFO L188 LiptonReduction]: Number of co-enabled transitions 892 [2022-12-06 05:08:54,429 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:08:54,429 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 05:08:54,430 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 66 transitions, 296 flow [2022-12-06 05:08:54,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:08:54,430 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:08:54,430 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:08:54,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 05:08:54,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:08:54,634 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:08:54,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:08:54,635 INFO L85 PathProgramCache]: Analyzing trace with hash 877729935, now seen corresponding path program 5 times [2022-12-06 05:08:54,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:08:54,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300732554] [2022-12-06 05:08:54,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:54,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:08:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:55,217 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:08:55,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:08:55,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300732554] [2022-12-06 05:08:55,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300732554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:08:55,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:08:55,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:08:55,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122680922] [2022-12-06 05:08:55,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:08:55,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:08:55,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:08:55,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:08:55,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:08:55,220 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 05:08:55,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 66 transitions, 296 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:08:55,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:08:55,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 05:08:55,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:08:56,752 INFO L130 PetriNetUnfolder]: 7538/10284 cut-off events. [2022-12-06 05:08:56,752 INFO L131 PetriNetUnfolder]: For 1752/1752 co-relation queries the response was YES. [2022-12-06 05:08:56,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22102 conditions, 10284 events. 7538/10284 cut-off events. For 1752/1752 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 50167 event pairs, 1302 based on Foata normal form. 1/8013 useless extension candidates. Maximal degree in co-relation 21989. Up to 3645 conditions per place. [2022-12-06 05:08:56,788 INFO L137 encePairwiseOnDemand]: 36/49 looper letters, 142 selfloop transitions, 27 changer transitions 1/170 dead transitions. [2022-12-06 05:08:56,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 170 transitions, 900 flow [2022-12-06 05:08:56,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:08:56,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:08:56,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 151 transitions. [2022-12-06 05:08:56,790 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6163265306122448 [2022-12-06 05:08:56,790 INFO L175 Difference]: Start difference. First operand has 64 places, 66 transitions, 296 flow. Second operand 5 states and 151 transitions. [2022-12-06 05:08:56,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 170 transitions, 900 flow [2022-12-06 05:08:56,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 170 transitions, 864 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-06 05:08:56,797 INFO L231 Difference]: Finished difference. Result has 67 places, 92 transitions, 478 flow [2022-12-06 05:08:56,797 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=478, PETRI_PLACES=67, PETRI_TRANSITIONS=92} [2022-12-06 05:08:56,797 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 21 predicate places. [2022-12-06 05:08:56,798 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:08:56,798 INFO L89 Accepts]: Start accepts. Operand has 67 places, 92 transitions, 478 flow [2022-12-06 05:08:56,799 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:08:56,799 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:08:56,799 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 92 transitions, 478 flow [2022-12-06 05:08:56,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 92 transitions, 478 flow [2022-12-06 05:08:56,867 INFO L130 PetriNetUnfolder]: 235/583 cut-off events. [2022-12-06 05:08:56,867 INFO L131 PetriNetUnfolder]: For 342/390 co-relation queries the response was YES. [2022-12-06 05:08:56,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 583 events. 235/583 cut-off events. For 342/390 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3557 event pairs, 9 based on Foata normal form. 6/473 useless extension candidates. Maximal degree in co-relation 1188. Up to 169 conditions per place. [2022-12-06 05:08:56,872 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 92 transitions, 478 flow [2022-12-06 05:08:56,872 INFO L188 LiptonReduction]: Number of co-enabled transitions 1558 [2022-12-06 05:08:56,875 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [3007] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse6 (= (mod v_~is_null_5~0_In_28 256) 0)) (.cse7 (= (mod v_~is_null_1~0_In_26 256) 0))) (let ((.cse1 (not .cse7)) (.cse0 (= |v_thread1Thread1of1ForFork1_#res#1.base_Out_38| 0)) (.cse2 (not .cse6)) (.cse4 (= |v_thread1Thread1of1ForFork1_#res#1.offset_Out_38| 0)) (.cse3 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_78| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|)) (.cse5 (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_In_5| 256) 0))) (or (and .cse0 (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20| |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|) .cse1 (<= |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42| 2147483647) (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|)) .cse2 .cse3 .cse4 (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20| v_~get_subject_7~0_In_11) .cse5 (= (+ |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32| |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|) |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|) (= v_~get_subject_3~0_In_11 |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20|) (= v_~result_12~0_Out_86 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|)) (and (or (and .cse0 .cse1 (= v_~result_12~0_Out_86 1005) .cse4 .cse6) (and .cse0 .cse2 .cse4 (= (+ v_~result_12~0_Out_86 995) 0) .cse7)) (= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32| |v_thread1Thread1of1ForFork1_minus_~b#1_In_21|) (= (ite (not (and .cse7 .cse6)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|) (= |v_thread1Thread1of1ForFork1_minus_#res#1_In_6| |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_In_7| |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20|) .cse3 .cse5 (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_In_9| |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20|) (= |v_thread1Thread1of1ForFork1_minus_~a#1_In_21| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|))))) InVars {~get_subject_3~0=v_~get_subject_3~0_In_11, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_In_9|, ~is_null_5~0=v_~is_null_5~0_In_28, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_In_7|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_In_21|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_In_6|, ~is_null_1~0=v_~is_null_1~0_In_26, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_In_5|, ~get_subject_7~0=v_~get_subject_7~0_In_11, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_In_21|} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|, thread1Thread1of1ForFork1_#t~ite22#1=|v_thread1Thread1of1ForFork1_#t~ite22#1_Out_28|, thread1Thread1of1ForFork1_#t~ret20#1=|v_thread1Thread1of1ForFork1_#t~ret20#1_Out_20|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20|, ~get_subject_3~0=v_~get_subject_3~0_In_11, ~is_null_5~0=v_~is_null_5~0_In_28, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|, ~is_null_1~0=v_~is_null_1~0_In_26, thread1Thread1of1ForFork1_#t~ite21#1=|v_thread1Thread1of1ForFork1_#t~ite21#1_Out_26|, ~get_subject_7~0=v_~get_subject_7~0_In_11, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_Out_38|, ~result_12~0=v_~result_12~0_Out_86, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_Out_38|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_78|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ite22#1, thread1Thread1of1ForFork1_#t~ret20#1, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#t~ite21#1, thread1Thread1of1ForFork1_#res#1.offset, ~result_12~0, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [3011] L108-4-->thread3EXIT: Formula: (let ((.cse1 (= (mod v_~break_20~0_In_38 256) 0))) (let ((.cse0 (= (mod |v_thread3Thread1of1ForFork0_#t~nondet46#1_In_5| 256) 0)) (.cse3 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_34| 0)) (.cse4 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_34| 0)) (.cse2 (ite (not (and .cse1 (< v_~i_19~0_In_50 5))) 1 0)) (.cse5 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_62| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_84|))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_26| |v_thread3Thread1of1ForFork0_minus_~b#1_In_18|) .cse0 (not .cse1) (= v_~result_18~0_Out_90 v_~result_18~0_In_25) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_8| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_22|) (= .cse2 |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_62|) .cse3 .cse4 .cse5 (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_26| |v_thread3Thread1of1ForFork0_minus_~a#1_In_20|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_10| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_22|) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_38| |v_thread3Thread1of1ForFork0_minus_#res#1_In_7|)) (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_26| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_26| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_38|)) .cse0 .cse1 (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_38| 2147483648)) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_38| 2147483647) (= v_~result_18~0_Out_90 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_38|) .cse3 .cse4 (not (= .cse2 0)) (= (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_26| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_26| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_26|)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_62|) .cse5 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_26| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_22|) (= v_~filename_0~0_In_12 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_22|) (= v_~filename_8~0_In_13 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_22|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_26| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_22|))))) InVars {~filename_8~0=v_~filename_8~0_In_13, ~break_20~0=v_~break_20~0_In_38, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_7|, ~filename_0~0=v_~filename_0~0_In_12, ~result_18~0=v_~result_18~0_In_25, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_18|, thread3Thread1of1ForFork0_#t~nondet46#1=|v_thread3Thread1of1ForFork0_#t~nondet46#1_In_5|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_20|, ~i_19~0=v_~i_19~0_In_50, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_10|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_8|} OutVars{thread3Thread1of1ForFork0_#t~ite63#1=|v_thread3Thread1of1ForFork0_#t~ite63#1_Out_22|, thread3Thread1of1ForFork0_#t~ret62#1=|v_thread3Thread1of1ForFork0_#t~ret62#1_Out_18|, ~break_20~0=v_~break_20~0_In_38, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_62|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_84|, ~filename_0~0=v_~filename_0~0_In_12, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_34|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_26|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_22|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_34|, ~filename_8~0=v_~filename_8~0_In_13, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_38|, ~result_18~0=v_~result_18~0_Out_90, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_26|, ~i_19~0=v_~i_19~0_In_50, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_22|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~ite63#1, thread3Thread1of1ForFork0_#t~ret62#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, ~result_18~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~nondet46#1, thread3Thread1of1ForFork0_minus_#in~a#1] [2022-12-06 05:08:57,609 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [3007] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse6 (= (mod v_~is_null_5~0_In_28 256) 0)) (.cse7 (= (mod v_~is_null_1~0_In_26 256) 0))) (let ((.cse1 (not .cse7)) (.cse0 (= |v_thread1Thread1of1ForFork1_#res#1.base_Out_38| 0)) (.cse2 (not .cse6)) (.cse4 (= |v_thread1Thread1of1ForFork1_#res#1.offset_Out_38| 0)) (.cse3 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_78| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|)) (.cse5 (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_In_5| 256) 0))) (or (and .cse0 (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20| |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|) .cse1 (<= |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42| 2147483647) (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|)) .cse2 .cse3 .cse4 (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20| v_~get_subject_7~0_In_11) .cse5 (= (+ |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32| |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|) |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|) (= v_~get_subject_3~0_In_11 |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20|) (= v_~result_12~0_Out_86 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|)) (and (or (and .cse0 .cse1 (= v_~result_12~0_Out_86 1005) .cse4 .cse6) (and .cse0 .cse2 .cse4 (= (+ v_~result_12~0_Out_86 995) 0) .cse7)) (= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32| |v_thread1Thread1of1ForFork1_minus_~b#1_In_21|) (= (ite (not (and .cse7 .cse6)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|) (= |v_thread1Thread1of1ForFork1_minus_#res#1_In_6| |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_In_7| |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20|) .cse3 .cse5 (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_In_9| |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20|) (= |v_thread1Thread1of1ForFork1_minus_~a#1_In_21| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|))))) InVars {~get_subject_3~0=v_~get_subject_3~0_In_11, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_In_9|, ~is_null_5~0=v_~is_null_5~0_In_28, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_In_7|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_In_21|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_In_6|, ~is_null_1~0=v_~is_null_1~0_In_26, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_In_5|, ~get_subject_7~0=v_~get_subject_7~0_In_11, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_In_21|} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|, thread1Thread1of1ForFork1_#t~ite22#1=|v_thread1Thread1of1ForFork1_#t~ite22#1_Out_28|, thread1Thread1of1ForFork1_#t~ret20#1=|v_thread1Thread1of1ForFork1_#t~ret20#1_Out_20|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20|, ~get_subject_3~0=v_~get_subject_3~0_In_11, ~is_null_5~0=v_~is_null_5~0_In_28, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|, ~is_null_1~0=v_~is_null_1~0_In_26, thread1Thread1of1ForFork1_#t~ite21#1=|v_thread1Thread1of1ForFork1_#t~ite21#1_Out_26|, ~get_subject_7~0=v_~get_subject_7~0_In_11, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_Out_38|, ~result_12~0=v_~result_12~0_Out_86, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_Out_38|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_78|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ite22#1, thread1Thread1of1ForFork1_#t~ret20#1, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#t~ite21#1, thread1Thread1of1ForFork1_#res#1.offset, ~result_12~0, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [3004] L108-4-->L108-4: Formula: (let ((.cse2 (mod v_~break_20~0_235 256)) (.cse8 (mod v_~break_20~0_234 256)) (.cse23 (select (select |v_#memory_int_528| v_~ends_with_2~0.base_141) (+ v_~i_19~0_213 v_~ends_with_2~0.offset_141)))) (let ((.cse7 (= (mod .cse23 256) 0)) (.cse9 (= 0 .cse8)) (.cse0 (= .cse2 0))) (let ((.cse5 (not .cse0)) (.cse10 (not |v_thread3Thread1of1ForFork0_#t~short58#1_69|)) (.cse11 (not .cse9)) (.cse4 (select (select |v_#memory_int_528| v_~ends_with_10~0.base_135) (+ v_~i_19~0_213 v_~ends_with_10~0.offset_135))) (.cse14 (mod v_~break_20~0_236 256)) (.cse12 (not |v_thread3Thread1of1ForFork0_#t~short49#1_59|)) (.cse6 (not .cse7))) (and (not (= (mod |v_thread3Thread1of1ForFork0_#t~nondet46#1_52| 256) 0)) (let ((.cse1 (= (+ v_~i_19~0_213 1) v_~i_19~0_212))) (or (and |v_thread3Thread1of1ForFork0_#t~short60#1_84| .cse0 .cse1 (= (ite (= (ite |v_thread3Thread1of1ForFork0_#t~short60#1_86| 1 .cse2) 0) 0 1) v_~break_20~0_233) (let ((.cse3 (= 0 (mod .cse4 256)))) (or (and (not .cse3) |v_thread3Thread1of1ForFork0_#t~short60#1_86|) (and .cse3 (not |v_thread3Thread1of1ForFork0_#t~short60#1_86|))))) (and (= (ite (= (ite |v_thread3Thread1of1ForFork0_#t~short60#1_85| 1 .cse2) 0) 0 1) v_~break_20~0_233) .cse5 .cse1 (not |v_thread3Thread1of1ForFork0_#t~short60#1_85|)))) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_257| 0)) (or (and (or (and |v_thread3Thread1of1ForFork0_#t~short56#1_75| .cse6) (and .cse7 (not |v_thread3Thread1of1ForFork0_#t~short56#1_75|))) |v_thread3Thread1of1ForFork0_#t~short56#1_74| (= (ite (= (ite |v_thread3Thread1of1ForFork0_#t~short56#1_75| 1 .cse8) 0) 0 1) v_~break_20~0_235) .cse9 (or (and |v_thread3Thread1of1ForFork0_#t~short58#1_69| .cse0) (and .cse10 .cse5))) (and (= (ite (= (ite |v_thread3Thread1of1ForFork0_#t~short56#1_73| 1 .cse8) 0) 0 1) v_~break_20~0_235) .cse11 .cse10 (not |v_thread3Thread1of1ForFork0_#t~short56#1_73|))) (or (and (= |v_thread3Thread1of1ForFork0_#t~short49#1_59| |v_thread3Thread1of1ForFork0_#t~short49#1_58|) (= |v_thread3Thread1of1ForFork0_#t~mem48#1_33| |v_thread3Thread1of1ForFork0_#t~mem48#1_31|) .cse12 (= (ite |v_thread3Thread1of1ForFork0_#t~short49#1_59| 0 v_~result_18~0_233) v_~result_18~0_231)) (and (= .cse4 |v_thread3Thread1of1ForFork0_#t~mem48#1_31|) |v_thread3Thread1of1ForFork0_#t~short49#1_59| (let ((.cse13 (= (mod |v_thread3Thread1of1ForFork0_#t~mem48#1_31| 256) 0))) (or (and (not |v_thread3Thread1of1ForFork0_#t~short49#1_58|) .cse13) (and |v_thread3Thread1of1ForFork0_#t~short49#1_58| (not .cse13)))) (= v_~result_18~0_231 (ite |v_thread3Thread1of1ForFork0_#t~short49#1_58| 0 v_~result_18~0_233)))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_177| (ite (and (= .cse14 0) (< v_~i_19~0_213 5)) 1 0)) (let ((.cse16 (+ v_~i_19~0_213 1000))) (or (and (let ((.cse15 (= (mod |v_thread3Thread1of1ForFork0_#t~mem57#1_39| 256) 0))) (or (and |v_thread3Thread1of1ForFork0_#t~short58#1_70| (not .cse15)) (and .cse15 (not |v_thread3Thread1of1ForFork0_#t~short58#1_70|)))) |v_thread3Thread1of1ForFork0_#t~short58#1_69| (= .cse4 |v_thread3Thread1of1ForFork0_#t~mem57#1_39|) (= (ite |v_thread3Thread1of1ForFork0_#t~short58#1_70| .cse16 v_~result_18~0_232) v_~result_18~0_230)) (and (= |v_thread3Thread1of1ForFork0_#t~mem57#1_39| |v_thread3Thread1of1ForFork0_#t~mem57#1_41|) .cse10 (= |v_thread3Thread1of1ForFork0_#t~short58#1_69| |v_thread3Thread1of1ForFork0_#t~short58#1_70|) (= (ite |v_thread3Thread1of1ForFork0_#t~short58#1_69| .cse16 v_~result_18~0_232) v_~result_18~0_230)))) (let ((.cse17 (+ v_~i_19~0_213 (- 1000)))) (or (and (not |v_thread3Thread1of1ForFork0_#t~short54#1_81|) .cse11 (= (ite |v_thread3Thread1of1ForFork0_#t~short54#1_81| .cse17 v_~result_18~0_231) v_~result_18~0_232)) (and |v_thread3Thread1of1ForFork0_#t~short54#1_80| (= (ite |v_thread3Thread1of1ForFork0_#t~short54#1_82| .cse17 v_~result_18~0_231) v_~result_18~0_232) .cse9 (or (and .cse7 (not |v_thread3Thread1of1ForFork0_#t~short54#1_82|)) (and |v_thread3Thread1of1ForFork0_#t~short54#1_82| .cse6))))) (let ((.cse18 (= (ite (= (ite |v_thread3Thread1of1ForFork0_#t~short52#1_74| 1 .cse14) 0) 0 1) v_~break_20~0_234)) (.cse21 (= (mod |v_thread3Thread1of1ForFork0_#t~mem50#1_42| 256) 0)) (.cse22 (= .cse23 |v_thread3Thread1of1ForFork0_#t~mem50#1_42|)) (.cse20 (not |v_thread3Thread1of1ForFork0_#t~short52#1_74|))) (or (and .cse18 (let ((.cse19 (= (mod |v_thread3Thread1of1ForFork0_#t~mem51#1_44| 256) 0))) (or (and (not .cse19) |v_thread3Thread1of1ForFork0_#t~short52#1_74|) (and .cse19 .cse20))) |v_thread3Thread1of1ForFork0_#t~short52#1_75| (not .cse21) (= .cse4 |v_thread3Thread1of1ForFork0_#t~mem51#1_44|) .cse22) (and (= |v_thread3Thread1of1ForFork0_#t~mem51#1_45| |v_thread3Thread1of1ForFork0_#t~mem51#1_44|) .cse18 .cse21 .cse22 .cse20))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_257| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_177|) (or (and .cse7 .cse12) (and |v_thread3Thread1of1ForFork0_#t~short49#1_59| .cse6)))))) InVars {~ends_with_10~0.offset=v_~ends_with_10~0.offset_135, ~break_20~0=v_~break_20~0_236, ~ends_with_10~0.base=v_~ends_with_10~0.base_135, thread3Thread1of1ForFork0_#t~mem48#1=|v_thread3Thread1of1ForFork0_#t~mem48#1_33|, ~result_18~0=v_~result_18~0_233, #memory_int=|v_#memory_int_528|, thread3Thread1of1ForFork0_#t~mem51#1=|v_thread3Thread1of1ForFork0_#t~mem51#1_45|, thread3Thread1of1ForFork0_#t~mem57#1=|v_thread3Thread1of1ForFork0_#t~mem57#1_41|, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_141, ~ends_with_2~0.base=v_~ends_with_2~0.base_141, thread3Thread1of1ForFork0_#t~nondet46#1=|v_thread3Thread1of1ForFork0_#t~nondet46#1_52|, ~i_19~0=v_~i_19~0_213} OutVars{~ends_with_10~0.offset=v_~ends_with_10~0.offset_135, thread3Thread1of1ForFork0_#t~short58#1=|v_thread3Thread1of1ForFork0_#t~short58#1_68|, thread3Thread1of1ForFork0_#t~short49#1=|v_thread3Thread1of1ForFork0_#t~short49#1_57|, thread3Thread1of1ForFork0_#t~mem59#1=|v_thread3Thread1of1ForFork0_#t~mem59#1_31|, thread3Thread1of1ForFork0_#t~short54#1=|v_thread3Thread1of1ForFork0_#t~short54#1_79|, ~ends_with_10~0.base=v_~ends_with_10~0.base_135, thread3Thread1of1ForFork0_#t~mem55#1=|v_thread3Thread1of1ForFork0_#t~mem55#1_31|, ~break_20~0=v_~break_20~0_233, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_177|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_257|, thread3Thread1of1ForFork0_#t~post61#1=|v_thread3Thread1of1ForFork0_#t~post61#1_27|, thread3Thread1of1ForFork0_#t~mem47#1=|v_thread3Thread1of1ForFork0_#t~mem47#1_35|, thread3Thread1of1ForFork0_#t~mem50#1=|v_thread3Thread1of1ForFork0_#t~mem50#1_41|, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_141, thread3Thread1of1ForFork0_#t~short60#1=|v_thread3Thread1of1ForFork0_#t~short60#1_83|, ~result_18~0=v_~result_18~0_230, #memory_int=|v_#memory_int_528|, thread3Thread1of1ForFork0_#t~short56#1=|v_thread3Thread1of1ForFork0_#t~short56#1_72|, ~ends_with_2~0.base=v_~ends_with_2~0.base_141, thread3Thread1of1ForFork0_#t~short52#1=|v_thread3Thread1of1ForFork0_#t~short52#1_73|, ~i_19~0=v_~i_19~0_212, thread3Thread1of1ForFork0_#t~mem53#1=|v_thread3Thread1of1ForFork0_#t~mem53#1_29|} AuxVars[|v_thread3Thread1of1ForFork0_#t~short60#1_85|, |v_thread3Thread1of1ForFork0_#t~short56#1_74|, |v_thread3Thread1of1ForFork0_#t~short56#1_73|, |v_thread3Thread1of1ForFork0_#t~short60#1_86|, |v_thread3Thread1of1ForFork0_#t~short60#1_84|, |v_thread3Thread1of1ForFork0_#t~short56#1_75|, |v_thread3Thread1of1ForFork0_#t~mem50#1_42|, v_~break_20~0_234, v_~break_20~0_235, v_~result_18~0_232, |v_thread3Thread1of1ForFork0_#t~short49#1_59|, |v_thread3Thread1of1ForFork0_#t~mem57#1_39|, |v_thread3Thread1of1ForFork0_#t~short49#1_58|, |v_thread3Thread1of1ForFork0_#t~short58#1_70|, |v_thread3Thread1of1ForFork0_#t~mem51#1_44|, |v_thread3Thread1of1ForFork0_#t~mem48#1_31|, |v_thread3Thread1of1ForFork0_#t~short52#1_75|, |v_thread3Thread1of1ForFork0_#t~short54#1_80|, |v_thread3Thread1of1ForFork0_#t~short54#1_81|, |v_thread3Thread1of1ForFork0_#t~short52#1_74|, |v_thread3Thread1of1ForFork0_#t~short58#1_69|, |v_thread3Thread1of1ForFork0_#t~short54#1_82|, v_~result_18~0_231] AssignedVars[~break_20~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~short58#1, thread3Thread1of1ForFork0_#t~post61#1, thread3Thread1of1ForFork0_#t~mem47#1, thread3Thread1of1ForFork0_#t~mem50#1, thread3Thread1of1ForFork0_#t~short49#1, thread3Thread1of1ForFork0_#t~mem59#1, thread3Thread1of1ForFork0_#t~short54#1, thread3Thread1of1ForFork0_#t~short60#1, thread3Thread1of1ForFork0_#t~mem48#1, ~result_18~0, thread3Thread1of1ForFork0_#t~short56#1, thread3Thread1of1ForFork0_#t~mem51#1, thread3Thread1of1ForFork0_#t~mem57#1, thread3Thread1of1ForFork0_#t~nondet46#1, thread3Thread1of1ForFork0_#t~mem55#1, thread3Thread1of1ForFork0_#t~short52#1, ~i_19~0, thread3Thread1of1ForFork0_#t~mem53#1] [2022-12-06 05:08:59,410 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:08:59,411 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2613 [2022-12-06 05:08:59,411 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 92 transitions, 494 flow [2022-12-06 05:08:59,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:08:59,411 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:08:59,411 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:08:59,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:08:59,412 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:08:59,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:08:59,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1040886035, now seen corresponding path program 6 times [2022-12-06 05:08:59,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:08:59,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937413482] [2022-12-06 05:08:59,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:59,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:08:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:59,970 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:08:59,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:08:59,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937413482] [2022-12-06 05:08:59,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937413482] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:08:59,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:08:59,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:08:59,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129327814] [2022-12-06 05:08:59,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:08:59,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:08:59,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:08:59,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:08:59,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:08:59,972 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 05:08:59,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 92 transitions, 494 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:08:59,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:08:59,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 05:08:59,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:09:01,587 INFO L130 PetriNetUnfolder]: 7639/10464 cut-off events. [2022-12-06 05:09:01,587 INFO L131 PetriNetUnfolder]: For 7644/7644 co-relation queries the response was YES. [2022-12-06 05:09:01,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29771 conditions, 10464 events. 7639/10464 cut-off events. For 7644/7644 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 50373 event pairs, 3920 based on Foata normal form. 1/8401 useless extension candidates. Maximal degree in co-relation 29672. Up to 9443 conditions per place. [2022-12-06 05:09:01,633 INFO L137 encePairwiseOnDemand]: 38/51 looper letters, 143 selfloop transitions, 20 changer transitions 3/166 dead transitions. [2022-12-06 05:09:01,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 166 transitions, 1084 flow [2022-12-06 05:09:01,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:09:01,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:09:01,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2022-12-06 05:09:01,634 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4745098039215686 [2022-12-06 05:09:01,634 INFO L175 Difference]: Start difference. First operand has 67 places, 92 transitions, 494 flow. Second operand 5 states and 121 transitions. [2022-12-06 05:09:01,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 166 transitions, 1084 flow [2022-12-06 05:09:01,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 166 transitions, 1082 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-06 05:09:01,675 INFO L231 Difference]: Finished difference. Result has 74 places, 107 transitions, 679 flow [2022-12-06 05:09:01,675 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=679, PETRI_PLACES=74, PETRI_TRANSITIONS=107} [2022-12-06 05:09:01,675 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 28 predicate places. [2022-12-06 05:09:01,676 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:09:01,676 INFO L89 Accepts]: Start accepts. Operand has 74 places, 107 transitions, 679 flow [2022-12-06 05:09:01,677 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:09:01,677 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:09:01,677 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 107 transitions, 679 flow [2022-12-06 05:09:01,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 107 transitions, 679 flow [2022-12-06 05:09:01,762 INFO L130 PetriNetUnfolder]: 318/798 cut-off events. [2022-12-06 05:09:01,763 INFO L131 PetriNetUnfolder]: For 779/880 co-relation queries the response was YES. [2022-12-06 05:09:01,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1922 conditions, 798 events. 318/798 cut-off events. For 779/880 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 5345 event pairs, 35 based on Foata normal form. 4/641 useless extension candidates. Maximal degree in co-relation 1840. Up to 226 conditions per place. [2022-12-06 05:09:01,768 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 107 transitions, 679 flow [2022-12-06 05:09:01,769 INFO L188 LiptonReduction]: Number of co-enabled transitions 1640 [2022-12-06 05:09:01,771 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:09:01,772 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 05:09:01,772 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 107 transitions, 679 flow [2022-12-06 05:09:01,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:09:01,772 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:09:01,772 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:09:01,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:09:01,773 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:09:01,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:09:01,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1543872765, now seen corresponding path program 7 times [2022-12-06 05:09:01,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:09:01,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561254596] [2022-12-06 05:09:01,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:09:01,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:09:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:09:02,205 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:09:02,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:09:02,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561254596] [2022-12-06 05:09:02,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561254596] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:09:02,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:09:02,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:09:02,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843212745] [2022-12-06 05:09:02,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:09:02,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:09:02,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:09:02,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:09:02,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:09:02,207 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 05:09:02,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 107 transitions, 679 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:09:02,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:09:02,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 05:09:02,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:09:03,784 INFO L130 PetriNetUnfolder]: 7822/10742 cut-off events. [2022-12-06 05:09:03,784 INFO L131 PetriNetUnfolder]: For 12225/12225 co-relation queries the response was YES. [2022-12-06 05:09:03,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33103 conditions, 10742 events. 7822/10742 cut-off events. For 12225/12225 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 52586 event pairs, 3845 based on Foata normal form. 1/8839 useless extension candidates. Maximal degree in co-relation 33000. Up to 9070 conditions per place. [2022-12-06 05:09:03,834 INFO L137 encePairwiseOnDemand]: 37/51 looper letters, 164 selfloop transitions, 21 changer transitions 2/187 dead transitions. [2022-12-06 05:09:03,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 187 transitions, 1390 flow [2022-12-06 05:09:03,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:09:03,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:09:03,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2022-12-06 05:09:03,836 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4823529411764706 [2022-12-06 05:09:03,836 INFO L175 Difference]: Start difference. First operand has 74 places, 107 transitions, 679 flow. Second operand 5 states and 123 transitions. [2022-12-06 05:09:03,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 187 transitions, 1390 flow [2022-12-06 05:09:03,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 187 transitions, 1371 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-06 05:09:03,883 INFO L231 Difference]: Finished difference. Result has 80 places, 120 transitions, 863 flow [2022-12-06 05:09:03,883 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=863, PETRI_PLACES=80, PETRI_TRANSITIONS=120} [2022-12-06 05:09:03,884 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 34 predicate places. [2022-12-06 05:09:03,884 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:09:03,884 INFO L89 Accepts]: Start accepts. Operand has 80 places, 120 transitions, 863 flow [2022-12-06 05:09:03,885 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:09:03,885 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:09:03,885 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 120 transitions, 863 flow [2022-12-06 05:09:03,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 120 transitions, 863 flow [2022-12-06 05:09:03,975 INFO L130 PetriNetUnfolder]: 332/840 cut-off events. [2022-12-06 05:09:03,976 INFO L131 PetriNetUnfolder]: For 1255/1361 co-relation queries the response was YES. [2022-12-06 05:09:03,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2229 conditions, 840 events. 332/840 cut-off events. For 1255/1361 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5711 event pairs, 30 based on Foata normal form. 4/677 useless extension candidates. Maximal degree in co-relation 2144. Up to 239 conditions per place. [2022-12-06 05:09:03,982 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 120 transitions, 863 flow [2022-12-06 05:09:03,982 INFO L188 LiptonReduction]: Number of co-enabled transitions 1830 [2022-12-06 05:09:03,986 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:09:03,989 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-06 05:09:03,989 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 120 transitions, 863 flow [2022-12-06 05:09:03,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:09:03,989 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:09:03,989 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:09:03,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:09:03,989 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:09:03,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:09:03,990 INFO L85 PathProgramCache]: Analyzing trace with hash -2129159793, now seen corresponding path program 8 times [2022-12-06 05:09:03,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:09:03,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676917571] [2022-12-06 05:09:03,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:09:03,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:09:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:09:04,487 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:09:04,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:09:04,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676917571] [2022-12-06 05:09:04,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676917571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:09:04,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:09:04,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:09:04,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37266550] [2022-12-06 05:09:04,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:09:04,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:09:04,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:09:04,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:09:04,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:09:04,488 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 05:09:04,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 120 transitions, 863 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:09:04,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:09:04,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 05:09:04,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:09:07,247 INFO L130 PetriNetUnfolder]: 13912/18886 cut-off events. [2022-12-06 05:09:07,248 INFO L131 PetriNetUnfolder]: For 26089/26089 co-relation queries the response was YES. [2022-12-06 05:09:07,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61012 conditions, 18886 events. 13912/18886 cut-off events. For 26089/26089 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 98950 event pairs, 1093 based on Foata normal form. 1/15433 useless extension candidates. Maximal degree in co-relation 60906. Up to 7027 conditions per place. [2022-12-06 05:09:07,342 INFO L137 encePairwiseOnDemand]: 36/51 looper letters, 206 selfloop transitions, 74 changer transitions 2/282 dead transitions. [2022-12-06 05:09:07,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 282 transitions, 2212 flow [2022-12-06 05:09:07,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:09:07,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:09:07,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 193 transitions. [2022-12-06 05:09:07,344 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.630718954248366 [2022-12-06 05:09:07,344 INFO L175 Difference]: Start difference. First operand has 80 places, 120 transitions, 863 flow. Second operand 6 states and 193 transitions. [2022-12-06 05:09:07,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 282 transitions, 2212 flow [2022-12-06 05:09:07,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 282 transitions, 2187 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-06 05:09:07,531 INFO L231 Difference]: Finished difference. Result has 88 places, 168 transitions, 1523 flow [2022-12-06 05:09:07,531 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1523, PETRI_PLACES=88, PETRI_TRANSITIONS=168} [2022-12-06 05:09:07,531 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 42 predicate places. [2022-12-06 05:09:07,531 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:09:07,531 INFO L89 Accepts]: Start accepts. Operand has 88 places, 168 transitions, 1523 flow [2022-12-06 05:09:07,533 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:09:07,533 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:09:07,533 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 168 transitions, 1523 flow [2022-12-06 05:09:07,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 168 transitions, 1523 flow [2022-12-06 05:09:07,797 INFO L130 PetriNetUnfolder]: 766/1702 cut-off events. [2022-12-06 05:09:07,797 INFO L131 PetriNetUnfolder]: For 3484/3941 co-relation queries the response was YES. [2022-12-06 05:09:07,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5428 conditions, 1702 events. 766/1702 cut-off events. For 3484/3941 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 12356 event pairs, 34 based on Foata normal form. 5/1341 useless extension candidates. Maximal degree in co-relation 5339. Up to 509 conditions per place. [2022-12-06 05:09:07,813 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 168 transitions, 1523 flow [2022-12-06 05:09:07,813 INFO L188 LiptonReduction]: Number of co-enabled transitions 2844 [2022-12-06 05:09:07,824 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:09:07,824 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 293 [2022-12-06 05:09:07,825 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 168 transitions, 1523 flow [2022-12-06 05:09:07,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:09:07,825 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:09:07,825 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:09:07,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 05:09:07,825 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:09:07,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:09:07,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1311094133, now seen corresponding path program 1 times [2022-12-06 05:09:07,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:09:07,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123377879] [2022-12-06 05:09:07,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:09:07,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:09:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:09:07,935 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:09:07,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:09:07,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123377879] [2022-12-06 05:09:07,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123377879] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:09:07,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:09:07,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:09:07,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236749616] [2022-12-06 05:09:07,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:09:07,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:09:07,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:09:07,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:09:07,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:09:07,936 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 05:09:07,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 168 transitions, 1523 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:09:07,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:09:07,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 05:09:07,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:09:11,126 INFO L130 PetriNetUnfolder]: 15780/21505 cut-off events. [2022-12-06 05:09:11,126 INFO L131 PetriNetUnfolder]: For 50302/50302 co-relation queries the response was YES. [2022-12-06 05:09:11,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81576 conditions, 21505 events. 15780/21505 cut-off events. For 50302/50302 co-relation queries the response was YES. Maximal size of possible extension queue 789. Compared 113390 event pairs, 5615 based on Foata normal form. 0/18043 useless extension candidates. Maximal degree in co-relation 81466. Up to 17746 conditions per place. [2022-12-06 05:09:11,288 INFO L137 encePairwiseOnDemand]: 46/51 looper letters, 202 selfloop transitions, 21 changer transitions 0/223 dead transitions. [2022-12-06 05:09:11,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 223 transitions, 2297 flow [2022-12-06 05:09:11,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:09:11,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:09:11,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-12-06 05:09:11,289 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5490196078431373 [2022-12-06 05:09:11,289 INFO L175 Difference]: Start difference. First operand has 88 places, 168 transitions, 1523 flow. Second operand 3 states and 84 transitions. [2022-12-06 05:09:11,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 223 transitions, 2297 flow [2022-12-06 05:09:11,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 223 transitions, 2184 flow, removed 50 selfloop flow, removed 1 redundant places. [2022-12-06 05:09:11,668 INFO L231 Difference]: Finished difference. Result has 90 places, 166 transitions, 1467 flow [2022-12-06 05:09:11,669 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1467, PETRI_PLACES=90, PETRI_TRANSITIONS=166} [2022-12-06 05:09:11,669 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 44 predicate places. [2022-12-06 05:09:11,669 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:09:11,670 INFO L89 Accepts]: Start accepts. Operand has 90 places, 166 transitions, 1467 flow [2022-12-06 05:09:11,671 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:09:11,672 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:09:11,672 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 166 transitions, 1467 flow [2022-12-06 05:09:11,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 166 transitions, 1467 flow [2022-12-06 05:09:11,920 INFO L130 PetriNetUnfolder]: 823/1927 cut-off events. [2022-12-06 05:09:11,920 INFO L131 PetriNetUnfolder]: For 4005/4497 co-relation queries the response was YES. [2022-12-06 05:09:11,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5995 conditions, 1927 events. 823/1927 cut-off events. For 4005/4497 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 15038 event pairs, 12 based on Foata normal form. 19/1584 useless extension candidates. Maximal degree in co-relation 5905. Up to 513 conditions per place. [2022-12-06 05:09:11,940 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 166 transitions, 1467 flow [2022-12-06 05:09:11,940 INFO L188 LiptonReduction]: Number of co-enabled transitions 2880 [2022-12-06 05:09:11,951 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:09:11,952 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 283 [2022-12-06 05:09:11,952 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 166 transitions, 1467 flow [2022-12-06 05:09:11,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:09:11,952 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:09:11,952 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:09:11,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 05:09:11,952 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:09:11,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:09:11,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1269895574, now seen corresponding path program 1 times [2022-12-06 05:09:11,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:09:11,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250198087] [2022-12-06 05:09:11,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:09:11,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:09:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:09:12,061 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:09:12,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:09:12,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250198087] [2022-12-06 05:09:12,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250198087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:09:12,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:09:12,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:09:12,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723130783] [2022-12-06 05:09:12,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:09:12,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:09:12,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:09:12,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:09:12,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:09:12,063 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 05:09:12,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 166 transitions, 1467 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:09:12,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:09:12,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 05:09:12,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:09:17,413 INFO L130 PetriNetUnfolder]: 25238/34249 cut-off events. [2022-12-06 05:09:17,414 INFO L131 PetriNetUnfolder]: For 89611/89611 co-relation queries the response was YES. [2022-12-06 05:09:17,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130332 conditions, 34249 events. 25238/34249 cut-off events. For 89611/89611 co-relation queries the response was YES. Maximal size of possible extension queue 1013. Compared 187200 event pairs, 7640 based on Foata normal form. 374/28937 useless extension candidates. Maximal degree in co-relation 130221. Up to 21564 conditions per place. [2022-12-06 05:09:17,717 INFO L137 encePairwiseOnDemand]: 46/50 looper letters, 242 selfloop transitions, 8 changer transitions 0/250 dead transitions. [2022-12-06 05:09:17,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 250 transitions, 2673 flow [2022-12-06 05:09:17,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:09:17,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:09:17,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2022-12-06 05:09:17,718 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5533333333333333 [2022-12-06 05:09:17,718 INFO L175 Difference]: Start difference. First operand has 90 places, 166 transitions, 1467 flow. Second operand 3 states and 83 transitions. [2022-12-06 05:09:17,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 250 transitions, 2673 flow [2022-12-06 05:09:18,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 250 transitions, 2592 flow, removed 23 selfloop flow, removed 1 redundant places. [2022-12-06 05:09:18,263 INFO L231 Difference]: Finished difference. Result has 92 places, 168 transitions, 1458 flow [2022-12-06 05:09:18,263 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1458, PETRI_PLACES=92, PETRI_TRANSITIONS=168} [2022-12-06 05:09:18,263 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 46 predicate places. [2022-12-06 05:09:18,264 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:09:18,264 INFO L89 Accepts]: Start accepts. Operand has 92 places, 168 transitions, 1458 flow [2022-12-06 05:09:18,265 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:09:18,265 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:09:18,265 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 168 transitions, 1458 flow [2022-12-06 05:09:18,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 168 transitions, 1458 flow [2022-12-06 05:09:18,627 INFO L130 PetriNetUnfolder]: 1095/2724 cut-off events. [2022-12-06 05:09:18,627 INFO L131 PetriNetUnfolder]: For 5323/5860 co-relation queries the response was YES. [2022-12-06 05:09:18,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8230 conditions, 2724 events. 1095/2724 cut-off events. For 5323/5860 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 22817 event pairs, 35 based on Foata normal form. 51/2252 useless extension candidates. Maximal degree in co-relation 8139. Up to 730 conditions per place. [2022-12-06 05:09:18,656 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 168 transitions, 1458 flow [2022-12-06 05:09:18,656 INFO L188 LiptonReduction]: Number of co-enabled transitions 3156 [2022-12-06 05:09:18,674 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:09:18,675 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 411 [2022-12-06 05:09:18,675 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 168 transitions, 1458 flow [2022-12-06 05:09:18,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:09:18,675 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:09:18,675 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:09:18,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 05:09:18,676 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:09:18,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:09:18,677 INFO L85 PathProgramCache]: Analyzing trace with hash 23312936, now seen corresponding path program 1 times [2022-12-06 05:09:18,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:09:18,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097343187] [2022-12-06 05:09:18,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:09:18,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:09:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:09:18,801 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:09:18,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:09:18,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097343187] [2022-12-06 05:09:18,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097343187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:09:18,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:09:18,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:09:18,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860537648] [2022-12-06 05:09:18,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:09:18,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:09:18,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:09:18,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:09:18,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:09:18,804 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 05:09:18,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 168 transitions, 1458 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:09:18,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:09:18,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 05:09:18,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:09:26,297 INFO L130 PetriNetUnfolder]: 36282/48953 cut-off events. [2022-12-06 05:09:26,298 INFO L131 PetriNetUnfolder]: For 108724/108724 co-relation queries the response was YES. [2022-12-06 05:09:26,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183559 conditions, 48953 events. 36282/48953 cut-off events. For 108724/108724 co-relation queries the response was YES. Maximal size of possible extension queue 1268. Compared 271716 event pairs, 12339 based on Foata normal form. 514/40931 useless extension candidates. Maximal degree in co-relation 183447. Up to 33338 conditions per place. [2022-12-06 05:09:26,871 INFO L137 encePairwiseOnDemand]: 46/50 looper letters, 231 selfloop transitions, 11 changer transitions 0/242 dead transitions. [2022-12-06 05:09:26,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 242 transitions, 2520 flow [2022-12-06 05:09:26,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:09:26,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:09:26,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-12-06 05:09:26,872 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.54 [2022-12-06 05:09:26,872 INFO L175 Difference]: Start difference. First operand has 92 places, 168 transitions, 1458 flow. Second operand 3 states and 81 transitions. [2022-12-06 05:09:26,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 242 transitions, 2520 flow [2022-12-06 05:09:27,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 242 transitions, 2506 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:09:27,841 INFO L231 Difference]: Finished difference. Result has 94 places, 166 transitions, 1470 flow [2022-12-06 05:09:27,841 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1421, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1470, PETRI_PLACES=94, PETRI_TRANSITIONS=166} [2022-12-06 05:09:27,842 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 48 predicate places. [2022-12-06 05:09:27,842 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:09:27,842 INFO L89 Accepts]: Start accepts. Operand has 94 places, 166 transitions, 1470 flow [2022-12-06 05:09:27,843 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:09:27,843 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:09:27,843 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 166 transitions, 1470 flow [2022-12-06 05:09:27,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 166 transitions, 1470 flow [2022-12-06 05:09:28,240 INFO L130 PetriNetUnfolder]: 1264/3241 cut-off events. [2022-12-06 05:09:28,241 INFO L131 PetriNetUnfolder]: For 6357/6934 co-relation queries the response was YES. [2022-12-06 05:09:28,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9760 conditions, 3241 events. 1264/3241 cut-off events. For 6357/6934 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 28016 event pairs, 41 based on Foata normal form. 69/2650 useless extension candidates. Maximal degree in co-relation 9668. Up to 837 conditions per place. [2022-12-06 05:09:28,282 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 166 transitions, 1470 flow [2022-12-06 05:09:28,282 INFO L188 LiptonReduction]: Number of co-enabled transitions 3328 [2022-12-06 05:09:28,297 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:09:28,298 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 456 [2022-12-06 05:09:28,298 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 166 transitions, 1470 flow [2022-12-06 05:09:28,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:09:28,298 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:09:28,299 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:09:28,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 05:09:28,299 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:09:28,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:09:28,299 INFO L85 PathProgramCache]: Analyzing trace with hash 622470051, now seen corresponding path program 1 times [2022-12-06 05:09:28,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:09:28,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597289806] [2022-12-06 05:09:28,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:09:28,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:09:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:09:28,536 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:09:28,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:09:28,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597289806] [2022-12-06 05:09:28,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597289806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:09:28,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:09:28,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:09:28,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556017691] [2022-12-06 05:09:28,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:09:28,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:09:28,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:09:28,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:09:28,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:09:28,538 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 05:09:28,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 166 transitions, 1470 flow. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:09:28,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:09:28,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 05:09:28,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:09:36,665 INFO L130 PetriNetUnfolder]: 36844/49815 cut-off events. [2022-12-06 05:09:36,665 INFO L131 PetriNetUnfolder]: For 111138/111138 co-relation queries the response was YES. [2022-12-06 05:09:36,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190076 conditions, 49815 events. 36844/49815 cut-off events. For 111138/111138 co-relation queries the response was YES. Maximal size of possible extension queue 1270. Compared 280616 event pairs, 9381 based on Foata normal form. 4/41071 useless extension candidates. Maximal degree in co-relation 189963. Up to 46798 conditions per place. [2022-12-06 05:09:37,105 INFO L137 encePairwiseOnDemand]: 45/50 looper letters, 185 selfloop transitions, 13 changer transitions 41/239 dead transitions. [2022-12-06 05:09:37,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 239 transitions, 2409 flow [2022-12-06 05:09:37,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:09:37,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:09:37,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-12-06 05:09:37,106 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 05:09:37,106 INFO L175 Difference]: Start difference. First operand has 94 places, 166 transitions, 1470 flow. Second operand 4 states and 100 transitions. [2022-12-06 05:09:37,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 239 transitions, 2409 flow [2022-12-06 05:09:38,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 239 transitions, 2392 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:09:38,362 INFO L231 Difference]: Finished difference. Result has 99 places, 165 transitions, 1497 flow [2022-12-06 05:09:38,363 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1459, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1497, PETRI_PLACES=99, PETRI_TRANSITIONS=165} [2022-12-06 05:09:38,363 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 53 predicate places. [2022-12-06 05:09:38,363 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:09:38,364 INFO L89 Accepts]: Start accepts. Operand has 99 places, 165 transitions, 1497 flow [2022-12-06 05:09:38,365 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:09:38,365 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:09:38,365 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 165 transitions, 1497 flow [2022-12-06 05:09:38,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 165 transitions, 1497 flow [2022-12-06 05:09:38,745 INFO L130 PetriNetUnfolder]: 1188/3086 cut-off events. [2022-12-06 05:09:38,746 INFO L131 PetriNetUnfolder]: For 6219/6877 co-relation queries the response was YES. [2022-12-06 05:09:38,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9228 conditions, 3086 events. 1188/3086 cut-off events. For 6219/6877 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 26600 event pairs, 39 based on Foata normal form. 61/2499 useless extension candidates. Maximal degree in co-relation 9164. Up to 763 conditions per place. [2022-12-06 05:09:38,784 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 165 transitions, 1497 flow [2022-12-06 05:09:38,784 INFO L188 LiptonReduction]: Number of co-enabled transitions 3316 [2022-12-06 05:09:38,803 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [3007] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse6 (= (mod v_~is_null_5~0_In_28 256) 0)) (.cse7 (= (mod v_~is_null_1~0_In_26 256) 0))) (let ((.cse1 (not .cse7)) (.cse0 (= |v_thread1Thread1of1ForFork1_#res#1.base_Out_38| 0)) (.cse2 (not .cse6)) (.cse4 (= |v_thread1Thread1of1ForFork1_#res#1.offset_Out_38| 0)) (.cse3 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_78| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|)) (.cse5 (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_In_5| 256) 0))) (or (and .cse0 (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20| |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|) .cse1 (<= |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42| 2147483647) (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|)) .cse2 .cse3 .cse4 (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20| v_~get_subject_7~0_In_11) .cse5 (= (+ |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32| |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|) |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|) (= v_~get_subject_3~0_In_11 |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20|) (= v_~result_12~0_Out_86 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|)) (and (or (and .cse0 .cse1 (= v_~result_12~0_Out_86 1005) .cse4 .cse6) (and .cse0 .cse2 .cse4 (= (+ v_~result_12~0_Out_86 995) 0) .cse7)) (= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32| |v_thread1Thread1of1ForFork1_minus_~b#1_In_21|) (= (ite (not (and .cse7 .cse6)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|) (= |v_thread1Thread1of1ForFork1_minus_#res#1_In_6| |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_In_7| |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20|) .cse3 .cse5 (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_In_9| |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20|) (= |v_thread1Thread1of1ForFork1_minus_~a#1_In_21| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|))))) InVars {~get_subject_3~0=v_~get_subject_3~0_In_11, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_In_9|, ~is_null_5~0=v_~is_null_5~0_In_28, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_In_7|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_In_21|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_In_6|, ~is_null_1~0=v_~is_null_1~0_In_26, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_In_5|, ~get_subject_7~0=v_~get_subject_7~0_In_11, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_In_21|} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|, thread1Thread1of1ForFork1_#t~ite22#1=|v_thread1Thread1of1ForFork1_#t~ite22#1_Out_28|, thread1Thread1of1ForFork1_#t~ret20#1=|v_thread1Thread1of1ForFork1_#t~ret20#1_Out_20|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20|, ~get_subject_3~0=v_~get_subject_3~0_In_11, ~is_null_5~0=v_~is_null_5~0_In_28, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|, ~is_null_1~0=v_~is_null_1~0_In_26, thread1Thread1of1ForFork1_#t~ite21#1=|v_thread1Thread1of1ForFork1_#t~ite21#1_Out_26|, ~get_subject_7~0=v_~get_subject_7~0_In_11, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_Out_38|, ~result_12~0=v_~result_12~0_Out_86, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_Out_38|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_78|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ite22#1, thread1Thread1of1ForFork1_#t~ret20#1, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#t~ite21#1, thread1Thread1of1ForFork1_#res#1.offset, ~result_12~0, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [3010] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse7 (= (mod v_~is_null_5~0_In_30 256) 0)) (.cse6 (= (mod v_~is_null_9~0_In_29 256) 0))) (let ((.cse4 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_94| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|)) (.cse5 (= 0 (mod |v_thread2Thread1of1ForFork2_#t~nondet23#1_In_5| 256))) (.cse1 (not .cse6)) (.cse0 (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_28| 0)) (.cse2 (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_28| 0)) (.cse3 (not .cse7))) (or (and (<= v_~result_15~0_Out_84 2147483647) (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26| |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|) (<= 0 (+ v_~result_15~0_Out_84 2147483648)) .cse0 .cse1 .cse2 (= (+ |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34| |v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|) |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|) (= v_~get_subject_11~0_In_11 |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26|) (= v_~result_15~0_Out_84 |v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|) .cse3 .cse4 (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26| v_~get_subject_7~0_In_13) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26| |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|) .cse5) (and (= (ite (not (and .cse6 .cse7)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26| |v_thread2Thread1of1ForFork2_minus_#in~b#1_In_12|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_In_19| |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|) (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_In_10| |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26|) .cse4 (= |v_thread2Thread1of1ForFork2_minus_#res#1_In_8| |v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|) .cse5 (or (and .cse0 .cse1 .cse2 (= (+ v_~result_15~0_Out_84 995) 0) .cse7) (and .cse0 .cse6 (= v_~result_15~0_Out_84 1005) .cse2 .cse3)) (= |v_thread2Thread1of1ForFork2_minus_~a#1_In_19| |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|))))) InVars {~is_null_5~0=v_~is_null_5~0_In_30, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_In_19|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_In_19|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_In_10|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_In_12|, thread2Thread1of1ForFork2_#t~nondet23#1=|v_thread2Thread1of1ForFork2_#t~nondet23#1_In_5|, ~get_subject_7~0=v_~get_subject_7~0_In_13, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_In_8|, ~is_null_9~0=v_~is_null_9~0_In_29, ~get_subject_11~0=v_~get_subject_11~0_In_11} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_28|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|, thread2Thread1of1ForFork2_#t~ite43#1=|v_thread2Thread1of1ForFork2_#t~ite43#1_Out_26|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_28|, ~get_subject_11~0=v_~get_subject_11~0_In_11, ~is_null_5~0=v_~is_null_5~0_In_30, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_94|, ~result_15~0=v_~result_15~0_Out_84, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26|, thread2Thread1of1ForFork2_#t~ret42#1=|v_thread2Thread1of1ForFork2_#t~ret42#1_Out_20|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26|, thread2Thread1of1ForFork2_#t~ite44#1=|v_thread2Thread1of1ForFork2_#t~ite44#1_Out_26|, ~get_subject_7~0=v_~get_subject_7~0_In_13, ~is_null_9~0=v_~is_null_9~0_In_29} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~ite43#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~result_15~0, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_#t~ret42#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~ite44#1, thread2Thread1of1ForFork2_#t~nondet23#1] [2022-12-06 05:09:39,713 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [3010] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse7 (= (mod v_~is_null_5~0_In_30 256) 0)) (.cse6 (= (mod v_~is_null_9~0_In_29 256) 0))) (let ((.cse4 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_94| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|)) (.cse5 (= 0 (mod |v_thread2Thread1of1ForFork2_#t~nondet23#1_In_5| 256))) (.cse1 (not .cse6)) (.cse0 (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_28| 0)) (.cse2 (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_28| 0)) (.cse3 (not .cse7))) (or (and (<= v_~result_15~0_Out_84 2147483647) (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26| |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|) (<= 0 (+ v_~result_15~0_Out_84 2147483648)) .cse0 .cse1 .cse2 (= (+ |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34| |v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|) |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|) (= v_~get_subject_11~0_In_11 |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26|) (= v_~result_15~0_Out_84 |v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|) .cse3 .cse4 (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26| v_~get_subject_7~0_In_13) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26| |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|) .cse5) (and (= (ite (not (and .cse6 .cse7)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26| |v_thread2Thread1of1ForFork2_minus_#in~b#1_In_12|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_In_19| |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|) (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_In_10| |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26|) .cse4 (= |v_thread2Thread1of1ForFork2_minus_#res#1_In_8| |v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|) .cse5 (or (and .cse0 .cse1 .cse2 (= (+ v_~result_15~0_Out_84 995) 0) .cse7) (and .cse0 .cse6 (= v_~result_15~0_Out_84 1005) .cse2 .cse3)) (= |v_thread2Thread1of1ForFork2_minus_~a#1_In_19| |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|))))) InVars {~is_null_5~0=v_~is_null_5~0_In_30, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_In_19|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_In_19|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_In_10|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_In_12|, thread2Thread1of1ForFork2_#t~nondet23#1=|v_thread2Thread1of1ForFork2_#t~nondet23#1_In_5|, ~get_subject_7~0=v_~get_subject_7~0_In_13, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_In_8|, ~is_null_9~0=v_~is_null_9~0_In_29, ~get_subject_11~0=v_~get_subject_11~0_In_11} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_28|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|, thread2Thread1of1ForFork2_#t~ite43#1=|v_thread2Thread1of1ForFork2_#t~ite43#1_Out_26|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_28|, ~get_subject_11~0=v_~get_subject_11~0_In_11, ~is_null_5~0=v_~is_null_5~0_In_30, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_94|, ~result_15~0=v_~result_15~0_Out_84, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26|, thread2Thread1of1ForFork2_#t~ret42#1=|v_thread2Thread1of1ForFork2_#t~ret42#1_Out_20|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26|, thread2Thread1of1ForFork2_#t~ite44#1=|v_thread2Thread1of1ForFork2_#t~ite44#1_Out_26|, ~get_subject_7~0=v_~get_subject_7~0_In_13, ~is_null_9~0=v_~is_null_9~0_In_29} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~ite43#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~result_15~0, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_#t~ret42#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~ite44#1, thread2Thread1of1ForFork2_#t~nondet23#1] and [3012] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse0 (= (mod |v_thread3Thread1of1ForFork0_#t~nondet45#1_In_5| 256) 0)) (.cse4 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_38| 0)) (.cse5 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_38| 0)) (.cse2 (= (mod v_~is_null_9~0_In_31 256) 0)) (.cse1 (= (mod v_~is_null_1~0_In_28 256) 0)) (.cse3 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88|))) (or (and .cse0 (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_10| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|) (= (ite (not (and .cse1 .cse2)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66|) .cse3 (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| |v_thread3Thread1of1ForFork0_minus_~a#1_In_22|) (or (and .cse4 .cse5 .cse1 (= (+ v_~result_18~0_Out_94 995) 0)) (and .cse4 .cse5 .cse2 (= v_~result_18~0_Out_94 1005))) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_12| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88| 0)) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42| |v_thread3Thread1of1ForFork0_minus_#res#1_In_9|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_~b#1_In_20|)) (and .cse0 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|) .cse4 (<= 0 (+ v_~result_18~0_Out_94 2147483648)) .cse5 (= v_~get_subject_3~0_In_13 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|) (not .cse2) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|) (not .cse1) .cse3 (<= v_~result_18~0_Out_94 2147483647) (= v_~result_18~0_Out_94 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30|)) 1 0)) (= v_~get_subject_11~0_In_13 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|)))) InVars {~get_subject_3~0=v_~get_subject_3~0_In_13, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_9|, ~is_null_1~0=v_~is_null_1~0_In_28, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_20|, thread3Thread1of1ForFork0_#t~nondet45#1=|v_thread3Thread1of1ForFork0_#t~nondet45#1_In_5|, ~is_null_9~0=v_~is_null_9~0_In_31, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_22|, ~get_subject_11~0=v_~get_subject_11~0_In_13, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_12|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_10|} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_38|, thread3Thread1of1ForFork0_#t~ite66#1=|v_thread3Thread1of1ForFork0_#t~ite66#1_Out_24|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_30|, thread3Thread1of1ForFork0_#t~ret64#1=|v_thread3Thread1of1ForFork0_#t~ret64#1_Out_20|, ~get_subject_11~0=v_~get_subject_11~0_In_13, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_38|, ~get_subject_3~0=v_~get_subject_3~0_In_13, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|, ~result_18~0=v_~result_18~0_Out_94, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_30|, ~is_null_1~0=v_~is_null_1~0_In_28, thread3Thread1of1ForFork0_#t~ite65#1=|v_thread3Thread1of1ForFork0_#t~ite65#1_Out_24|, ~is_null_9~0=v_~is_null_9~0_In_31, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~nondet45#1, thread3Thread1of1ForFork0_#t~ite66#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_#t~ret64#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, ~result_18~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~ite65#1, thread3Thread1of1ForFork0_minus_#in~a#1] [2022-12-06 05:09:40,323 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [3010] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse7 (= (mod v_~is_null_5~0_In_30 256) 0)) (.cse6 (= (mod v_~is_null_9~0_In_29 256) 0))) (let ((.cse4 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_94| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|)) (.cse5 (= 0 (mod |v_thread2Thread1of1ForFork2_#t~nondet23#1_In_5| 256))) (.cse1 (not .cse6)) (.cse0 (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_28| 0)) (.cse2 (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_28| 0)) (.cse3 (not .cse7))) (or (and (<= v_~result_15~0_Out_84 2147483647) (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26| |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|) (<= 0 (+ v_~result_15~0_Out_84 2147483648)) .cse0 .cse1 .cse2 (= (+ |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34| |v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|) |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|) (= v_~get_subject_11~0_In_11 |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26|) (= v_~result_15~0_Out_84 |v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|) .cse3 .cse4 (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26| v_~get_subject_7~0_In_13) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26| |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|) .cse5) (and (= (ite (not (and .cse6 .cse7)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26| |v_thread2Thread1of1ForFork2_minus_#in~b#1_In_12|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_In_19| |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|) (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_In_10| |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26|) .cse4 (= |v_thread2Thread1of1ForFork2_minus_#res#1_In_8| |v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|) .cse5 (or (and .cse0 .cse1 .cse2 (= (+ v_~result_15~0_Out_84 995) 0) .cse7) (and .cse0 .cse6 (= v_~result_15~0_Out_84 1005) .cse2 .cse3)) (= |v_thread2Thread1of1ForFork2_minus_~a#1_In_19| |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|))))) InVars {~is_null_5~0=v_~is_null_5~0_In_30, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_In_19|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_In_19|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_In_10|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_In_12|, thread2Thread1of1ForFork2_#t~nondet23#1=|v_thread2Thread1of1ForFork2_#t~nondet23#1_In_5|, ~get_subject_7~0=v_~get_subject_7~0_In_13, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_In_8|, ~is_null_9~0=v_~is_null_9~0_In_29, ~get_subject_11~0=v_~get_subject_11~0_In_11} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_28|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|, thread2Thread1of1ForFork2_#t~ite43#1=|v_thread2Thread1of1ForFork2_#t~ite43#1_Out_26|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_28|, ~get_subject_11~0=v_~get_subject_11~0_In_11, ~is_null_5~0=v_~is_null_5~0_In_30, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_94|, ~result_15~0=v_~result_15~0_Out_84, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26|, thread2Thread1of1ForFork2_#t~ret42#1=|v_thread2Thread1of1ForFork2_#t~ret42#1_Out_20|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26|, thread2Thread1of1ForFork2_#t~ite44#1=|v_thread2Thread1of1ForFork2_#t~ite44#1_Out_26|, ~get_subject_7~0=v_~get_subject_7~0_In_13, ~is_null_9~0=v_~is_null_9~0_In_29} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~ite43#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~result_15~0, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_#t~ret42#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~ite44#1, thread2Thread1of1ForFork2_#t~nondet23#1] and [3004] L108-4-->L108-4: Formula: (let ((.cse2 (mod v_~break_20~0_235 256)) (.cse8 (mod v_~break_20~0_234 256)) (.cse23 (select (select |v_#memory_int_528| v_~ends_with_2~0.base_141) (+ v_~i_19~0_213 v_~ends_with_2~0.offset_141)))) (let ((.cse7 (= (mod .cse23 256) 0)) (.cse9 (= 0 .cse8)) (.cse0 (= .cse2 0))) (let ((.cse5 (not .cse0)) (.cse10 (not |v_thread3Thread1of1ForFork0_#t~short58#1_69|)) (.cse11 (not .cse9)) (.cse4 (select (select |v_#memory_int_528| v_~ends_with_10~0.base_135) (+ v_~i_19~0_213 v_~ends_with_10~0.offset_135))) (.cse14 (mod v_~break_20~0_236 256)) (.cse12 (not |v_thread3Thread1of1ForFork0_#t~short49#1_59|)) (.cse6 (not .cse7))) (and (not (= (mod |v_thread3Thread1of1ForFork0_#t~nondet46#1_52| 256) 0)) (let ((.cse1 (= (+ v_~i_19~0_213 1) v_~i_19~0_212))) (or (and |v_thread3Thread1of1ForFork0_#t~short60#1_84| .cse0 .cse1 (= (ite (= (ite |v_thread3Thread1of1ForFork0_#t~short60#1_86| 1 .cse2) 0) 0 1) v_~break_20~0_233) (let ((.cse3 (= 0 (mod .cse4 256)))) (or (and (not .cse3) |v_thread3Thread1of1ForFork0_#t~short60#1_86|) (and .cse3 (not |v_thread3Thread1of1ForFork0_#t~short60#1_86|))))) (and (= (ite (= (ite |v_thread3Thread1of1ForFork0_#t~short60#1_85| 1 .cse2) 0) 0 1) v_~break_20~0_233) .cse5 .cse1 (not |v_thread3Thread1of1ForFork0_#t~short60#1_85|)))) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_257| 0)) (or (and (or (and |v_thread3Thread1of1ForFork0_#t~short56#1_75| .cse6) (and .cse7 (not |v_thread3Thread1of1ForFork0_#t~short56#1_75|))) |v_thread3Thread1of1ForFork0_#t~short56#1_74| (= (ite (= (ite |v_thread3Thread1of1ForFork0_#t~short56#1_75| 1 .cse8) 0) 0 1) v_~break_20~0_235) .cse9 (or (and |v_thread3Thread1of1ForFork0_#t~short58#1_69| .cse0) (and .cse10 .cse5))) (and (= (ite (= (ite |v_thread3Thread1of1ForFork0_#t~short56#1_73| 1 .cse8) 0) 0 1) v_~break_20~0_235) .cse11 .cse10 (not |v_thread3Thread1of1ForFork0_#t~short56#1_73|))) (or (and (= |v_thread3Thread1of1ForFork0_#t~short49#1_59| |v_thread3Thread1of1ForFork0_#t~short49#1_58|) (= |v_thread3Thread1of1ForFork0_#t~mem48#1_33| |v_thread3Thread1of1ForFork0_#t~mem48#1_31|) .cse12 (= (ite |v_thread3Thread1of1ForFork0_#t~short49#1_59| 0 v_~result_18~0_233) v_~result_18~0_231)) (and (= .cse4 |v_thread3Thread1of1ForFork0_#t~mem48#1_31|) |v_thread3Thread1of1ForFork0_#t~short49#1_59| (let ((.cse13 (= (mod |v_thread3Thread1of1ForFork0_#t~mem48#1_31| 256) 0))) (or (and (not |v_thread3Thread1of1ForFork0_#t~short49#1_58|) .cse13) (and |v_thread3Thread1of1ForFork0_#t~short49#1_58| (not .cse13)))) (= v_~result_18~0_231 (ite |v_thread3Thread1of1ForFork0_#t~short49#1_58| 0 v_~result_18~0_233)))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_177| (ite (and (= .cse14 0) (< v_~i_19~0_213 5)) 1 0)) (let ((.cse16 (+ v_~i_19~0_213 1000))) (or (and (let ((.cse15 (= (mod |v_thread3Thread1of1ForFork0_#t~mem57#1_39| 256) 0))) (or (and |v_thread3Thread1of1ForFork0_#t~short58#1_70| (not .cse15)) (and .cse15 (not |v_thread3Thread1of1ForFork0_#t~short58#1_70|)))) |v_thread3Thread1of1ForFork0_#t~short58#1_69| (= .cse4 |v_thread3Thread1of1ForFork0_#t~mem57#1_39|) (= (ite |v_thread3Thread1of1ForFork0_#t~short58#1_70| .cse16 v_~result_18~0_232) v_~result_18~0_230)) (and (= |v_thread3Thread1of1ForFork0_#t~mem57#1_39| |v_thread3Thread1of1ForFork0_#t~mem57#1_41|) .cse10 (= |v_thread3Thread1of1ForFork0_#t~short58#1_69| |v_thread3Thread1of1ForFork0_#t~short58#1_70|) (= (ite |v_thread3Thread1of1ForFork0_#t~short58#1_69| .cse16 v_~result_18~0_232) v_~result_18~0_230)))) (let ((.cse17 (+ v_~i_19~0_213 (- 1000)))) (or (and (not |v_thread3Thread1of1ForFork0_#t~short54#1_81|) .cse11 (= (ite |v_thread3Thread1of1ForFork0_#t~short54#1_81| .cse17 v_~result_18~0_231) v_~result_18~0_232)) (and |v_thread3Thread1of1ForFork0_#t~short54#1_80| (= (ite |v_thread3Thread1of1ForFork0_#t~short54#1_82| .cse17 v_~result_18~0_231) v_~result_18~0_232) .cse9 (or (and .cse7 (not |v_thread3Thread1of1ForFork0_#t~short54#1_82|)) (and |v_thread3Thread1of1ForFork0_#t~short54#1_82| .cse6))))) (let ((.cse18 (= (ite (= (ite |v_thread3Thread1of1ForFork0_#t~short52#1_74| 1 .cse14) 0) 0 1) v_~break_20~0_234)) (.cse21 (= (mod |v_thread3Thread1of1ForFork0_#t~mem50#1_42| 256) 0)) (.cse22 (= .cse23 |v_thread3Thread1of1ForFork0_#t~mem50#1_42|)) (.cse20 (not |v_thread3Thread1of1ForFork0_#t~short52#1_74|))) (or (and .cse18 (let ((.cse19 (= (mod |v_thread3Thread1of1ForFork0_#t~mem51#1_44| 256) 0))) (or (and (not .cse19) |v_thread3Thread1of1ForFork0_#t~short52#1_74|) (and .cse19 .cse20))) |v_thread3Thread1of1ForFork0_#t~short52#1_75| (not .cse21) (= .cse4 |v_thread3Thread1of1ForFork0_#t~mem51#1_44|) .cse22) (and (= |v_thread3Thread1of1ForFork0_#t~mem51#1_45| |v_thread3Thread1of1ForFork0_#t~mem51#1_44|) .cse18 .cse21 .cse22 .cse20))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_257| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_177|) (or (and .cse7 .cse12) (and |v_thread3Thread1of1ForFork0_#t~short49#1_59| .cse6)))))) InVars {~ends_with_10~0.offset=v_~ends_with_10~0.offset_135, ~break_20~0=v_~break_20~0_236, ~ends_with_10~0.base=v_~ends_with_10~0.base_135, thread3Thread1of1ForFork0_#t~mem48#1=|v_thread3Thread1of1ForFork0_#t~mem48#1_33|, ~result_18~0=v_~result_18~0_233, #memory_int=|v_#memory_int_528|, thread3Thread1of1ForFork0_#t~mem51#1=|v_thread3Thread1of1ForFork0_#t~mem51#1_45|, thread3Thread1of1ForFork0_#t~mem57#1=|v_thread3Thread1of1ForFork0_#t~mem57#1_41|, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_141, ~ends_with_2~0.base=v_~ends_with_2~0.base_141, thread3Thread1of1ForFork0_#t~nondet46#1=|v_thread3Thread1of1ForFork0_#t~nondet46#1_52|, ~i_19~0=v_~i_19~0_213} OutVars{~ends_with_10~0.offset=v_~ends_with_10~0.offset_135, thread3Thread1of1ForFork0_#t~short58#1=|v_thread3Thread1of1ForFork0_#t~short58#1_68|, thread3Thread1of1ForFork0_#t~short49#1=|v_thread3Thread1of1ForFork0_#t~short49#1_57|, thread3Thread1of1ForFork0_#t~mem59#1=|v_thread3Thread1of1ForFork0_#t~mem59#1_31|, thread3Thread1of1ForFork0_#t~short54#1=|v_thread3Thread1of1ForFork0_#t~short54#1_79|, ~ends_with_10~0.base=v_~ends_with_10~0.base_135, thread3Thread1of1ForFork0_#t~mem55#1=|v_thread3Thread1of1ForFork0_#t~mem55#1_31|, ~break_20~0=v_~break_20~0_233, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_177|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_257|, thread3Thread1of1ForFork0_#t~post61#1=|v_thread3Thread1of1ForFork0_#t~post61#1_27|, thread3Thread1of1ForFork0_#t~mem47#1=|v_thread3Thread1of1ForFork0_#t~mem47#1_35|, thread3Thread1of1ForFork0_#t~mem50#1=|v_thread3Thread1of1ForFork0_#t~mem50#1_41|, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_141, thread3Thread1of1ForFork0_#t~short60#1=|v_thread3Thread1of1ForFork0_#t~short60#1_83|, ~result_18~0=v_~result_18~0_230, #memory_int=|v_#memory_int_528|, thread3Thread1of1ForFork0_#t~short56#1=|v_thread3Thread1of1ForFork0_#t~short56#1_72|, ~ends_with_2~0.base=v_~ends_with_2~0.base_141, thread3Thread1of1ForFork0_#t~short52#1=|v_thread3Thread1of1ForFork0_#t~short52#1_73|, ~i_19~0=v_~i_19~0_212, thread3Thread1of1ForFork0_#t~mem53#1=|v_thread3Thread1of1ForFork0_#t~mem53#1_29|} AuxVars[|v_thread3Thread1of1ForFork0_#t~short60#1_85|, |v_thread3Thread1of1ForFork0_#t~short56#1_74|, |v_thread3Thread1of1ForFork0_#t~short56#1_73|, |v_thread3Thread1of1ForFork0_#t~short60#1_86|, |v_thread3Thread1of1ForFork0_#t~short60#1_84|, |v_thread3Thread1of1ForFork0_#t~short56#1_75|, |v_thread3Thread1of1ForFork0_#t~mem50#1_42|, v_~break_20~0_234, v_~break_20~0_235, v_~result_18~0_232, |v_thread3Thread1of1ForFork0_#t~short49#1_59|, |v_thread3Thread1of1ForFork0_#t~mem57#1_39|, |v_thread3Thread1of1ForFork0_#t~short49#1_58|, |v_thread3Thread1of1ForFork0_#t~short58#1_70|, |v_thread3Thread1of1ForFork0_#t~mem51#1_44|, |v_thread3Thread1of1ForFork0_#t~mem48#1_31|, |v_thread3Thread1of1ForFork0_#t~short52#1_75|, |v_thread3Thread1of1ForFork0_#t~short54#1_80|, |v_thread3Thread1of1ForFork0_#t~short54#1_81|, |v_thread3Thread1of1ForFork0_#t~short52#1_74|, |v_thread3Thread1of1ForFork0_#t~short58#1_69|, |v_thread3Thread1of1ForFork0_#t~short54#1_82|, v_~result_18~0_231] AssignedVars[~break_20~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~short58#1, thread3Thread1of1ForFork0_#t~post61#1, thread3Thread1of1ForFork0_#t~mem47#1, thread3Thread1of1ForFork0_#t~mem50#1, thread3Thread1of1ForFork0_#t~short49#1, thread3Thread1of1ForFork0_#t~mem59#1, thread3Thread1of1ForFork0_#t~short54#1, thread3Thread1of1ForFork0_#t~short60#1, thread3Thread1of1ForFork0_#t~mem48#1, ~result_18~0, thread3Thread1of1ForFork0_#t~short56#1, thread3Thread1of1ForFork0_#t~mem51#1, thread3Thread1of1ForFork0_#t~mem57#1, thread3Thread1of1ForFork0_#t~nondet46#1, thread3Thread1of1ForFork0_#t~mem55#1, thread3Thread1of1ForFork0_#t~short52#1, ~i_19~0, thread3Thread1of1ForFork0_#t~mem53#1] [2022-12-06 05:09:42,155 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [3010] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse7 (= (mod v_~is_null_5~0_In_30 256) 0)) (.cse6 (= (mod v_~is_null_9~0_In_29 256) 0))) (let ((.cse4 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_94| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|)) (.cse5 (= 0 (mod |v_thread2Thread1of1ForFork2_#t~nondet23#1_In_5| 256))) (.cse1 (not .cse6)) (.cse0 (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_28| 0)) (.cse2 (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_28| 0)) (.cse3 (not .cse7))) (or (and (<= v_~result_15~0_Out_84 2147483647) (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26| |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|) (<= 0 (+ v_~result_15~0_Out_84 2147483648)) .cse0 .cse1 .cse2 (= (+ |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34| |v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|) |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|) (= v_~get_subject_11~0_In_11 |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26|) (= v_~result_15~0_Out_84 |v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|) .cse3 .cse4 (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26| v_~get_subject_7~0_In_13) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26| |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|) .cse5) (and (= (ite (not (and .cse6 .cse7)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26| |v_thread2Thread1of1ForFork2_minus_#in~b#1_In_12|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_In_19| |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|) (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_In_10| |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26|) .cse4 (= |v_thread2Thread1of1ForFork2_minus_#res#1_In_8| |v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|) .cse5 (or (and .cse0 .cse1 .cse2 (= (+ v_~result_15~0_Out_84 995) 0) .cse7) (and .cse0 .cse6 (= v_~result_15~0_Out_84 1005) .cse2 .cse3)) (= |v_thread2Thread1of1ForFork2_minus_~a#1_In_19| |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|))))) InVars {~is_null_5~0=v_~is_null_5~0_In_30, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_In_19|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_In_19|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_In_10|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_In_12|, thread2Thread1of1ForFork2_#t~nondet23#1=|v_thread2Thread1of1ForFork2_#t~nondet23#1_In_5|, ~get_subject_7~0=v_~get_subject_7~0_In_13, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_In_8|, ~is_null_9~0=v_~is_null_9~0_In_29, ~get_subject_11~0=v_~get_subject_11~0_In_11} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_28|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|, thread2Thread1of1ForFork2_#t~ite43#1=|v_thread2Thread1of1ForFork2_#t~ite43#1_Out_26|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_28|, ~get_subject_11~0=v_~get_subject_11~0_In_11, ~is_null_5~0=v_~is_null_5~0_In_30, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_94|, ~result_15~0=v_~result_15~0_Out_84, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26|, thread2Thread1of1ForFork2_#t~ret42#1=|v_thread2Thread1of1ForFork2_#t~ret42#1_Out_20|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26|, thread2Thread1of1ForFork2_#t~ite44#1=|v_thread2Thread1of1ForFork2_#t~ite44#1_Out_26|, ~get_subject_7~0=v_~get_subject_7~0_In_13, ~is_null_9~0=v_~is_null_9~0_In_29} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~ite43#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~result_15~0, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_#t~ret42#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~ite44#1, thread2Thread1of1ForFork2_#t~nondet23#1] and [3011] L108-4-->thread3EXIT: Formula: (let ((.cse1 (= (mod v_~break_20~0_In_38 256) 0))) (let ((.cse0 (= (mod |v_thread3Thread1of1ForFork0_#t~nondet46#1_In_5| 256) 0)) (.cse3 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_34| 0)) (.cse4 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_34| 0)) (.cse2 (ite (not (and .cse1 (< v_~i_19~0_In_50 5))) 1 0)) (.cse5 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_62| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_84|))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_26| |v_thread3Thread1of1ForFork0_minus_~b#1_In_18|) .cse0 (not .cse1) (= v_~result_18~0_Out_90 v_~result_18~0_In_25) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_8| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_22|) (= .cse2 |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_62|) .cse3 .cse4 .cse5 (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_26| |v_thread3Thread1of1ForFork0_minus_~a#1_In_20|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_10| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_22|) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_38| |v_thread3Thread1of1ForFork0_minus_#res#1_In_7|)) (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_26| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_26| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_38|)) .cse0 .cse1 (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_38| 2147483648)) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_38| 2147483647) (= v_~result_18~0_Out_90 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_38|) .cse3 .cse4 (not (= .cse2 0)) (= (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_26| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_26| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_26|)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_62|) .cse5 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_26| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_22|) (= v_~filename_0~0_In_12 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_22|) (= v_~filename_8~0_In_13 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_22|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_26| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_22|))))) InVars {~filename_8~0=v_~filename_8~0_In_13, ~break_20~0=v_~break_20~0_In_38, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_7|, ~filename_0~0=v_~filename_0~0_In_12, ~result_18~0=v_~result_18~0_In_25, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_18|, thread3Thread1of1ForFork0_#t~nondet46#1=|v_thread3Thread1of1ForFork0_#t~nondet46#1_In_5|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_20|, ~i_19~0=v_~i_19~0_In_50, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_10|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_8|} OutVars{thread3Thread1of1ForFork0_#t~ite63#1=|v_thread3Thread1of1ForFork0_#t~ite63#1_Out_22|, thread3Thread1of1ForFork0_#t~ret62#1=|v_thread3Thread1of1ForFork0_#t~ret62#1_Out_18|, ~break_20~0=v_~break_20~0_In_38, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_62|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_84|, ~filename_0~0=v_~filename_0~0_In_12, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_34|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_26|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_22|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_34|, ~filename_8~0=v_~filename_8~0_In_13, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_38|, ~result_18~0=v_~result_18~0_Out_90, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_26|, ~i_19~0=v_~i_19~0_In_50, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_22|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~ite63#1, thread3Thread1of1ForFork0_#t~ret62#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, ~result_18~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~nondet46#1, thread3Thread1of1ForFork0_minus_#in~a#1] [2022-12-06 05:09:42,731 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [3010] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse7 (= (mod v_~is_null_5~0_In_30 256) 0)) (.cse6 (= (mod v_~is_null_9~0_In_29 256) 0))) (let ((.cse4 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_94| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|)) (.cse5 (= 0 (mod |v_thread2Thread1of1ForFork2_#t~nondet23#1_In_5| 256))) (.cse1 (not .cse6)) (.cse0 (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_28| 0)) (.cse2 (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_28| 0)) (.cse3 (not .cse7))) (or (and (<= v_~result_15~0_Out_84 2147483647) (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26| |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|) (<= 0 (+ v_~result_15~0_Out_84 2147483648)) .cse0 .cse1 .cse2 (= (+ |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34| |v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|) |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|) (= v_~get_subject_11~0_In_11 |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26|) (= v_~result_15~0_Out_84 |v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|) .cse3 .cse4 (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26| v_~get_subject_7~0_In_13) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26| |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|) .cse5) (and (= (ite (not (and .cse6 .cse7)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26| |v_thread2Thread1of1ForFork2_minus_#in~b#1_In_12|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_In_19| |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|) (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_In_10| |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26|) .cse4 (= |v_thread2Thread1of1ForFork2_minus_#res#1_In_8| |v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|) .cse5 (or (and .cse0 .cse1 .cse2 (= (+ v_~result_15~0_Out_84 995) 0) .cse7) (and .cse0 .cse6 (= v_~result_15~0_Out_84 1005) .cse2 .cse3)) (= |v_thread2Thread1of1ForFork2_minus_~a#1_In_19| |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|))))) InVars {~is_null_5~0=v_~is_null_5~0_In_30, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_In_19|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_In_19|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_In_10|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_In_12|, thread2Thread1of1ForFork2_#t~nondet23#1=|v_thread2Thread1of1ForFork2_#t~nondet23#1_In_5|, ~get_subject_7~0=v_~get_subject_7~0_In_13, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_In_8|, ~is_null_9~0=v_~is_null_9~0_In_29, ~get_subject_11~0=v_~get_subject_11~0_In_11} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_28|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|, thread2Thread1of1ForFork2_#t~ite43#1=|v_thread2Thread1of1ForFork2_#t~ite43#1_Out_26|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_28|, ~get_subject_11~0=v_~get_subject_11~0_In_11, ~is_null_5~0=v_~is_null_5~0_In_30, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_94|, ~result_15~0=v_~result_15~0_Out_84, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26|, thread2Thread1of1ForFork2_#t~ret42#1=|v_thread2Thread1of1ForFork2_#t~ret42#1_Out_20|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26|, thread2Thread1of1ForFork2_#t~ite44#1=|v_thread2Thread1of1ForFork2_#t~ite44#1_Out_26|, ~get_subject_7~0=v_~get_subject_7~0_In_13, ~is_null_9~0=v_~is_null_9~0_In_29} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~ite43#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~result_15~0, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_#t~ret42#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~ite44#1, thread2Thread1of1ForFork2_#t~nondet23#1] and [3004] L108-4-->L108-4: Formula: (let ((.cse2 (mod v_~break_20~0_235 256)) (.cse8 (mod v_~break_20~0_234 256)) (.cse23 (select (select |v_#memory_int_528| v_~ends_with_2~0.base_141) (+ v_~i_19~0_213 v_~ends_with_2~0.offset_141)))) (let ((.cse7 (= (mod .cse23 256) 0)) (.cse9 (= 0 .cse8)) (.cse0 (= .cse2 0))) (let ((.cse5 (not .cse0)) (.cse10 (not |v_thread3Thread1of1ForFork0_#t~short58#1_69|)) (.cse11 (not .cse9)) (.cse4 (select (select |v_#memory_int_528| v_~ends_with_10~0.base_135) (+ v_~i_19~0_213 v_~ends_with_10~0.offset_135))) (.cse14 (mod v_~break_20~0_236 256)) (.cse12 (not |v_thread3Thread1of1ForFork0_#t~short49#1_59|)) (.cse6 (not .cse7))) (and (not (= (mod |v_thread3Thread1of1ForFork0_#t~nondet46#1_52| 256) 0)) (let ((.cse1 (= (+ v_~i_19~0_213 1) v_~i_19~0_212))) (or (and |v_thread3Thread1of1ForFork0_#t~short60#1_84| .cse0 .cse1 (= (ite (= (ite |v_thread3Thread1of1ForFork0_#t~short60#1_86| 1 .cse2) 0) 0 1) v_~break_20~0_233) (let ((.cse3 (= 0 (mod .cse4 256)))) (or (and (not .cse3) |v_thread3Thread1of1ForFork0_#t~short60#1_86|) (and .cse3 (not |v_thread3Thread1of1ForFork0_#t~short60#1_86|))))) (and (= (ite (= (ite |v_thread3Thread1of1ForFork0_#t~short60#1_85| 1 .cse2) 0) 0 1) v_~break_20~0_233) .cse5 .cse1 (not |v_thread3Thread1of1ForFork0_#t~short60#1_85|)))) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_257| 0)) (or (and (or (and |v_thread3Thread1of1ForFork0_#t~short56#1_75| .cse6) (and .cse7 (not |v_thread3Thread1of1ForFork0_#t~short56#1_75|))) |v_thread3Thread1of1ForFork0_#t~short56#1_74| (= (ite (= (ite |v_thread3Thread1of1ForFork0_#t~short56#1_75| 1 .cse8) 0) 0 1) v_~break_20~0_235) .cse9 (or (and |v_thread3Thread1of1ForFork0_#t~short58#1_69| .cse0) (and .cse10 .cse5))) (and (= (ite (= (ite |v_thread3Thread1of1ForFork0_#t~short56#1_73| 1 .cse8) 0) 0 1) v_~break_20~0_235) .cse11 .cse10 (not |v_thread3Thread1of1ForFork0_#t~short56#1_73|))) (or (and (= |v_thread3Thread1of1ForFork0_#t~short49#1_59| |v_thread3Thread1of1ForFork0_#t~short49#1_58|) (= |v_thread3Thread1of1ForFork0_#t~mem48#1_33| |v_thread3Thread1of1ForFork0_#t~mem48#1_31|) .cse12 (= (ite |v_thread3Thread1of1ForFork0_#t~short49#1_59| 0 v_~result_18~0_233) v_~result_18~0_231)) (and (= .cse4 |v_thread3Thread1of1ForFork0_#t~mem48#1_31|) |v_thread3Thread1of1ForFork0_#t~short49#1_59| (let ((.cse13 (= (mod |v_thread3Thread1of1ForFork0_#t~mem48#1_31| 256) 0))) (or (and (not |v_thread3Thread1of1ForFork0_#t~short49#1_58|) .cse13) (and |v_thread3Thread1of1ForFork0_#t~short49#1_58| (not .cse13)))) (= v_~result_18~0_231 (ite |v_thread3Thread1of1ForFork0_#t~short49#1_58| 0 v_~result_18~0_233)))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_177| (ite (and (= .cse14 0) (< v_~i_19~0_213 5)) 1 0)) (let ((.cse16 (+ v_~i_19~0_213 1000))) (or (and (let ((.cse15 (= (mod |v_thread3Thread1of1ForFork0_#t~mem57#1_39| 256) 0))) (or (and |v_thread3Thread1of1ForFork0_#t~short58#1_70| (not .cse15)) (and .cse15 (not |v_thread3Thread1of1ForFork0_#t~short58#1_70|)))) |v_thread3Thread1of1ForFork0_#t~short58#1_69| (= .cse4 |v_thread3Thread1of1ForFork0_#t~mem57#1_39|) (= (ite |v_thread3Thread1of1ForFork0_#t~short58#1_70| .cse16 v_~result_18~0_232) v_~result_18~0_230)) (and (= |v_thread3Thread1of1ForFork0_#t~mem57#1_39| |v_thread3Thread1of1ForFork0_#t~mem57#1_41|) .cse10 (= |v_thread3Thread1of1ForFork0_#t~short58#1_69| |v_thread3Thread1of1ForFork0_#t~short58#1_70|) (= (ite |v_thread3Thread1of1ForFork0_#t~short58#1_69| .cse16 v_~result_18~0_232) v_~result_18~0_230)))) (let ((.cse17 (+ v_~i_19~0_213 (- 1000)))) (or (and (not |v_thread3Thread1of1ForFork0_#t~short54#1_81|) .cse11 (= (ite |v_thread3Thread1of1ForFork0_#t~short54#1_81| .cse17 v_~result_18~0_231) v_~result_18~0_232)) (and |v_thread3Thread1of1ForFork0_#t~short54#1_80| (= (ite |v_thread3Thread1of1ForFork0_#t~short54#1_82| .cse17 v_~result_18~0_231) v_~result_18~0_232) .cse9 (or (and .cse7 (not |v_thread3Thread1of1ForFork0_#t~short54#1_82|)) (and |v_thread3Thread1of1ForFork0_#t~short54#1_82| .cse6))))) (let ((.cse18 (= (ite (= (ite |v_thread3Thread1of1ForFork0_#t~short52#1_74| 1 .cse14) 0) 0 1) v_~break_20~0_234)) (.cse21 (= (mod |v_thread3Thread1of1ForFork0_#t~mem50#1_42| 256) 0)) (.cse22 (= .cse23 |v_thread3Thread1of1ForFork0_#t~mem50#1_42|)) (.cse20 (not |v_thread3Thread1of1ForFork0_#t~short52#1_74|))) (or (and .cse18 (let ((.cse19 (= (mod |v_thread3Thread1of1ForFork0_#t~mem51#1_44| 256) 0))) (or (and (not .cse19) |v_thread3Thread1of1ForFork0_#t~short52#1_74|) (and .cse19 .cse20))) |v_thread3Thread1of1ForFork0_#t~short52#1_75| (not .cse21) (= .cse4 |v_thread3Thread1of1ForFork0_#t~mem51#1_44|) .cse22) (and (= |v_thread3Thread1of1ForFork0_#t~mem51#1_45| |v_thread3Thread1of1ForFork0_#t~mem51#1_44|) .cse18 .cse21 .cse22 .cse20))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_257| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_177|) (or (and .cse7 .cse12) (and |v_thread3Thread1of1ForFork0_#t~short49#1_59| .cse6)))))) InVars {~ends_with_10~0.offset=v_~ends_with_10~0.offset_135, ~break_20~0=v_~break_20~0_236, ~ends_with_10~0.base=v_~ends_with_10~0.base_135, thread3Thread1of1ForFork0_#t~mem48#1=|v_thread3Thread1of1ForFork0_#t~mem48#1_33|, ~result_18~0=v_~result_18~0_233, #memory_int=|v_#memory_int_528|, thread3Thread1of1ForFork0_#t~mem51#1=|v_thread3Thread1of1ForFork0_#t~mem51#1_45|, thread3Thread1of1ForFork0_#t~mem57#1=|v_thread3Thread1of1ForFork0_#t~mem57#1_41|, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_141, ~ends_with_2~0.base=v_~ends_with_2~0.base_141, thread3Thread1of1ForFork0_#t~nondet46#1=|v_thread3Thread1of1ForFork0_#t~nondet46#1_52|, ~i_19~0=v_~i_19~0_213} OutVars{~ends_with_10~0.offset=v_~ends_with_10~0.offset_135, thread3Thread1of1ForFork0_#t~short58#1=|v_thread3Thread1of1ForFork0_#t~short58#1_68|, thread3Thread1of1ForFork0_#t~short49#1=|v_thread3Thread1of1ForFork0_#t~short49#1_57|, thread3Thread1of1ForFork0_#t~mem59#1=|v_thread3Thread1of1ForFork0_#t~mem59#1_31|, thread3Thread1of1ForFork0_#t~short54#1=|v_thread3Thread1of1ForFork0_#t~short54#1_79|, ~ends_with_10~0.base=v_~ends_with_10~0.base_135, thread3Thread1of1ForFork0_#t~mem55#1=|v_thread3Thread1of1ForFork0_#t~mem55#1_31|, ~break_20~0=v_~break_20~0_233, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_177|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_257|, thread3Thread1of1ForFork0_#t~post61#1=|v_thread3Thread1of1ForFork0_#t~post61#1_27|, thread3Thread1of1ForFork0_#t~mem47#1=|v_thread3Thread1of1ForFork0_#t~mem47#1_35|, thread3Thread1of1ForFork0_#t~mem50#1=|v_thread3Thread1of1ForFork0_#t~mem50#1_41|, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_141, thread3Thread1of1ForFork0_#t~short60#1=|v_thread3Thread1of1ForFork0_#t~short60#1_83|, ~result_18~0=v_~result_18~0_230, #memory_int=|v_#memory_int_528|, thread3Thread1of1ForFork0_#t~short56#1=|v_thread3Thread1of1ForFork0_#t~short56#1_72|, ~ends_with_2~0.base=v_~ends_with_2~0.base_141, thread3Thread1of1ForFork0_#t~short52#1=|v_thread3Thread1of1ForFork0_#t~short52#1_73|, ~i_19~0=v_~i_19~0_212, thread3Thread1of1ForFork0_#t~mem53#1=|v_thread3Thread1of1ForFork0_#t~mem53#1_29|} AuxVars[|v_thread3Thread1of1ForFork0_#t~short60#1_85|, |v_thread3Thread1of1ForFork0_#t~short56#1_74|, |v_thread3Thread1of1ForFork0_#t~short56#1_73|, |v_thread3Thread1of1ForFork0_#t~short60#1_86|, |v_thread3Thread1of1ForFork0_#t~short60#1_84|, |v_thread3Thread1of1ForFork0_#t~short56#1_75|, |v_thread3Thread1of1ForFork0_#t~mem50#1_42|, v_~break_20~0_234, v_~break_20~0_235, v_~result_18~0_232, |v_thread3Thread1of1ForFork0_#t~short49#1_59|, |v_thread3Thread1of1ForFork0_#t~mem57#1_39|, |v_thread3Thread1of1ForFork0_#t~short49#1_58|, |v_thread3Thread1of1ForFork0_#t~short58#1_70|, |v_thread3Thread1of1ForFork0_#t~mem51#1_44|, |v_thread3Thread1of1ForFork0_#t~mem48#1_31|, |v_thread3Thread1of1ForFork0_#t~short52#1_75|, |v_thread3Thread1of1ForFork0_#t~short54#1_80|, |v_thread3Thread1of1ForFork0_#t~short54#1_81|, |v_thread3Thread1of1ForFork0_#t~short52#1_74|, |v_thread3Thread1of1ForFork0_#t~short58#1_69|, |v_thread3Thread1of1ForFork0_#t~short54#1_82|, v_~result_18~0_231] AssignedVars[~break_20~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~short58#1, thread3Thread1of1ForFork0_#t~post61#1, thread3Thread1of1ForFork0_#t~mem47#1, thread3Thread1of1ForFork0_#t~mem50#1, thread3Thread1of1ForFork0_#t~short49#1, thread3Thread1of1ForFork0_#t~mem59#1, thread3Thread1of1ForFork0_#t~short54#1, thread3Thread1of1ForFork0_#t~short60#1, thread3Thread1of1ForFork0_#t~mem48#1, ~result_18~0, thread3Thread1of1ForFork0_#t~short56#1, thread3Thread1of1ForFork0_#t~mem51#1, thread3Thread1of1ForFork0_#t~mem57#1, thread3Thread1of1ForFork0_#t~nondet46#1, thread3Thread1of1ForFork0_#t~mem55#1, thread3Thread1of1ForFork0_#t~short52#1, ~i_19~0, thread3Thread1of1ForFork0_#t~mem53#1] [2022-12-06 05:09:44,550 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [3010] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse7 (= (mod v_~is_null_5~0_In_30 256) 0)) (.cse6 (= (mod v_~is_null_9~0_In_29 256) 0))) (let ((.cse4 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_94| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|)) (.cse5 (= 0 (mod |v_thread2Thread1of1ForFork2_#t~nondet23#1_In_5| 256))) (.cse1 (not .cse6)) (.cse0 (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_28| 0)) (.cse2 (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_28| 0)) (.cse3 (not .cse7))) (or (and (<= v_~result_15~0_Out_84 2147483647) (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26| |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|) (<= 0 (+ v_~result_15~0_Out_84 2147483648)) .cse0 .cse1 .cse2 (= (+ |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34| |v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|) |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|) (= v_~get_subject_11~0_In_11 |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26|) (= v_~result_15~0_Out_84 |v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|) .cse3 .cse4 (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26| v_~get_subject_7~0_In_13) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26| |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|) .cse5) (and (= (ite (not (and .cse6 .cse7)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26| |v_thread2Thread1of1ForFork2_minus_#in~b#1_In_12|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_In_19| |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|) (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_In_10| |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26|) .cse4 (= |v_thread2Thread1of1ForFork2_minus_#res#1_In_8| |v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|) .cse5 (or (and .cse0 .cse1 .cse2 (= (+ v_~result_15~0_Out_84 995) 0) .cse7) (and .cse0 .cse6 (= v_~result_15~0_Out_84 1005) .cse2 .cse3)) (= |v_thread2Thread1of1ForFork2_minus_~a#1_In_19| |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|))))) InVars {~is_null_5~0=v_~is_null_5~0_In_30, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_In_19|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_In_19|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_In_10|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_In_12|, thread2Thread1of1ForFork2_#t~nondet23#1=|v_thread2Thread1of1ForFork2_#t~nondet23#1_In_5|, ~get_subject_7~0=v_~get_subject_7~0_In_13, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_In_8|, ~is_null_9~0=v_~is_null_9~0_In_29, ~get_subject_11~0=v_~get_subject_11~0_In_11} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_28|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|, thread2Thread1of1ForFork2_#t~ite43#1=|v_thread2Thread1of1ForFork2_#t~ite43#1_Out_26|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_28|, ~get_subject_11~0=v_~get_subject_11~0_In_11, ~is_null_5~0=v_~is_null_5~0_In_30, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_94|, ~result_15~0=v_~result_15~0_Out_84, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26|, thread2Thread1of1ForFork2_#t~ret42#1=|v_thread2Thread1of1ForFork2_#t~ret42#1_Out_20|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26|, thread2Thread1of1ForFork2_#t~ite44#1=|v_thread2Thread1of1ForFork2_#t~ite44#1_Out_26|, ~get_subject_7~0=v_~get_subject_7~0_In_13, ~is_null_9~0=v_~is_null_9~0_In_29} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~ite43#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~result_15~0, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_#t~ret42#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~ite44#1, thread2Thread1of1ForFork2_#t~nondet23#1] and [2605] L56-1-->L56-9: Formula: (and |v_thread1Thread1of1ForFork1_#t~short5#1_32| (let ((.cse0 (= (mod (select (select |v_#memory_int_216| v_~ends_with_6~0.base_63) (+ v_~ends_with_6~0.offset_63 v_~i_13~0_84)) 256) 0))) (or (and |v_thread1Thread1of1ForFork1_#t~short5#1_31| (not .cse0)) (and (not |v_thread1Thread1of1ForFork1_#t~short5#1_31|) .cse0))) (not (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_24| 256) 0)) (= v_~result_12~0_103 (ite |v_thread1Thread1of1ForFork1_#t~short5#1_31| 0 v_~result_12~0_104))) InVars {~ends_with_6~0.offset=v_~ends_with_6~0.offset_63, ~i_13~0=v_~i_13~0_84, ~ends_with_6~0.base=v_~ends_with_6~0.base_63, #memory_int=|v_#memory_int_216|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_24|, ~result_12~0=v_~result_12~0_104} OutVars{thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_25|, ~ends_with_6~0.offset=v_~ends_with_6~0.offset_63, ~i_13~0=v_~i_13~0_84, ~ends_with_6~0.base=v_~ends_with_6~0.base_63, #memory_int=|v_#memory_int_216|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_31|, ~result_12~0=v_~result_12~0_103} AuxVars[|v_thread1Thread1of1ForFork1_#t~short5#1_32|] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, ~result_12~0] [2022-12-06 05:09:44,901 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [3010] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse7 (= (mod v_~is_null_5~0_In_30 256) 0)) (.cse6 (= (mod v_~is_null_9~0_In_29 256) 0))) (let ((.cse4 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_94| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|)) (.cse5 (= 0 (mod |v_thread2Thread1of1ForFork2_#t~nondet23#1_In_5| 256))) (.cse1 (not .cse6)) (.cse0 (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_28| 0)) (.cse2 (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_28| 0)) (.cse3 (not .cse7))) (or (and (<= v_~result_15~0_Out_84 2147483647) (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26| |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|) (<= 0 (+ v_~result_15~0_Out_84 2147483648)) .cse0 .cse1 .cse2 (= (+ |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34| |v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|) |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|) (= v_~get_subject_11~0_In_11 |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26|) (= v_~result_15~0_Out_84 |v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|) .cse3 .cse4 (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26| v_~get_subject_7~0_In_13) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26| |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|) .cse5) (and (= (ite (not (and .cse6 .cse7)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26| |v_thread2Thread1of1ForFork2_minus_#in~b#1_In_12|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_In_19| |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|) (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_In_10| |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26|) .cse4 (= |v_thread2Thread1of1ForFork2_minus_#res#1_In_8| |v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|) .cse5 (or (and .cse0 .cse1 .cse2 (= (+ v_~result_15~0_Out_84 995) 0) .cse7) (and .cse0 .cse6 (= v_~result_15~0_Out_84 1005) .cse2 .cse3)) (= |v_thread2Thread1of1ForFork2_minus_~a#1_In_19| |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|))))) InVars {~is_null_5~0=v_~is_null_5~0_In_30, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_In_19|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_In_19|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_In_10|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_In_12|, thread2Thread1of1ForFork2_#t~nondet23#1=|v_thread2Thread1of1ForFork2_#t~nondet23#1_In_5|, ~get_subject_7~0=v_~get_subject_7~0_In_13, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_In_8|, ~is_null_9~0=v_~is_null_9~0_In_29, ~get_subject_11~0=v_~get_subject_11~0_In_11} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_28|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|, thread2Thread1of1ForFork2_#t~ite43#1=|v_thread2Thread1of1ForFork2_#t~ite43#1_Out_26|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_28|, ~get_subject_11~0=v_~get_subject_11~0_In_11, ~is_null_5~0=v_~is_null_5~0_In_30, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_94|, ~result_15~0=v_~result_15~0_Out_84, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26|, thread2Thread1of1ForFork2_#t~ret42#1=|v_thread2Thread1of1ForFork2_#t~ret42#1_Out_20|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26|, thread2Thread1of1ForFork2_#t~ite44#1=|v_thread2Thread1of1ForFork2_#t~ite44#1_Out_26|, ~get_subject_7~0=v_~get_subject_7~0_In_13, ~is_null_9~0=v_~is_null_9~0_In_29} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~ite43#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~result_15~0, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_#t~ret42#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~ite44#1, thread2Thread1of1ForFork2_#t~nondet23#1] and [2929] L58-->L58-7: Formula: (let ((.cse1 (= (mod v_~break_14~0_In_19 256) 0)) (.cse2 (not |v_thread1Thread1of1ForFork1_#t~short10#1_Out_6|)) (.cse0 (= (ite |v_thread1Thread1of1ForFork1_#t~short10#1_Out_6| (+ v_~i_13~0_In_26 (- 1000)) v_~result_12~0_In_15) v_~result_12~0_Out_52))) (or (and |v_thread1Thread1of1ForFork1_#t~short10#1_55| .cse0 .cse1 (let ((.cse3 (= (mod (select (select |v_#memory_int_In_61| v_~ends_with_2~0.base_In_13) (+ v_~i_13~0_In_26 v_~ends_with_2~0.offset_In_13)) 256) 0))) (or (and .cse2 .cse3) (and (not .cse3) |v_thread1Thread1of1ForFork1_#t~short10#1_Out_6|)))) (and (not .cse1) .cse2 .cse0))) InVars {~i_13~0=v_~i_13~0_In_26, #memory_int=|v_#memory_int_In_61|, ~result_12~0=v_~result_12~0_In_15, ~break_14~0=v_~break_14~0_In_19, ~ends_with_2~0.base=v_~ends_with_2~0.base_In_13, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_In_13} OutVars{thread1Thread1of1ForFork1_#t~short10#1=|v_thread1Thread1of1ForFork1_#t~short10#1_Out_6|, ~i_13~0=v_~i_13~0_In_26, thread1Thread1of1ForFork1_#t~mem9#1=|v_thread1Thread1of1ForFork1_#t~mem9#1_Out_8|, #memory_int=|v_#memory_int_In_61|, ~result_12~0=v_~result_12~0_Out_52, ~break_14~0=v_~break_14~0_In_19, ~ends_with_2~0.base=v_~ends_with_2~0.base_In_13, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_In_13} AuxVars[|v_thread1Thread1of1ForFork1_#t~short10#1_55|] AssignedVars[thread1Thread1of1ForFork1_#t~short10#1, thread1Thread1of1ForFork1_#t~mem9#1, ~result_12~0] [2022-12-06 05:09:45,314 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:09:45,314 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6951 [2022-12-06 05:09:45,314 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 165 transitions, 1572 flow [2022-12-06 05:09:45,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:09:45,315 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:09:45,315 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:09:45,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 05:09:45,315 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:09:45,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:09:45,316 INFO L85 PathProgramCache]: Analyzing trace with hash 2021046394, now seen corresponding path program 1 times [2022-12-06 05:09:45,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:09:45,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548915546] [2022-12-06 05:09:45,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:09:45,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:09:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:09:45,570 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-06 05:09:45,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:09:45,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548915546] [2022-12-06 05:09:45,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548915546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:09:45,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:09:45,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:09:45,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89620343] [2022-12-06 05:09:45,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:09:45,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:09:45,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:09:45,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:09:45,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:09:45,571 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 05:09:45,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 165 transitions, 1572 flow. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:09:45,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:09:45,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 05:09:45,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:09:52,919 INFO L130 PetriNetUnfolder]: 35762/48235 cut-off events. [2022-12-06 05:09:52,919 INFO L131 PetriNetUnfolder]: For 110173/110173 co-relation queries the response was YES. [2022-12-06 05:09:53,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183430 conditions, 48235 events. 35762/48235 cut-off events. For 110173/110173 co-relation queries the response was YES. Maximal size of possible extension queue 1203. Compared 270005 event pairs, 16007 based on Foata normal form. 4/39751 useless extension candidates. Maximal degree in co-relation 183361. Up to 45194 conditions per place. [2022-12-06 05:09:53,378 INFO L137 encePairwiseOnDemand]: 53/56 looper letters, 175 selfloop transitions, 4 changer transitions 40/219 dead transitions. [2022-12-06 05:09:53,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 219 transitions, 2232 flow [2022-12-06 05:09:53,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:09:53,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:09:53,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-12-06 05:09:53,379 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45982142857142855 [2022-12-06 05:09:53,379 INFO L175 Difference]: Start difference. First operand has 98 places, 165 transitions, 1572 flow. Second operand 4 states and 103 transitions. [2022-12-06 05:09:53,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 219 transitions, 2232 flow [2022-12-06 05:09:54,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 219 transitions, 2203 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-06 05:09:54,589 INFO L231 Difference]: Finished difference. Result has 100 places, 152 transitions, 1359 flow [2022-12-06 05:09:54,589 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1525, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1359, PETRI_PLACES=100, PETRI_TRANSITIONS=152} [2022-12-06 05:09:54,590 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 54 predicate places. [2022-12-06 05:09:54,590 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:09:54,590 INFO L89 Accepts]: Start accepts. Operand has 100 places, 152 transitions, 1359 flow [2022-12-06 05:09:54,591 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:09:54,591 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:09:54,591 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 152 transitions, 1359 flow [2022-12-06 05:09:54,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 152 transitions, 1359 flow [2022-12-06 05:09:54,955 INFO L130 PetriNetUnfolder]: 1160/2963 cut-off events. [2022-12-06 05:09:54,956 INFO L131 PetriNetUnfolder]: For 5492/5961 co-relation queries the response was YES. [2022-12-06 05:09:54,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8791 conditions, 2963 events. 1160/2963 cut-off events. For 5492/5961 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 24814 event pairs, 29 based on Foata normal form. 60/2383 useless extension candidates. Maximal degree in co-relation 8735. Up to 704 conditions per place. [2022-12-06 05:09:54,992 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 152 transitions, 1359 flow [2022-12-06 05:09:54,993 INFO L188 LiptonReduction]: Number of co-enabled transitions 3058 [2022-12-06 05:09:55,010 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [3012] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse0 (= (mod |v_thread3Thread1of1ForFork0_#t~nondet45#1_In_5| 256) 0)) (.cse4 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_38| 0)) (.cse5 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_38| 0)) (.cse2 (= (mod v_~is_null_9~0_In_31 256) 0)) (.cse1 (= (mod v_~is_null_1~0_In_28 256) 0)) (.cse3 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88|))) (or (and .cse0 (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_10| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|) (= (ite (not (and .cse1 .cse2)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66|) .cse3 (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| |v_thread3Thread1of1ForFork0_minus_~a#1_In_22|) (or (and .cse4 .cse5 .cse1 (= (+ v_~result_18~0_Out_94 995) 0)) (and .cse4 .cse5 .cse2 (= v_~result_18~0_Out_94 1005))) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_12| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88| 0)) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42| |v_thread3Thread1of1ForFork0_minus_#res#1_In_9|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_~b#1_In_20|)) (and .cse0 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|) .cse4 (<= 0 (+ v_~result_18~0_Out_94 2147483648)) .cse5 (= v_~get_subject_3~0_In_13 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|) (not .cse2) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|) (not .cse1) .cse3 (<= v_~result_18~0_Out_94 2147483647) (= v_~result_18~0_Out_94 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30|)) 1 0)) (= v_~get_subject_11~0_In_13 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|)))) InVars {~get_subject_3~0=v_~get_subject_3~0_In_13, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_9|, ~is_null_1~0=v_~is_null_1~0_In_28, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_20|, thread3Thread1of1ForFork0_#t~nondet45#1=|v_thread3Thread1of1ForFork0_#t~nondet45#1_In_5|, ~is_null_9~0=v_~is_null_9~0_In_31, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_22|, ~get_subject_11~0=v_~get_subject_11~0_In_13, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_12|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_10|} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_38|, thread3Thread1of1ForFork0_#t~ite66#1=|v_thread3Thread1of1ForFork0_#t~ite66#1_Out_24|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_30|, thread3Thread1of1ForFork0_#t~ret64#1=|v_thread3Thread1of1ForFork0_#t~ret64#1_Out_20|, ~get_subject_11~0=v_~get_subject_11~0_In_13, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_38|, ~get_subject_3~0=v_~get_subject_3~0_In_13, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|, ~result_18~0=v_~result_18~0_Out_94, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_30|, ~is_null_1~0=v_~is_null_1~0_In_28, thread3Thread1of1ForFork0_#t~ite65#1=|v_thread3Thread1of1ForFork0_#t~ite65#1_Out_24|, ~is_null_9~0=v_~is_null_9~0_In_31, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~nondet45#1, thread3Thread1of1ForFork0_#t~ite66#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_#t~ret64#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, ~result_18~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~ite65#1, thread3Thread1of1ForFork0_minus_#in~a#1] and [2954] $Ultimate##0-->L81-4: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| 0)) (= (ite (and (= (mod v_~is_null_5~0_In_24 256) 0) (= (mod v_~is_null_9~0_In_21 256) 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|) (= v_~break_17~0_Out_42 0) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3| 256) 0)) (= v_~i_16~0_Out_36 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|)) InVars {~is_null_5~0=v_~is_null_5~0_In_24, thread2Thread1of1ForFork2_#t~nondet23#1=|v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3|, ~is_null_9~0=v_~is_null_9~0_In_21} OutVars{~is_null_5~0=v_~is_null_5~0_In_24, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|, ~is_null_9~0=v_~is_null_9~0_In_21, ~break_17~0=v_~break_17~0_Out_42, ~i_16~0=v_~i_16~0_Out_36} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~nondet23#1, ~break_17~0, ~i_16~0] [2022-12-06 05:09:55,231 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [3012] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse0 (= (mod |v_thread3Thread1of1ForFork0_#t~nondet45#1_In_5| 256) 0)) (.cse4 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_38| 0)) (.cse5 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_38| 0)) (.cse2 (= (mod v_~is_null_9~0_In_31 256) 0)) (.cse1 (= (mod v_~is_null_1~0_In_28 256) 0)) (.cse3 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88|))) (or (and .cse0 (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_10| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|) (= (ite (not (and .cse1 .cse2)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66|) .cse3 (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| |v_thread3Thread1of1ForFork0_minus_~a#1_In_22|) (or (and .cse4 .cse5 .cse1 (= (+ v_~result_18~0_Out_94 995) 0)) (and .cse4 .cse5 .cse2 (= v_~result_18~0_Out_94 1005))) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_12| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88| 0)) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42| |v_thread3Thread1of1ForFork0_minus_#res#1_In_9|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_~b#1_In_20|)) (and .cse0 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|) .cse4 (<= 0 (+ v_~result_18~0_Out_94 2147483648)) .cse5 (= v_~get_subject_3~0_In_13 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|) (not .cse2) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|) (not .cse1) .cse3 (<= v_~result_18~0_Out_94 2147483647) (= v_~result_18~0_Out_94 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30|)) 1 0)) (= v_~get_subject_11~0_In_13 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|)))) InVars {~get_subject_3~0=v_~get_subject_3~0_In_13, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_9|, ~is_null_1~0=v_~is_null_1~0_In_28, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_20|, thread3Thread1of1ForFork0_#t~nondet45#1=|v_thread3Thread1of1ForFork0_#t~nondet45#1_In_5|, ~is_null_9~0=v_~is_null_9~0_In_31, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_22|, ~get_subject_11~0=v_~get_subject_11~0_In_13, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_12|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_10|} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_38|, thread3Thread1of1ForFork0_#t~ite66#1=|v_thread3Thread1of1ForFork0_#t~ite66#1_Out_24|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_30|, thread3Thread1of1ForFork0_#t~ret64#1=|v_thread3Thread1of1ForFork0_#t~ret64#1_Out_20|, ~get_subject_11~0=v_~get_subject_11~0_In_13, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_38|, ~get_subject_3~0=v_~get_subject_3~0_In_13, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|, ~result_18~0=v_~result_18~0_Out_94, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_30|, ~is_null_1~0=v_~is_null_1~0_In_28, thread3Thread1of1ForFork0_#t~ite65#1=|v_thread3Thread1of1ForFork0_#t~ite65#1_Out_24|, ~is_null_9~0=v_~is_null_9~0_In_31, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~nondet45#1, thread3Thread1of1ForFork0_#t~ite66#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_#t~ret64#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, ~result_18~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~ite65#1, thread3Thread1of1ForFork0_minus_#in~a#1] and [2954] $Ultimate##0-->L81-4: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| 0)) (= (ite (and (= (mod v_~is_null_5~0_In_24 256) 0) (= (mod v_~is_null_9~0_In_21 256) 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|) (= v_~break_17~0_Out_42 0) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3| 256) 0)) (= v_~i_16~0_Out_36 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|)) InVars {~is_null_5~0=v_~is_null_5~0_In_24, thread2Thread1of1ForFork2_#t~nondet23#1=|v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3|, ~is_null_9~0=v_~is_null_9~0_In_21} OutVars{~is_null_5~0=v_~is_null_5~0_In_24, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|, ~is_null_9~0=v_~is_null_9~0_In_21, ~break_17~0=v_~break_17~0_Out_42, ~i_16~0=v_~i_16~0_Out_36} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~nondet23#1, ~break_17~0, ~i_16~0] [2022-12-06 05:09:55,449 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [2950] L84-7-->L86: Formula: (let ((.cse1 (= (mod v_~break_17~0_In_23 256) 0)) (.cse0 (+ v_~i_16~0_In_35 (- 1000)))) (or (and (= (ite |v_thread2Thread1of1ForFork2_#t~short32#1_53| .cse0 v_~result_15~0_In_14) v_~result_15~0_Out_58) |v_thread2Thread1of1ForFork2_#t~short32#1_54| .cse1 (let ((.cse2 (= (mod (select (select |v_#memory_int_In_73| v_~ends_with_6~0.base_In_17) (+ v_~i_16~0_In_35 v_~ends_with_6~0.offset_In_17)) 256) 0))) (or (and .cse2 (not |v_thread2Thread1of1ForFork2_#t~short32#1_53|)) (and |v_thread2Thread1of1ForFork2_#t~short32#1_53| (not .cse2))))) (and (not |v_thread2Thread1of1ForFork2_#t~short32#1_52|) (not .cse1) (= v_~result_15~0_Out_58 (ite |v_thread2Thread1of1ForFork2_#t~short32#1_52| .cse0 v_~result_15~0_In_14))))) InVars {~ends_with_6~0.offset=v_~ends_with_6~0.offset_In_17, ~result_15~0=v_~result_15~0_In_14, ~ends_with_6~0.base=v_~ends_with_6~0.base_In_17, #memory_int=|v_#memory_int_In_73|, ~i_16~0=v_~i_16~0_In_35, ~break_17~0=v_~break_17~0_In_23} OutVars{thread2Thread1of1ForFork2_#t~mem31#1=|v_thread2Thread1of1ForFork2_#t~mem31#1_Out_10|, thread2Thread1of1ForFork2_#t~mem29#1=|v_thread2Thread1of1ForFork2_#t~mem29#1_Out_8|, ~ends_with_6~0.offset=v_~ends_with_6~0.offset_In_17, ~result_15~0=v_~result_15~0_Out_58, thread2Thread1of1ForFork2_#t~mem28#1=|v_thread2Thread1of1ForFork2_#t~mem28#1_Out_4|, ~ends_with_6~0.base=v_~ends_with_6~0.base_In_17, #memory_int=|v_#memory_int_In_73|, thread2Thread1of1ForFork2_#t~short32#1=|v_thread2Thread1of1ForFork2_#t~short32#1_Out_10|, ~i_16~0=v_~i_16~0_In_35, ~break_17~0=v_~break_17~0_In_23, thread2Thread1of1ForFork2_#t~short30#1=|v_thread2Thread1of1ForFork2_#t~short30#1_Out_14|} AuxVars[|v_thread2Thread1of1ForFork2_#t~short32#1_54|, |v_thread2Thread1of1ForFork2_#t~short32#1_52|, |v_thread2Thread1of1ForFork2_#t~short32#1_53|] AssignedVars[thread2Thread1of1ForFork2_#t~mem31#1, thread2Thread1of1ForFork2_#t~mem29#1, ~result_15~0, thread2Thread1of1ForFork2_#t~mem28#1, thread2Thread1of1ForFork2_#t~short32#1, thread2Thread1of1ForFork2_#t~short30#1] and [2954] $Ultimate##0-->L81-4: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| 0)) (= (ite (and (= (mod v_~is_null_5~0_In_24 256) 0) (= (mod v_~is_null_9~0_In_21 256) 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|) (= v_~break_17~0_Out_42 0) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3| 256) 0)) (= v_~i_16~0_Out_36 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|)) InVars {~is_null_5~0=v_~is_null_5~0_In_24, thread2Thread1of1ForFork2_#t~nondet23#1=|v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3|, ~is_null_9~0=v_~is_null_9~0_In_21} OutVars{~is_null_5~0=v_~is_null_5~0_In_24, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|, ~is_null_9~0=v_~is_null_9~0_In_21, ~break_17~0=v_~break_17~0_Out_42, ~i_16~0=v_~i_16~0_Out_36} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~nondet23#1, ~break_17~0, ~i_16~0] [2022-12-06 05:09:55,614 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [2783] L83-2-->L83-9: Formula: (and |v_thread2Thread1of1ForFork2_#t~short27#1_54| (= v_~result_15~0_145 (ite |v_thread2Thread1of1ForFork2_#t~short27#1_53| 0 v_~result_15~0_146)) (let ((.cse0 (= (mod (select (select |v_#memory_int_344| v_~ends_with_10~0.base_91) (+ v_~i_16~0_180 v_~ends_with_10~0.offset_91)) 256) 0))) (or (and (not .cse0) |v_thread2Thread1of1ForFork2_#t~short27#1_53|) (and .cse0 (not |v_thread2Thread1of1ForFork2_#t~short27#1_53|))))) InVars {~ends_with_10~0.offset=v_~ends_with_10~0.offset_91, ~ends_with_10~0.base=v_~ends_with_10~0.base_91, ~result_15~0=v_~result_15~0_146, thread2Thread1of1ForFork2_#t~short27#1=|v_thread2Thread1of1ForFork2_#t~short27#1_54|, #memory_int=|v_#memory_int_344|, ~i_16~0=v_~i_16~0_180} OutVars{~ends_with_10~0.offset=v_~ends_with_10~0.offset_91, ~ends_with_10~0.base=v_~ends_with_10~0.base_91, ~result_15~0=v_~result_15~0_145, thread2Thread1of1ForFork2_#t~mem25#1=|v_thread2Thread1of1ForFork2_#t~mem25#1_33|, thread2Thread1of1ForFork2_#t~mem26#1=|v_thread2Thread1of1ForFork2_#t~mem26#1_25|, thread2Thread1of1ForFork2_#t~short27#1=|v_thread2Thread1of1ForFork2_#t~short27#1_53|, #memory_int=|v_#memory_int_344|, ~i_16~0=v_~i_16~0_180} AuxVars[] AssignedVars[~result_15~0, thread2Thread1of1ForFork2_#t~mem25#1, thread2Thread1of1ForFork2_#t~mem26#1, thread2Thread1of1ForFork2_#t~short27#1] and [2954] $Ultimate##0-->L81-4: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| 0)) (= (ite (and (= (mod v_~is_null_5~0_In_24 256) 0) (= (mod v_~is_null_9~0_In_21 256) 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|) (= v_~break_17~0_Out_42 0) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3| 256) 0)) (= v_~i_16~0_Out_36 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|)) InVars {~is_null_5~0=v_~is_null_5~0_In_24, thread2Thread1of1ForFork2_#t~nondet23#1=|v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3|, ~is_null_9~0=v_~is_null_9~0_In_21} OutVars{~is_null_5~0=v_~is_null_5~0_In_24, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|, ~is_null_9~0=v_~is_null_9~0_In_21, ~break_17~0=v_~break_17~0_Out_42, ~i_16~0=v_~i_16~0_Out_36} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~nondet23#1, ~break_17~0, ~i_16~0] [2022-12-06 05:09:55,740 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:09:55,741 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1151 [2022-12-06 05:09:55,741 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 154 transitions, 1403 flow [2022-12-06 05:09:55,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:09:55,741 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:09:55,741 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:09:55,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 05:09:55,741 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:09:55,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:09:55,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1899031142, now seen corresponding path program 1 times [2022-12-06 05:09:55,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:09:55,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73073904] [2022-12-06 05:09:55,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:09:55,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:09:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:09:55,983 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:09:55,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:09:55,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73073904] [2022-12-06 05:09:55,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73073904] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:09:55,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193166787] [2022-12-06 05:09:55,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:09:55,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:09:55,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:09:55,986 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:09:55,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 05:09:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:09:56,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 05:09:56,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:09:56,279 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:09:56,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:09:56,379 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:09:56,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193166787] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:09:56,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:09:56,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-06 05:09:56,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467783964] [2022-12-06 05:09:56,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:09:56,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:09:56,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:09:56,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:09:56,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:09:56,380 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-06 05:09:56,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 154 transitions, 1403 flow. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:09:56,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:09:56,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-06 05:09:56,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:10:03,376 INFO L130 PetriNetUnfolder]: 34914/47046 cut-off events. [2022-12-06 05:10:03,376 INFO L131 PetriNetUnfolder]: For 102593/102593 co-relation queries the response was YES. [2022-12-06 05:10:03,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177617 conditions, 47046 events. 34914/47046 cut-off events. For 102593/102593 co-relation queries the response was YES. Maximal size of possible extension queue 1171. Compared 261384 event pairs, 9923 based on Foata normal form. 3/38721 useless extension candidates. Maximal degree in co-relation 177548. Up to 45983 conditions per place. [2022-12-06 05:10:03,821 INFO L137 encePairwiseOnDemand]: 47/58 looper letters, 149 selfloop transitions, 14 changer transitions 40/203 dead transitions. [2022-12-06 05:10:03,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 203 transitions, 2118 flow [2022-12-06 05:10:03,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:10:03,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:10:03,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-12-06 05:10:03,822 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40948275862068967 [2022-12-06 05:10:03,822 INFO L175 Difference]: Start difference. First operand has 97 places, 154 transitions, 1403 flow. Second operand 4 states and 95 transitions. [2022-12-06 05:10:03,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 203 transitions, 2118 flow [2022-12-06 05:10:05,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 203 transitions, 2082 flow, removed 15 selfloop flow, removed 3 redundant places. [2022-12-06 05:10:05,471 INFO L231 Difference]: Finished difference. Result has 100 places, 151 transitions, 1363 flow [2022-12-06 05:10:05,471 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1337, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1363, PETRI_PLACES=100, PETRI_TRANSITIONS=151} [2022-12-06 05:10:05,471 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 54 predicate places. [2022-12-06 05:10:05,471 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:10:05,471 INFO L89 Accepts]: Start accepts. Operand has 100 places, 151 transitions, 1363 flow [2022-12-06 05:10:05,472 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:10:05,472 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:10:05,473 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 151 transitions, 1363 flow [2022-12-06 05:10:05,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 151 transitions, 1363 flow [2022-12-06 05:10:05,948 INFO L130 PetriNetUnfolder]: 1118/2904 cut-off events. [2022-12-06 05:10:05,948 INFO L131 PetriNetUnfolder]: For 5333/5791 co-relation queries the response was YES. [2022-12-06 05:10:05,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8557 conditions, 2904 events. 1118/2904 cut-off events. For 5333/5791 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 24515 event pairs, 30 based on Foata normal form. 59/2330 useless extension candidates. Maximal degree in co-relation 8501. Up to 700 conditions per place. [2022-12-06 05:10:05,984 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 151 transitions, 1363 flow [2022-12-06 05:10:05,984 INFO L188 LiptonReduction]: Number of co-enabled transitions 2938 [2022-12-06 05:10:05,992 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:10:05,993 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 522 [2022-12-06 05:10:05,993 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 151 transitions, 1363 flow [2022-12-06 05:10:05,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:10:05,993 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:10:05,993 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:10:05,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-06 05:10:06,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 05:10:06,199 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:10:06,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:10:06,200 INFO L85 PathProgramCache]: Analyzing trace with hash -327837849, now seen corresponding path program 1 times [2022-12-06 05:10:06,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:10:06,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327568653] [2022-12-06 05:10:06,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:10:06,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:10:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:10:06,347 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-06 05:10:06,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:10:06,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327568653] [2022-12-06 05:10:06,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327568653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:10:06,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:10:06,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:10:06,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749045865] [2022-12-06 05:10:06,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:10:06,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:10:06,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:10:06,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:10:06,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:10:06,348 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 05:10:06,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 151 transitions, 1363 flow. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:10:06,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:10:06,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 05:10:06,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:10:13,073 INFO L130 PetriNetUnfolder]: 34203/46079 cut-off events. [2022-12-06 05:10:13,074 INFO L131 PetriNetUnfolder]: For 94847/94847 co-relation queries the response was YES. [2022-12-06 05:10:13,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172027 conditions, 46079 events. 34203/46079 cut-off events. For 94847/94847 co-relation queries the response was YES. Maximal size of possible extension queue 1151. Compared 255269 event pairs, 16256 based on Foata normal form. 1/37884 useless extension candidates. Maximal degree in co-relation 171961. Up to 45913 conditions per place. [2022-12-06 05:10:13,553 INFO L137 encePairwiseOnDemand]: 48/50 looper letters, 148 selfloop transitions, 0 changer transitions 22/170 dead transitions. [2022-12-06 05:10:13,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 170 transitions, 1768 flow [2022-12-06 05:10:13,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:10:13,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:10:13,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-12-06 05:10:13,554 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4533333333333333 [2022-12-06 05:10:13,554 INFO L175 Difference]: Start difference. First operand has 99 places, 151 transitions, 1363 flow. Second operand 3 states and 68 transitions. [2022-12-06 05:10:13,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 170 transitions, 1768 flow [2022-12-06 05:10:15,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 170 transitions, 1744 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 05:10:15,044 INFO L231 Difference]: Finished difference. Result has 100 places, 148 transitions, 1298 flow [2022-12-06 05:10:15,044 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1339, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1298, PETRI_PLACES=100, PETRI_TRANSITIONS=148} [2022-12-06 05:10:15,045 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 54 predicate places. [2022-12-06 05:10:15,045 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:10:15,045 INFO L89 Accepts]: Start accepts. Operand has 100 places, 148 transitions, 1298 flow [2022-12-06 05:10:15,046 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:10:15,046 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:10:15,047 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 148 transitions, 1298 flow [2022-12-06 05:10:15,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 148 transitions, 1298 flow [2022-12-06 05:10:15,390 INFO L130 PetriNetUnfolder]: 1095/2859 cut-off events. [2022-12-06 05:10:15,390 INFO L131 PetriNetUnfolder]: For 4998/5456 co-relation queries the response was YES. [2022-12-06 05:10:15,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8342 conditions, 2859 events. 1095/2859 cut-off events. For 4998/5456 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 24157 event pairs, 28 based on Foata normal form. 65/2313 useless extension candidates. Maximal degree in co-relation 8289. Up to 741 conditions per place. [2022-12-06 05:10:15,425 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 148 transitions, 1298 flow [2022-12-06 05:10:15,425 INFO L188 LiptonReduction]: Number of co-enabled transitions 2920 [2022-12-06 05:10:15,440 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:10:15,441 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 396 [2022-12-06 05:10:15,441 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 148 transitions, 1298 flow [2022-12-06 05:10:15,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:10:15,441 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:10:15,441 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:10:15,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 05:10:15,443 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:10:15,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:10:15,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1066655495, now seen corresponding path program 1 times [2022-12-06 05:10:15,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:10:15,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141034342] [2022-12-06 05:10:15,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:10:15,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:10:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:10:15,699 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:10:15,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:10:15,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141034342] [2022-12-06 05:10:15,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141034342] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:10:15,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926481527] [2022-12-06 05:10:15,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:10:15,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:10:15,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:10:15,717 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:10:15,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 05:10:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:10:15,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 05:10:15,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:10:16,081 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:10:16,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:10:16,209 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:10:16,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926481527] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:10:16,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:10:16,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2022-12-06 05:10:16,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860974630] [2022-12-06 05:10:16,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:10:16,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:10:16,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:10:16,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:10:16,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:10:16,210 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 05:10:16,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 148 transitions, 1298 flow. Second operand has 10 states, 9 states have (on average 7.888888888888889) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:10:16,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:10:16,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 05:10:16,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:10:24,832 INFO L130 PetriNetUnfolder]: 42125/57090 cut-off events. [2022-12-06 05:10:24,832 INFO L131 PetriNetUnfolder]: For 106369/106369 co-relation queries the response was YES. [2022-12-06 05:10:25,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207289 conditions, 57090 events. 42125/57090 cut-off events. For 106369/106369 co-relation queries the response was YES. Maximal size of possible extension queue 1462. Compared 332102 event pairs, 6171 based on Foata normal form. 2/46968 useless extension candidates. Maximal degree in co-relation 207215. Up to 32586 conditions per place. [2022-12-06 05:10:25,512 INFO L137 encePairwiseOnDemand]: 41/49 looper letters, 252 selfloop transitions, 37 changer transitions 31/320 dead transitions. [2022-12-06 05:10:25,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 320 transitions, 2782 flow [2022-12-06 05:10:25,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:10:25,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:10:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 182 transitions. [2022-12-06 05:10:25,514 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2022-12-06 05:10:25,514 INFO L175 Difference]: Start difference. First operand has 97 places, 148 transitions, 1298 flow. Second operand 7 states and 182 transitions. [2022-12-06 05:10:25,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 320 transitions, 2782 flow [2022-12-06 05:10:26,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 320 transitions, 2726 flow, removed 28 selfloop flow, removed 2 redundant places. [2022-12-06 05:10:26,752 INFO L231 Difference]: Finished difference. Result has 106 places, 168 transitions, 1628 flow [2022-12-06 05:10:26,752 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1274, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1628, PETRI_PLACES=106, PETRI_TRANSITIONS=168} [2022-12-06 05:10:26,757 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 60 predicate places. [2022-12-06 05:10:26,757 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:10:26,757 INFO L89 Accepts]: Start accepts. Operand has 106 places, 168 transitions, 1628 flow [2022-12-06 05:10:26,759 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:10:26,759 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:10:26,759 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 168 transitions, 1628 flow [2022-12-06 05:10:26,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 168 transitions, 1628 flow [2022-12-06 05:10:27,034 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2929] L58-->L58-7: Formula: (let ((.cse1 (= (mod v_~break_14~0_In_19 256) 0)) (.cse2 (not |v_thread1Thread1of1ForFork1_#t~short10#1_Out_6|)) (.cse0 (= (ite |v_thread1Thread1of1ForFork1_#t~short10#1_Out_6| (+ v_~i_13~0_In_26 (- 1000)) v_~result_12~0_In_15) v_~result_12~0_Out_52))) (or (and |v_thread1Thread1of1ForFork1_#t~short10#1_55| .cse0 .cse1 (let ((.cse3 (= (mod (select (select |v_#memory_int_In_61| v_~ends_with_2~0.base_In_13) (+ v_~i_13~0_In_26 v_~ends_with_2~0.offset_In_13)) 256) 0))) (or (and .cse2 .cse3) (and (not .cse3) |v_thread1Thread1of1ForFork1_#t~short10#1_Out_6|)))) (and (not .cse1) .cse2 .cse0))) InVars {~i_13~0=v_~i_13~0_In_26, #memory_int=|v_#memory_int_In_61|, ~result_12~0=v_~result_12~0_In_15, ~break_14~0=v_~break_14~0_In_19, ~ends_with_2~0.base=v_~ends_with_2~0.base_In_13, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_In_13} OutVars{thread1Thread1of1ForFork1_#t~short10#1=|v_thread1Thread1of1ForFork1_#t~short10#1_Out_6|, ~i_13~0=v_~i_13~0_In_26, thread1Thread1of1ForFork1_#t~mem9#1=|v_thread1Thread1of1ForFork1_#t~mem9#1_Out_8|, #memory_int=|v_#memory_int_In_61|, ~result_12~0=v_~result_12~0_Out_52, ~break_14~0=v_~break_14~0_In_19, ~ends_with_2~0.base=v_~ends_with_2~0.base_In_13, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_In_13} AuxVars[|v_thread1Thread1of1ForFork1_#t~short10#1_55|] AssignedVars[thread1Thread1of1ForFork1_#t~short10#1, thread1Thread1of1ForFork1_#t~mem9#1, ~result_12~0][138], [Black: 645#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 1210#(or (<= (+ ~result_12~0 995) 0) (and (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)) (or (<= (+ ~result_12~0 ~get_subject_7~0) ~get_subject_3~0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 767#(< (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|), Black: 1214#(and (or (<= (+ ~result_12~0 995) 0) (and (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)) (or (<= (+ ~result_12~0 ~get_subject_7~0) ~get_subject_3~0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))) (or (<= (+ ~result_12~0 995) 0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (<= (+ ~result_12~0 ~get_subject_7~0) (+ ~result_18~0 ~get_subject_11~0)))) (<= 1005 ~result_18~0))), Black: 763#(< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|), 1514#true, 1241#(and (= ~i_16~0 0) (= ~break_17~0 0)), 985#true, 517#L58-7true, Black: 1223#(or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= (+ ~result_12~0 ~get_subject_7~0) (+ ~result_18~0 ~get_subject_11~0))) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0)), Black: 1222#(or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)), Black: 1226#(and (or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)) (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= (+ ~result_12~0 ~get_subject_7~0) (+ ~result_18~0 ~get_subject_11~0))) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0))), 1183#true, 634#true, Black: 979#(and (or (and (not (= (mod ~is_null_9~0 256) 0)) (<= 0 (+ ~result_15~0 2147483648)) (= (+ ~result_15~0 ~get_subject_11~0) ~get_subject_7~0) (<= ~result_15~0 2147483647) (not (= (mod ~is_null_5~0 256) 0))) (and (= (mod ~is_null_9~0 256) 0) (= ~result_15~0 1005) (not (= (mod ~is_null_5~0 256) 0))) (and (not (= (mod ~is_null_9~0 256) 0)) (= (+ ~result_15~0 995) 0) (= (mod ~is_null_5~0 256) 0))) (or (and (<= 0 (+ ~result_18~0 2147483648)) (not (= (mod ~is_null_1~0 256) 0)) (<= ~result_18~0 2147483647) (or (= (+ ~result_18~0 ~get_subject_7~0) (+ ~result_15~0 ~get_subject_3~0)) (= (mod ~is_null_5~0 256) 0))) (and (not (= (mod ~is_null_1~0 256) 0)) (= ~result_18~0 1005) (= ~result_15~0 1005)) (and (= (+ ~result_18~0 995) 0) (= (mod ~is_null_1~0 256) 0)))), Black: 1237#(and (= ~break_20~0 0) (= ~i_19~0 0)), Black: 948#(or (and (not (= (mod ~is_null_9~0 256) 0)) (<= 0 (+ ~result_15~0 2147483648)) (= (+ ~result_15~0 ~get_subject_11~0) ~get_subject_7~0) (<= ~result_15~0 2147483647) (not (= (mod ~is_null_5~0 256) 0))) (and (= (mod ~is_null_9~0 256) 0) (= ~result_15~0 1005) (not (= (mod ~is_null_5~0 256) 0))) (and (not (= (mod ~is_null_9~0 256) 0)) (= (+ ~result_15~0 995) 0) (= (mod ~is_null_5~0 256) 0))), 180#L81-4true, Black: 1245#(and (= ~break_14~0 0) (= ~i_13~0 0)), Black: 991#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 4) (= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 1264#true, 587#L108-4true, Black: 1247#true, Black: 1582#(or (and (<= ~result_12~0 2147483647) (<= 0 (+ ~result_12~0 2147483648)) (not (= (mod ~is_null_1~0 256) 0)) (not (= (mod ~is_null_5~0 256) 0))) (and (not (= (mod ~is_null_1~0 256) 0)) (= ~result_12~0 1005)) (and (= (+ ~result_12~0 995) 0) (not (= (mod ~is_null_5~0 256) 0)))), Black: 1189#(and (or (<= (+ ~result_15~0 995) 0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (<= 1005 ~result_18~0) (and (<= (+ ~result_15~0 ~get_subject_3~0) (+ ~result_18~0 ~get_subject_7~0)) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))) (or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0))), Black: 1192#(and (or (<= (+ ~result_15~0 995) 0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (<= 1005 ~result_18~0) (and (<= (+ ~result_15~0 ~get_subject_3~0) (+ ~result_18~0 ~get_subject_7~0)) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))) (or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)) (or (<= (+ ~result_15~0 995) 0) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0) (<= (+ ~result_15~0 ~result_12~0) ~result_18~0))), Black: 1765#(and (or (<= ~result_12~0 0) (= (mod ~is_null_9~0 256) 0)) (or (<= ~result_12~0 0) (< 0 ~result_18~0))), Black: 1185#(or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)), Black: 1676#(or (<= ~result_12~0 0) (= (mod ~is_null_9~0 256) 0)), 1266#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 835#(or (and (= (mod ~is_null_1~0 256) 0) (= (+ ~result_12~0 995) 0) (not (= (mod ~is_null_5~0 256) 0))) (and (not (= (mod ~is_null_1~0 256) 0)) (= ~result_12~0 1005) (= (mod ~is_null_5~0 256) 0)) (and (= ~get_subject_3~0 (+ ~result_12~0 ~get_subject_7~0)) (not (= (mod ~is_null_1~0 256) 0)) (<= ~get_subject_3~0 (+ 2147483647 ~get_subject_7~0)) (<= ~get_subject_7~0 (+ ~get_subject_3~0 2147483648)) (not (= (mod ~is_null_5~0 256) 0)))), Black: 1767#(and (not (= (mod ~is_null_1~0 256) 0)) (= ~result_18~0 1005) (= (mod ~is_null_9~0 256) 0) (= ~result_12~0 1005)), 52#L158-4true, Black: 1198#(or (<= (+ ~result_15~0 995) 0) (and (or (<= (+ ~result_15~0 ~get_subject_11~0) ~get_subject_7~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), 1220#true, Black: 1204#(and (or (<= (+ ~result_15~0 995) 0) (and (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)) (or (<= (+ ~result_15~0 ~result_12~0 ~get_subject_11~0) ~get_subject_3~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256))))) (<= (+ ~result_12~0 995) 0)) (or (<= (+ ~result_15~0 995) 0) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0) (<= (+ ~result_15~0 ~result_12~0) ~result_18~0)) (or (<= (+ ~result_15~0 995) 0) (and (or (<= (+ ~result_15~0 ~get_subject_11~0) ~get_subject_7~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))))), 1249#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 1202#(and (or (<= (+ ~result_15~0 995) 0) (and (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)) (or (<= (+ ~result_15~0 ~result_12~0 ~get_subject_11~0) ~get_subject_3~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256))))) (<= (+ ~result_12~0 995) 0)) (or (<= (+ ~result_15~0 995) 0) (and (or (<= (+ ~result_15~0 ~get_subject_11~0) ~get_subject_7~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))))), Black: 632#(and (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0) (= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|))]) [2022-12-06 05:10:27,035 INFO L382 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-06 05:10:27,035 INFO L385 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-06 05:10:27,035 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-06 05:10:27,035 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-06 05:10:27,037 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2929] L58-->L58-7: Formula: (let ((.cse1 (= (mod v_~break_14~0_In_19 256) 0)) (.cse2 (not |v_thread1Thread1of1ForFork1_#t~short10#1_Out_6|)) (.cse0 (= (ite |v_thread1Thread1of1ForFork1_#t~short10#1_Out_6| (+ v_~i_13~0_In_26 (- 1000)) v_~result_12~0_In_15) v_~result_12~0_Out_52))) (or (and |v_thread1Thread1of1ForFork1_#t~short10#1_55| .cse0 .cse1 (let ((.cse3 (= (mod (select (select |v_#memory_int_In_61| v_~ends_with_2~0.base_In_13) (+ v_~i_13~0_In_26 v_~ends_with_2~0.offset_In_13)) 256) 0))) (or (and .cse2 .cse3) (and (not .cse3) |v_thread1Thread1of1ForFork1_#t~short10#1_Out_6|)))) (and (not .cse1) .cse2 .cse0))) InVars {~i_13~0=v_~i_13~0_In_26, #memory_int=|v_#memory_int_In_61|, ~result_12~0=v_~result_12~0_In_15, ~break_14~0=v_~break_14~0_In_19, ~ends_with_2~0.base=v_~ends_with_2~0.base_In_13, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_In_13} OutVars{thread1Thread1of1ForFork1_#t~short10#1=|v_thread1Thread1of1ForFork1_#t~short10#1_Out_6|, ~i_13~0=v_~i_13~0_In_26, thread1Thread1of1ForFork1_#t~mem9#1=|v_thread1Thread1of1ForFork1_#t~mem9#1_Out_8|, #memory_int=|v_#memory_int_In_61|, ~result_12~0=v_~result_12~0_Out_52, ~break_14~0=v_~break_14~0_In_19, ~ends_with_2~0.base=v_~ends_with_2~0.base_In_13, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_In_13} AuxVars[|v_thread1Thread1of1ForFork1_#t~short10#1_55|] AssignedVars[thread1Thread1of1ForFork1_#t~short10#1, thread1Thread1of1ForFork1_#t~mem9#1, ~result_12~0][150], [Black: 645#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 1210#(or (<= (+ ~result_12~0 995) 0) (and (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)) (or (<= (+ ~result_12~0 ~get_subject_7~0) ~get_subject_3~0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 767#(< (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|), Black: 1214#(and (or (<= (+ ~result_12~0 995) 0) (and (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)) (or (<= (+ ~result_12~0 ~get_subject_7~0) ~get_subject_3~0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))) (or (<= (+ ~result_12~0 995) 0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (<= (+ ~result_12~0 ~get_subject_7~0) (+ ~result_18~0 ~get_subject_11~0)))) (<= 1005 ~result_18~0))), Black: 763#(< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|), 1514#true, 1241#(and (= ~i_16~0 0) (= ~break_17~0 0)), 985#true, Black: 1223#(or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= (+ ~result_12~0 ~get_subject_7~0) (+ ~result_18~0 ~get_subject_11~0))) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0)), 517#L58-7true, Black: 1222#(or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)), Black: 1226#(and (or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)) (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= (+ ~result_12~0 ~get_subject_7~0) (+ ~result_18~0 ~get_subject_11~0))) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0))), 1183#true, 634#true, Black: 979#(and (or (and (not (= (mod ~is_null_9~0 256) 0)) (<= 0 (+ ~result_15~0 2147483648)) (= (+ ~result_15~0 ~get_subject_11~0) ~get_subject_7~0) (<= ~result_15~0 2147483647) (not (= (mod ~is_null_5~0 256) 0))) (and (= (mod ~is_null_9~0 256) 0) (= ~result_15~0 1005) (not (= (mod ~is_null_5~0 256) 0))) (and (not (= (mod ~is_null_9~0 256) 0)) (= (+ ~result_15~0 995) 0) (= (mod ~is_null_5~0 256) 0))) (or (and (<= 0 (+ ~result_18~0 2147483648)) (not (= (mod ~is_null_1~0 256) 0)) (<= ~result_18~0 2147483647) (or (= (+ ~result_18~0 ~get_subject_7~0) (+ ~result_15~0 ~get_subject_3~0)) (= (mod ~is_null_5~0 256) 0))) (and (not (= (mod ~is_null_1~0 256) 0)) (= ~result_18~0 1005) (= ~result_15~0 1005)) (and (= (+ ~result_18~0 995) 0) (= (mod ~is_null_1~0 256) 0)))), Black: 1237#(and (= ~break_20~0 0) (= ~i_19~0 0)), Black: 948#(or (and (not (= (mod ~is_null_9~0 256) 0)) (<= 0 (+ ~result_15~0 2147483648)) (= (+ ~result_15~0 ~get_subject_11~0) ~get_subject_7~0) (<= ~result_15~0 2147483647) (not (= (mod ~is_null_5~0 256) 0))) (and (= (mod ~is_null_9~0 256) 0) (= ~result_15~0 1005) (not (= (mod ~is_null_5~0 256) 0))) (and (not (= (mod ~is_null_9~0 256) 0)) (= (+ ~result_15~0 995) 0) (= (mod ~is_null_5~0 256) 0))), 180#L81-4true, Black: 1245#(and (= ~break_14~0 0) (= ~i_13~0 0)), Black: 991#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 4) (= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 1264#true, Black: 1247#true, 587#L108-4true, Black: 1582#(or (and (<= ~result_12~0 2147483647) (<= 0 (+ ~result_12~0 2147483648)) (not (= (mod ~is_null_1~0 256) 0)) (not (= (mod ~is_null_5~0 256) 0))) (and (not (= (mod ~is_null_1~0 256) 0)) (= ~result_12~0 1005)) (and (= (+ ~result_12~0 995) 0) (not (= (mod ~is_null_5~0 256) 0)))), Black: 1189#(and (or (<= (+ ~result_15~0 995) 0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (<= 1005 ~result_18~0) (and (<= (+ ~result_15~0 ~get_subject_3~0) (+ ~result_18~0 ~get_subject_7~0)) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))) (or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0))), Black: 1192#(and (or (<= (+ ~result_15~0 995) 0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (<= 1005 ~result_18~0) (and (<= (+ ~result_15~0 ~get_subject_3~0) (+ ~result_18~0 ~get_subject_7~0)) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))) (or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)) (or (<= (+ ~result_15~0 995) 0) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0) (<= (+ ~result_15~0 ~result_12~0) ~result_18~0))), Black: 1765#(and (or (<= ~result_12~0 0) (= (mod ~is_null_9~0 256) 0)) (or (<= ~result_12~0 0) (< 0 ~result_18~0))), Black: 1676#(or (<= ~result_12~0 0) (= (mod ~is_null_9~0 256) 0)), Black: 1185#(or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)), 1266#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 835#(or (and (= (mod ~is_null_1~0 256) 0) (= (+ ~result_12~0 995) 0) (not (= (mod ~is_null_5~0 256) 0))) (and (not (= (mod ~is_null_1~0 256) 0)) (= ~result_12~0 1005) (= (mod ~is_null_5~0 256) 0)) (and (= ~get_subject_3~0 (+ ~result_12~0 ~get_subject_7~0)) (not (= (mod ~is_null_1~0 256) 0)) (<= ~get_subject_3~0 (+ 2147483647 ~get_subject_7~0)) (<= ~get_subject_7~0 (+ ~get_subject_3~0 2147483648)) (not (= (mod ~is_null_5~0 256) 0)))), Black: 1767#(and (not (= (mod ~is_null_1~0 256) 0)) (= ~result_18~0 1005) (= (mod ~is_null_9~0 256) 0) (= ~result_12~0 1005)), 52#L158-4true, Black: 1198#(or (<= (+ ~result_15~0 995) 0) (and (or (<= (+ ~result_15~0 ~get_subject_11~0) ~get_subject_7~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), 1220#true, 1249#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 1204#(and (or (<= (+ ~result_15~0 995) 0) (and (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)) (or (<= (+ ~result_15~0 ~result_12~0 ~get_subject_11~0) ~get_subject_3~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256))))) (<= (+ ~result_12~0 995) 0)) (or (<= (+ ~result_15~0 995) 0) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0) (<= (+ ~result_15~0 ~result_12~0) ~result_18~0)) (or (<= (+ ~result_15~0 995) 0) (and (or (<= (+ ~result_15~0 ~get_subject_11~0) ~get_subject_7~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))))), Black: 1202#(and (or (<= (+ ~result_15~0 995) 0) (and (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)) (or (<= (+ ~result_15~0 ~result_12~0 ~get_subject_11~0) ~get_subject_3~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256))))) (<= (+ ~result_12~0 995) 0)) (or (<= (+ ~result_15~0 995) 0) (and (or (<= (+ ~result_15~0 ~get_subject_11~0) ~get_subject_7~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))))), Black: 632#(and (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0) (= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|))]) [2022-12-06 05:10:27,037 INFO L382 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-06 05:10:27,037 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-06 05:10:27,047 INFO L385 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-06 05:10:27,047 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-06 05:10:27,087 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2929] L58-->L58-7: Formula: (let ((.cse1 (= (mod v_~break_14~0_In_19 256) 0)) (.cse2 (not |v_thread1Thread1of1ForFork1_#t~short10#1_Out_6|)) (.cse0 (= (ite |v_thread1Thread1of1ForFork1_#t~short10#1_Out_6| (+ v_~i_13~0_In_26 (- 1000)) v_~result_12~0_In_15) v_~result_12~0_Out_52))) (or (and |v_thread1Thread1of1ForFork1_#t~short10#1_55| .cse0 .cse1 (let ((.cse3 (= (mod (select (select |v_#memory_int_In_61| v_~ends_with_2~0.base_In_13) (+ v_~i_13~0_In_26 v_~ends_with_2~0.offset_In_13)) 256) 0))) (or (and .cse2 .cse3) (and (not .cse3) |v_thread1Thread1of1ForFork1_#t~short10#1_Out_6|)))) (and (not .cse1) .cse2 .cse0))) InVars {~i_13~0=v_~i_13~0_In_26, #memory_int=|v_#memory_int_In_61|, ~result_12~0=v_~result_12~0_In_15, ~break_14~0=v_~break_14~0_In_19, ~ends_with_2~0.base=v_~ends_with_2~0.base_In_13, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_In_13} OutVars{thread1Thread1of1ForFork1_#t~short10#1=|v_thread1Thread1of1ForFork1_#t~short10#1_Out_6|, ~i_13~0=v_~i_13~0_In_26, thread1Thread1of1ForFork1_#t~mem9#1=|v_thread1Thread1of1ForFork1_#t~mem9#1_Out_8|, #memory_int=|v_#memory_int_In_61|, ~result_12~0=v_~result_12~0_Out_52, ~break_14~0=v_~break_14~0_In_19, ~ends_with_2~0.base=v_~ends_with_2~0.base_In_13, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_In_13} AuxVars[|v_thread1Thread1of1ForFork1_#t~short10#1_55|] AssignedVars[thread1Thread1of1ForFork1_#t~short10#1, thread1Thread1of1ForFork1_#t~mem9#1, ~result_12~0][150], [Black: 645#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 1210#(or (<= (+ ~result_12~0 995) 0) (and (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)) (or (<= (+ ~result_12~0 ~get_subject_7~0) ~get_subject_3~0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 767#(< (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|), Black: 1214#(and (or (<= (+ ~result_12~0 995) 0) (and (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)) (or (<= (+ ~result_12~0 ~get_subject_7~0) ~get_subject_3~0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))) (or (<= (+ ~result_12~0 995) 0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (<= (+ ~result_12~0 ~get_subject_7~0) (+ ~result_18~0 ~get_subject_11~0)))) (<= 1005 ~result_18~0))), Black: 763#(< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|), 1514#true, 1241#(and (= ~i_16~0 0) (= ~break_17~0 0)), 985#true, Black: 1223#(or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= (+ ~result_12~0 ~get_subject_7~0) (+ ~result_18~0 ~get_subject_11~0))) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0)), 517#L58-7true, Black: 1222#(or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)), Black: 1226#(and (or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)) (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= (+ ~result_12~0 ~get_subject_7~0) (+ ~result_18~0 ~get_subject_11~0))) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0))), 1183#true, 634#true, Black: 979#(and (or (and (not (= (mod ~is_null_9~0 256) 0)) (<= 0 (+ ~result_15~0 2147483648)) (= (+ ~result_15~0 ~get_subject_11~0) ~get_subject_7~0) (<= ~result_15~0 2147483647) (not (= (mod ~is_null_5~0 256) 0))) (and (= (mod ~is_null_9~0 256) 0) (= ~result_15~0 1005) (not (= (mod ~is_null_5~0 256) 0))) (and (not (= (mod ~is_null_9~0 256) 0)) (= (+ ~result_15~0 995) 0) (= (mod ~is_null_5~0 256) 0))) (or (and (<= 0 (+ ~result_18~0 2147483648)) (not (= (mod ~is_null_1~0 256) 0)) (<= ~result_18~0 2147483647) (or (= (+ ~result_18~0 ~get_subject_7~0) (+ ~result_15~0 ~get_subject_3~0)) (= (mod ~is_null_5~0 256) 0))) (and (not (= (mod ~is_null_1~0 256) 0)) (= ~result_18~0 1005) (= ~result_15~0 1005)) (and (= (+ ~result_18~0 995) 0) (= (mod ~is_null_1~0 256) 0)))), Black: 1237#(and (= ~break_20~0 0) (= ~i_19~0 0)), Black: 948#(or (and (not (= (mod ~is_null_9~0 256) 0)) (<= 0 (+ ~result_15~0 2147483648)) (= (+ ~result_15~0 ~get_subject_11~0) ~get_subject_7~0) (<= ~result_15~0 2147483647) (not (= (mod ~is_null_5~0 256) 0))) (and (= (mod ~is_null_9~0 256) 0) (= ~result_15~0 1005) (not (= (mod ~is_null_5~0 256) 0))) (and (not (= (mod ~is_null_9~0 256) 0)) (= (+ ~result_15~0 995) 0) (= (mod ~is_null_5~0 256) 0))), 180#L81-4true, Black: 1245#(and (= ~break_14~0 0) (= ~i_13~0 0)), Black: 991#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 4) (= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 1264#true, Black: 1247#true, Black: 1582#(or (and (<= ~result_12~0 2147483647) (<= 0 (+ ~result_12~0 2147483648)) (not (= (mod ~is_null_1~0 256) 0)) (not (= (mod ~is_null_5~0 256) 0))) (and (not (= (mod ~is_null_1~0 256) 0)) (= ~result_12~0 1005)) (and (= (+ ~result_12~0 995) 0) (not (= (mod ~is_null_5~0 256) 0)))), Black: 1189#(and (or (<= (+ ~result_15~0 995) 0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (<= 1005 ~result_18~0) (and (<= (+ ~result_15~0 ~get_subject_3~0) (+ ~result_18~0 ~get_subject_7~0)) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))) (or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0))), Black: 1192#(and (or (<= (+ ~result_15~0 995) 0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (<= 1005 ~result_18~0) (and (<= (+ ~result_15~0 ~get_subject_3~0) (+ ~result_18~0 ~get_subject_7~0)) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))) (or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)) (or (<= (+ ~result_15~0 995) 0) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0) (<= (+ ~result_15~0 ~result_12~0) ~result_18~0))), Black: 1765#(and (or (<= ~result_12~0 0) (= (mod ~is_null_9~0 256) 0)) (or (<= ~result_12~0 0) (< 0 ~result_18~0))), 465#thread3EXITtrue, Black: 1676#(or (<= ~result_12~0 0) (= (mod ~is_null_9~0 256) 0)), Black: 1185#(or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)), 1266#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 835#(or (and (= (mod ~is_null_1~0 256) 0) (= (+ ~result_12~0 995) 0) (not (= (mod ~is_null_5~0 256) 0))) (and (not (= (mod ~is_null_1~0 256) 0)) (= ~result_12~0 1005) (= (mod ~is_null_5~0 256) 0)) (and (= ~get_subject_3~0 (+ ~result_12~0 ~get_subject_7~0)) (not (= (mod ~is_null_1~0 256) 0)) (<= ~get_subject_3~0 (+ 2147483647 ~get_subject_7~0)) (<= ~get_subject_7~0 (+ ~get_subject_3~0 2147483648)) (not (= (mod ~is_null_5~0 256) 0)))), Black: 1767#(and (not (= (mod ~is_null_1~0 256) 0)) (= ~result_18~0 1005) (= (mod ~is_null_9~0 256) 0) (= ~result_12~0 1005)), 52#L158-4true, Black: 1198#(or (<= (+ ~result_15~0 995) 0) (and (or (<= (+ ~result_15~0 ~get_subject_11~0) ~get_subject_7~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), 1220#true, Black: 1204#(and (or (<= (+ ~result_15~0 995) 0) (and (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)) (or (<= (+ ~result_15~0 ~result_12~0 ~get_subject_11~0) ~get_subject_3~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256))))) (<= (+ ~result_12~0 995) 0)) (or (<= (+ ~result_15~0 995) 0) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0) (<= (+ ~result_15~0 ~result_12~0) ~result_18~0)) (or (<= (+ ~result_15~0 995) 0) (and (or (<= (+ ~result_15~0 ~get_subject_11~0) ~get_subject_7~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))))), 1249#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 1202#(and (or (<= (+ ~result_15~0 995) 0) (and (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)) (or (<= (+ ~result_15~0 ~result_12~0 ~get_subject_11~0) ~get_subject_3~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256))))) (<= (+ ~result_12~0 995) 0)) (or (<= (+ ~result_15~0 995) 0) (and (or (<= (+ ~result_15~0 ~get_subject_11~0) ~get_subject_7~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))))), Black: 632#(and (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0) (= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|))]) [2022-12-06 05:10:27,087 INFO L382 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-06 05:10:27,087 INFO L385 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-06 05:10:27,087 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-06 05:10:27,087 INFO L385 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-06 05:10:27,211 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2152] thread2EXIT-->L160-2: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem95#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_#t~mem95#1=|v_ULTIMATE.start_main_#t~mem95#1_5|, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_#t~mem95#1=|v_ULTIMATE.start_main_#t~mem95#1_5|, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][164], [Black: 645#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 1210#(or (<= (+ ~result_12~0 995) 0) (and (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)) (or (<= (+ ~result_12~0 ~get_subject_7~0) ~get_subject_3~0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 767#(< (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|), Black: 1214#(and (or (<= (+ ~result_12~0 995) 0) (and (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)) (or (<= (+ ~result_12~0 ~get_subject_7~0) ~get_subject_3~0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))) (or (<= (+ ~result_12~0 995) 0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (<= (+ ~result_12~0 ~get_subject_7~0) (+ ~result_18~0 ~get_subject_11~0)))) (<= 1005 ~result_18~0))), Black: 763#(< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|), 1514#true, 985#true, Black: 1223#(or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= (+ ~result_12~0 ~get_subject_7~0) (+ ~result_18~0 ~get_subject_11~0))) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0)), Black: 1226#(and (or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)) (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= (+ ~result_12~0 ~get_subject_7~0) (+ ~result_18~0 ~get_subject_11~0))) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0))), 634#true, Black: 979#(and (or (and (not (= (mod ~is_null_9~0 256) 0)) (<= 0 (+ ~result_15~0 2147483648)) (= (+ ~result_15~0 ~get_subject_11~0) ~get_subject_7~0) (<= ~result_15~0 2147483647) (not (= (mod ~is_null_5~0 256) 0))) (and (= (mod ~is_null_9~0 256) 0) (= ~result_15~0 1005) (not (= (mod ~is_null_5~0 256) 0))) (and (not (= (mod ~is_null_9~0 256) 0)) (= (+ ~result_15~0 995) 0) (= (mod ~is_null_5~0 256) 0))) (or (and (<= 0 (+ ~result_18~0 2147483648)) (not (= (mod ~is_null_1~0 256) 0)) (<= ~result_18~0 2147483647) (or (= (+ ~result_18~0 ~get_subject_7~0) (+ ~result_15~0 ~get_subject_3~0)) (= (mod ~is_null_5~0 256) 0))) (and (not (= (mod ~is_null_1~0 256) 0)) (= ~result_18~0 1005) (= ~result_15~0 1005)) (and (= (+ ~result_18~0 995) 0) (= (mod ~is_null_1~0 256) 0)))), Black: 1237#(and (= ~break_20~0 0) (= ~i_19~0 0)), Black: 948#(or (and (not (= (mod ~is_null_9~0 256) 0)) (<= 0 (+ ~result_15~0 2147483648)) (= (+ ~result_15~0 ~get_subject_11~0) ~get_subject_7~0) (<= ~result_15~0 2147483647) (not (= (mod ~is_null_5~0 256) 0))) (and (= (mod ~is_null_9~0 256) 0) (= ~result_15~0 1005) (not (= (mod ~is_null_5~0 256) 0))) (and (not (= (mod ~is_null_9~0 256) 0)) (= (+ ~result_15~0 995) 0) (= (mod ~is_null_5~0 256) 0))), 539#L160-2true, Black: 1241#(and (= ~i_16~0 0) (= ~break_17~0 0)), Black: 1245#(and (= ~break_14~0 0) (= ~i_13~0 0)), Black: 991#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 4) (= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 1264#true, Black: 1247#true, Black: 1582#(or (and (<= ~result_12~0 2147483647) (<= 0 (+ ~result_12~0 2147483648)) (not (= (mod ~is_null_1~0 256) 0)) (not (= (mod ~is_null_5~0 256) 0))) (and (not (= (mod ~is_null_1~0 256) 0)) (= ~result_12~0 1005)) (and (= (+ ~result_12~0 995) 0) (not (= (mod ~is_null_5~0 256) 0)))), Black: 1189#(and (or (<= (+ ~result_15~0 995) 0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (<= 1005 ~result_18~0) (and (<= (+ ~result_15~0 ~get_subject_3~0) (+ ~result_18~0 ~get_subject_7~0)) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))) (or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0))), 465#thread3EXITtrue, Black: 1765#(and (or (<= ~result_12~0 0) (= (mod ~is_null_9~0 256) 0)) (or (<= ~result_12~0 0) (< 0 ~result_18~0))), Black: 1192#(and (or (<= (+ ~result_15~0 995) 0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (<= 1005 ~result_18~0) (and (<= (+ ~result_15~0 ~get_subject_3~0) (+ ~result_18~0 ~get_subject_7~0)) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))) (or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)) (or (<= (+ ~result_15~0 995) 0) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0) (<= (+ ~result_15~0 ~result_12~0) ~result_18~0))), 1185#(or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)), Black: 1676#(or (<= ~result_12~0 0) (= (mod ~is_null_9~0 256) 0)), 1266#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 835#(or (and (= (mod ~is_null_1~0 256) 0) (= (+ ~result_12~0 995) 0) (not (= (mod ~is_null_5~0 256) 0))) (and (not (= (mod ~is_null_1~0 256) 0)) (= ~result_12~0 1005) (= (mod ~is_null_5~0 256) 0)) (and (= ~get_subject_3~0 (+ ~result_12~0 ~get_subject_7~0)) (not (= (mod ~is_null_1~0 256) 0)) (<= ~get_subject_3~0 (+ 2147483647 ~get_subject_7~0)) (<= ~get_subject_7~0 (+ ~get_subject_3~0 2147483648)) (not (= (mod ~is_null_5~0 256) 0)))), Black: 1767#(and (not (= (mod ~is_null_1~0 256) 0)) (= ~result_18~0 1005) (= (mod ~is_null_9~0 256) 0) (= ~result_12~0 1005)), 1222#(or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)), Black: 1198#(or (<= (+ ~result_15~0 995) 0) (and (or (<= (+ ~result_15~0 ~get_subject_11~0) ~get_subject_7~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 1204#(and (or (<= (+ ~result_15~0 995) 0) (and (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)) (or (<= (+ ~result_15~0 ~result_12~0 ~get_subject_11~0) ~get_subject_3~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256))))) (<= (+ ~result_12~0 995) 0)) (or (<= (+ ~result_15~0 995) 0) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0) (<= (+ ~result_15~0 ~result_12~0) ~result_18~0)) (or (<= (+ ~result_15~0 995) 0) (and (or (<= (+ ~result_15~0 ~get_subject_11~0) ~get_subject_7~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))))), 1249#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 1202#(and (or (<= (+ ~result_15~0 995) 0) (and (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)) (or (<= (+ ~result_15~0 ~result_12~0 ~get_subject_11~0) ~get_subject_3~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256))))) (<= (+ ~result_12~0 995) 0)) (or (<= (+ ~result_15~0 995) 0) (and (or (<= (+ ~result_15~0 ~get_subject_11~0) ~get_subject_7~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))))), Black: 632#(and (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0) (= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|))]) [2022-12-06 05:10:27,211 INFO L382 tUnfolder$Statistics]: this new event has 45 ancestors and is not cut-off event [2022-12-06 05:10:27,211 INFO L385 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2022-12-06 05:10:27,213 INFO L385 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2022-12-06 05:10:27,213 INFO L385 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2022-12-06 05:10:27,217 INFO L130 PetriNetUnfolder]: 1419/3675 cut-off events. [2022-12-06 05:10:27,217 INFO L131 PetriNetUnfolder]: For 8299/8718 co-relation queries the response was YES. [2022-12-06 05:10:27,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11294 conditions, 3675 events. 1419/3675 cut-off events. For 8299/8718 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 32894 event pairs, 33 based on Foata normal form. 82/3042 useless extension candidates. Maximal degree in co-relation 11218. Up to 887 conditions per place. [2022-12-06 05:10:27,265 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 168 transitions, 1628 flow [2022-12-06 05:10:27,265 INFO L188 LiptonReduction]: Number of co-enabled transitions 3382 [2022-12-06 05:10:27,302 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [3007] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse6 (= (mod v_~is_null_5~0_In_28 256) 0)) (.cse7 (= (mod v_~is_null_1~0_In_26 256) 0))) (let ((.cse1 (not .cse7)) (.cse0 (= |v_thread1Thread1of1ForFork1_#res#1.base_Out_38| 0)) (.cse2 (not .cse6)) (.cse4 (= |v_thread1Thread1of1ForFork1_#res#1.offset_Out_38| 0)) (.cse3 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_78| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|)) (.cse5 (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_In_5| 256) 0))) (or (and .cse0 (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20| |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|) .cse1 (<= |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42| 2147483647) (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|)) .cse2 .cse3 .cse4 (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20| v_~get_subject_7~0_In_11) .cse5 (= (+ |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32| |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|) |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|) (= v_~get_subject_3~0_In_11 |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20|) (= v_~result_12~0_Out_86 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|)) (and (or (and .cse0 .cse1 (= v_~result_12~0_Out_86 1005) .cse4 .cse6) (and .cse0 .cse2 .cse4 (= (+ v_~result_12~0_Out_86 995) 0) .cse7)) (= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32| |v_thread1Thread1of1ForFork1_minus_~b#1_In_21|) (= (ite (not (and .cse7 .cse6)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|) (= |v_thread1Thread1of1ForFork1_minus_#res#1_In_6| |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_In_7| |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20|) .cse3 .cse5 (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_In_9| |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20|) (= |v_thread1Thread1of1ForFork1_minus_~a#1_In_21| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|))))) InVars {~get_subject_3~0=v_~get_subject_3~0_In_11, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_In_9|, ~is_null_5~0=v_~is_null_5~0_In_28, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_In_7|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_In_21|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_In_6|, ~is_null_1~0=v_~is_null_1~0_In_26, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_In_5|, ~get_subject_7~0=v_~get_subject_7~0_In_11, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_In_21|} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|, thread1Thread1of1ForFork1_#t~ite22#1=|v_thread1Thread1of1ForFork1_#t~ite22#1_Out_28|, thread1Thread1of1ForFork1_#t~ret20#1=|v_thread1Thread1of1ForFork1_#t~ret20#1_Out_20|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20|, ~get_subject_3~0=v_~get_subject_3~0_In_11, ~is_null_5~0=v_~is_null_5~0_In_28, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|, ~is_null_1~0=v_~is_null_1~0_In_26, thread1Thread1of1ForFork1_#t~ite21#1=|v_thread1Thread1of1ForFork1_#t~ite21#1_Out_26|, ~get_subject_7~0=v_~get_subject_7~0_In_11, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_Out_38|, ~result_12~0=v_~result_12~0_Out_86, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_Out_38|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_78|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ite22#1, thread1Thread1of1ForFork1_#t~ret20#1, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#t~ite21#1, thread1Thread1of1ForFork1_#res#1.offset, ~result_12~0, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [2954] $Ultimate##0-->L81-4: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| 0)) (= (ite (and (= (mod v_~is_null_5~0_In_24 256) 0) (= (mod v_~is_null_9~0_In_21 256) 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|) (= v_~break_17~0_Out_42 0) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3| 256) 0)) (= v_~i_16~0_Out_36 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|)) InVars {~is_null_5~0=v_~is_null_5~0_In_24, thread2Thread1of1ForFork2_#t~nondet23#1=|v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3|, ~is_null_9~0=v_~is_null_9~0_In_21} OutVars{~is_null_5~0=v_~is_null_5~0_In_24, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|, ~is_null_9~0=v_~is_null_9~0_In_21, ~break_17~0=v_~break_17~0_Out_42, ~i_16~0=v_~i_16~0_Out_36} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~nondet23#1, ~break_17~0, ~i_16~0] [2022-12-06 05:10:27,616 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [3007] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse6 (= (mod v_~is_null_5~0_In_28 256) 0)) (.cse7 (= (mod v_~is_null_1~0_In_26 256) 0))) (let ((.cse1 (not .cse7)) (.cse0 (= |v_thread1Thread1of1ForFork1_#res#1.base_Out_38| 0)) (.cse2 (not .cse6)) (.cse4 (= |v_thread1Thread1of1ForFork1_#res#1.offset_Out_38| 0)) (.cse3 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_78| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|)) (.cse5 (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_In_5| 256) 0))) (or (and .cse0 (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20| |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|) .cse1 (<= |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42| 2147483647) (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|)) .cse2 .cse3 .cse4 (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20| v_~get_subject_7~0_In_11) .cse5 (= (+ |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32| |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|) |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|) (= v_~get_subject_3~0_In_11 |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20|) (= v_~result_12~0_Out_86 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|)) (and (or (and .cse0 .cse1 (= v_~result_12~0_Out_86 1005) .cse4 .cse6) (and .cse0 .cse2 .cse4 (= (+ v_~result_12~0_Out_86 995) 0) .cse7)) (= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32| |v_thread1Thread1of1ForFork1_minus_~b#1_In_21|) (= (ite (not (and .cse7 .cse6)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|) (= |v_thread1Thread1of1ForFork1_minus_#res#1_In_6| |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_In_7| |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20|) .cse3 .cse5 (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_In_9| |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20|) (= |v_thread1Thread1of1ForFork1_minus_~a#1_In_21| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|))))) InVars {~get_subject_3~0=v_~get_subject_3~0_In_11, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_In_9|, ~is_null_5~0=v_~is_null_5~0_In_28, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_In_7|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_In_21|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_In_6|, ~is_null_1~0=v_~is_null_1~0_In_26, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_In_5|, ~get_subject_7~0=v_~get_subject_7~0_In_11, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_In_21|} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|, thread1Thread1of1ForFork1_#t~ite22#1=|v_thread1Thread1of1ForFork1_#t~ite22#1_Out_28|, thread1Thread1of1ForFork1_#t~ret20#1=|v_thread1Thread1of1ForFork1_#t~ret20#1_Out_20|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20|, ~get_subject_3~0=v_~get_subject_3~0_In_11, ~is_null_5~0=v_~is_null_5~0_In_28, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|, ~is_null_1~0=v_~is_null_1~0_In_26, thread1Thread1of1ForFork1_#t~ite21#1=|v_thread1Thread1of1ForFork1_#t~ite21#1_Out_26|, ~get_subject_7~0=v_~get_subject_7~0_In_11, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_Out_38|, ~result_12~0=v_~result_12~0_Out_86, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_Out_38|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_78|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ite22#1, thread1Thread1of1ForFork1_#t~ret20#1, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#t~ite21#1, thread1Thread1of1ForFork1_#res#1.offset, ~result_12~0, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [3012] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse0 (= (mod |v_thread3Thread1of1ForFork0_#t~nondet45#1_In_5| 256) 0)) (.cse4 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_38| 0)) (.cse5 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_38| 0)) (.cse2 (= (mod v_~is_null_9~0_In_31 256) 0)) (.cse1 (= (mod v_~is_null_1~0_In_28 256) 0)) (.cse3 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88|))) (or (and .cse0 (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_10| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|) (= (ite (not (and .cse1 .cse2)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66|) .cse3 (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| |v_thread3Thread1of1ForFork0_minus_~a#1_In_22|) (or (and .cse4 .cse5 .cse1 (= (+ v_~result_18~0_Out_94 995) 0)) (and .cse4 .cse5 .cse2 (= v_~result_18~0_Out_94 1005))) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_12| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88| 0)) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42| |v_thread3Thread1of1ForFork0_minus_#res#1_In_9|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_~b#1_In_20|)) (and .cse0 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|) .cse4 (<= 0 (+ v_~result_18~0_Out_94 2147483648)) .cse5 (= v_~get_subject_3~0_In_13 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|) (not .cse2) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|) (not .cse1) .cse3 (<= v_~result_18~0_Out_94 2147483647) (= v_~result_18~0_Out_94 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30|)) 1 0)) (= v_~get_subject_11~0_In_13 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|)))) InVars {~get_subject_3~0=v_~get_subject_3~0_In_13, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_9|, ~is_null_1~0=v_~is_null_1~0_In_28, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_20|, thread3Thread1of1ForFork0_#t~nondet45#1=|v_thread3Thread1of1ForFork0_#t~nondet45#1_In_5|, ~is_null_9~0=v_~is_null_9~0_In_31, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_22|, ~get_subject_11~0=v_~get_subject_11~0_In_13, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_12|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_10|} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_38|, thread3Thread1of1ForFork0_#t~ite66#1=|v_thread3Thread1of1ForFork0_#t~ite66#1_Out_24|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_30|, thread3Thread1of1ForFork0_#t~ret64#1=|v_thread3Thread1of1ForFork0_#t~ret64#1_Out_20|, ~get_subject_11~0=v_~get_subject_11~0_In_13, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_38|, ~get_subject_3~0=v_~get_subject_3~0_In_13, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|, ~result_18~0=v_~result_18~0_Out_94, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_30|, ~is_null_1~0=v_~is_null_1~0_In_28, thread3Thread1of1ForFork0_#t~ite65#1=|v_thread3Thread1of1ForFork0_#t~ite65#1_Out_24|, ~is_null_9~0=v_~is_null_9~0_In_31, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~nondet45#1, thread3Thread1of1ForFork0_#t~ite66#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_#t~ret64#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, ~result_18~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~ite65#1, thread3Thread1of1ForFork0_minus_#in~a#1] [2022-12-06 05:10:28,217 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [3007] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse6 (= (mod v_~is_null_5~0_In_28 256) 0)) (.cse7 (= (mod v_~is_null_1~0_In_26 256) 0))) (let ((.cse1 (not .cse7)) (.cse0 (= |v_thread1Thread1of1ForFork1_#res#1.base_Out_38| 0)) (.cse2 (not .cse6)) (.cse4 (= |v_thread1Thread1of1ForFork1_#res#1.offset_Out_38| 0)) (.cse3 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_78| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|)) (.cse5 (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_In_5| 256) 0))) (or (and .cse0 (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20| |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|) .cse1 (<= |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42| 2147483647) (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|)) .cse2 .cse3 .cse4 (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20| v_~get_subject_7~0_In_11) .cse5 (= (+ |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32| |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|) |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|) (= v_~get_subject_3~0_In_11 |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20|) (= v_~result_12~0_Out_86 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|)) (and (or (and .cse0 .cse1 (= v_~result_12~0_Out_86 1005) .cse4 .cse6) (and .cse0 .cse2 .cse4 (= (+ v_~result_12~0_Out_86 995) 0) .cse7)) (= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32| |v_thread1Thread1of1ForFork1_minus_~b#1_In_21|) (= (ite (not (and .cse7 .cse6)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|) (= |v_thread1Thread1of1ForFork1_minus_#res#1_In_6| |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_In_7| |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20|) .cse3 .cse5 (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_In_9| |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20|) (= |v_thread1Thread1of1ForFork1_minus_~a#1_In_21| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|))))) InVars {~get_subject_3~0=v_~get_subject_3~0_In_11, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_In_9|, ~is_null_5~0=v_~is_null_5~0_In_28, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_In_7|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_In_21|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_In_6|, ~is_null_1~0=v_~is_null_1~0_In_26, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_In_5|, ~get_subject_7~0=v_~get_subject_7~0_In_11, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_In_21|} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|, thread1Thread1of1ForFork1_#t~ite22#1=|v_thread1Thread1of1ForFork1_#t~ite22#1_Out_28|, thread1Thread1of1ForFork1_#t~ret20#1=|v_thread1Thread1of1ForFork1_#t~ret20#1_Out_20|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20|, ~get_subject_3~0=v_~get_subject_3~0_In_11, ~is_null_5~0=v_~is_null_5~0_In_28, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|, ~is_null_1~0=v_~is_null_1~0_In_26, thread1Thread1of1ForFork1_#t~ite21#1=|v_thread1Thread1of1ForFork1_#t~ite21#1_Out_26|, ~get_subject_7~0=v_~get_subject_7~0_In_11, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_Out_38|, ~result_12~0=v_~result_12~0_Out_86, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_Out_38|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_78|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ite22#1, thread1Thread1of1ForFork1_#t~ret20#1, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#t~ite21#1, thread1Thread1of1ForFork1_#res#1.offset, ~result_12~0, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [3012] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse0 (= (mod |v_thread3Thread1of1ForFork0_#t~nondet45#1_In_5| 256) 0)) (.cse4 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_38| 0)) (.cse5 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_38| 0)) (.cse2 (= (mod v_~is_null_9~0_In_31 256) 0)) (.cse1 (= (mod v_~is_null_1~0_In_28 256) 0)) (.cse3 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88|))) (or (and .cse0 (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_10| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|) (= (ite (not (and .cse1 .cse2)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66|) .cse3 (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| |v_thread3Thread1of1ForFork0_minus_~a#1_In_22|) (or (and .cse4 .cse5 .cse1 (= (+ v_~result_18~0_Out_94 995) 0)) (and .cse4 .cse5 .cse2 (= v_~result_18~0_Out_94 1005))) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_12| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88| 0)) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42| |v_thread3Thread1of1ForFork0_minus_#res#1_In_9|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_~b#1_In_20|)) (and .cse0 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|) .cse4 (<= 0 (+ v_~result_18~0_Out_94 2147483648)) .cse5 (= v_~get_subject_3~0_In_13 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|) (not .cse2) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|) (not .cse1) .cse3 (<= v_~result_18~0_Out_94 2147483647) (= v_~result_18~0_Out_94 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30|)) 1 0)) (= v_~get_subject_11~0_In_13 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|)))) InVars {~get_subject_3~0=v_~get_subject_3~0_In_13, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_9|, ~is_null_1~0=v_~is_null_1~0_In_28, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_20|, thread3Thread1of1ForFork0_#t~nondet45#1=|v_thread3Thread1of1ForFork0_#t~nondet45#1_In_5|, ~is_null_9~0=v_~is_null_9~0_In_31, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_22|, ~get_subject_11~0=v_~get_subject_11~0_In_13, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_12|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_10|} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_38|, thread3Thread1of1ForFork0_#t~ite66#1=|v_thread3Thread1of1ForFork0_#t~ite66#1_Out_24|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_30|, thread3Thread1of1ForFork0_#t~ret64#1=|v_thread3Thread1of1ForFork0_#t~ret64#1_Out_20|, ~get_subject_11~0=v_~get_subject_11~0_In_13, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_38|, ~get_subject_3~0=v_~get_subject_3~0_In_13, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|, ~result_18~0=v_~result_18~0_Out_94, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_30|, ~is_null_1~0=v_~is_null_1~0_In_28, thread3Thread1of1ForFork0_#t~ite65#1=|v_thread3Thread1of1ForFork0_#t~ite65#1_Out_24|, ~is_null_9~0=v_~is_null_9~0_In_31, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~nondet45#1, thread3Thread1of1ForFork0_#t~ite66#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_#t~ret64#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, ~result_18~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~ite65#1, thread3Thread1of1ForFork0_minus_#in~a#1] [2022-12-06 05:10:28,837 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [3026] $Ultimate##0-->L81-4: Formula: (let ((.cse0 (= (mod v_~is_null_5~0_193 256) 0)) (.cse1 (= (mod v_~is_null_1~0_165 256) 0))) (and (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_72| |v_thread1Thread1of1ForFork1_minus_#in~b#1_71|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_230| (ite (and (= (mod v_~is_null_9~0_185 256) 0) .cse0) 1 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_310| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_230|) (= |v_thread1Thread1of1ForFork1_minus_~b#1_122| |v_thread1Thread1of1ForFork1_minus_~b#1_121|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_310| 0)) (= v_~i_16~0_300 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_198| (ite (not (and .cse0 .cse1)) 1 0)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_104| |v_thread1Thread1of1ForFork1_minus_#res#1_103|) (= 0 v_~break_17~0_320) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_198| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_260|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_54| 0) (not .cse1) (= |v_thread1Thread1of1ForFork1_#res#1.base_54| 0) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet23#1_110| 256) 0)) (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_81| 256) 0) (= 1005 v_~result_12~0_271) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_72| |v_thread1Thread1of1ForFork1_minus_#in~a#1_71|) (= |v_thread1Thread1of1ForFork1_minus_~a#1_122| |v_thread1Thread1of1ForFork1_minus_~a#1_121|))) InVars {thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_72|, ~is_null_5~0=v_~is_null_5~0_193, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_72|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_122|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_104|, ~is_null_1~0=v_~is_null_1~0_165, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_81|, thread2Thread1of1ForFork2_#t~nondet23#1=|v_thread2Thread1of1ForFork2_#t~nondet23#1_110|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_122|, ~is_null_9~0=v_~is_null_9~0_185} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_71|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_103|, thread1Thread1of1ForFork1_#t~ite22#1=|v_thread1Thread1of1ForFork1_#t~ite22#1_67|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_230|, ~break_17~0=v_~break_17~0_320, thread1Thread1of1ForFork1_#t~ret20#1=|v_thread1Thread1of1ForFork1_#t~ret20#1_51|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_71|, ~is_null_5~0=v_~is_null_5~0_193, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_310|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_121|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_198|, ~is_null_1~0=v_~is_null_1~0_165, thread1Thread1of1ForFork1_#t~ite21#1=|v_thread1Thread1of1ForFork1_#t~ite21#1_61|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_54|, ~result_12~0=v_~result_12~0_271, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_121|, ~is_null_9~0=v_~is_null_9~0_185, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_54|, ~i_16~0=v_~i_16~0_300, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_260|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ite22#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~break_17~0, thread1Thread1of1ForFork1_#t~ret20#1, thread1Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#t~ite21#1, thread2Thread1of1ForFork2_#t~nondet23#1, thread1Thread1of1ForFork1_#res#1.offset, ~result_12~0, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, ~i_16~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [3012] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse0 (= (mod |v_thread3Thread1of1ForFork0_#t~nondet45#1_In_5| 256) 0)) (.cse4 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_38| 0)) (.cse5 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_38| 0)) (.cse2 (= (mod v_~is_null_9~0_In_31 256) 0)) (.cse1 (= (mod v_~is_null_1~0_In_28 256) 0)) (.cse3 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88|))) (or (and .cse0 (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_10| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|) (= (ite (not (and .cse1 .cse2)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66|) .cse3 (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| |v_thread3Thread1of1ForFork0_minus_~a#1_In_22|) (or (and .cse4 .cse5 .cse1 (= (+ v_~result_18~0_Out_94 995) 0)) (and .cse4 .cse5 .cse2 (= v_~result_18~0_Out_94 1005))) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_12| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88| 0)) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42| |v_thread3Thread1of1ForFork0_minus_#res#1_In_9|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_~b#1_In_20|)) (and .cse0 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|) .cse4 (<= 0 (+ v_~result_18~0_Out_94 2147483648)) .cse5 (= v_~get_subject_3~0_In_13 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|) (not .cse2) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|) (not .cse1) .cse3 (<= v_~result_18~0_Out_94 2147483647) (= v_~result_18~0_Out_94 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30|)) 1 0)) (= v_~get_subject_11~0_In_13 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|)))) InVars {~get_subject_3~0=v_~get_subject_3~0_In_13, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_9|, ~is_null_1~0=v_~is_null_1~0_In_28, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_20|, thread3Thread1of1ForFork0_#t~nondet45#1=|v_thread3Thread1of1ForFork0_#t~nondet45#1_In_5|, ~is_null_9~0=v_~is_null_9~0_In_31, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_22|, ~get_subject_11~0=v_~get_subject_11~0_In_13, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_12|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_10|} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_38|, thread3Thread1of1ForFork0_#t~ite66#1=|v_thread3Thread1of1ForFork0_#t~ite66#1_Out_24|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_30|, thread3Thread1of1ForFork0_#t~ret64#1=|v_thread3Thread1of1ForFork0_#t~ret64#1_Out_20|, ~get_subject_11~0=v_~get_subject_11~0_In_13, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_38|, ~get_subject_3~0=v_~get_subject_3~0_In_13, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|, ~result_18~0=v_~result_18~0_Out_94, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_30|, ~is_null_1~0=v_~is_null_1~0_In_28, thread3Thread1of1ForFork0_#t~ite65#1=|v_thread3Thread1of1ForFork0_#t~ite65#1_Out_24|, ~is_null_9~0=v_~is_null_9~0_In_31, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~nondet45#1, thread3Thread1of1ForFork0_#t~ite66#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_#t~ret64#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, ~result_18~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~ite65#1, thread3Thread1of1ForFork0_minus_#in~a#1] [2022-12-06 05:10:29,238 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [3007] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse6 (= (mod v_~is_null_5~0_In_28 256) 0)) (.cse7 (= (mod v_~is_null_1~0_In_26 256) 0))) (let ((.cse1 (not .cse7)) (.cse0 (= |v_thread1Thread1of1ForFork1_#res#1.base_Out_38| 0)) (.cse2 (not .cse6)) (.cse4 (= |v_thread1Thread1of1ForFork1_#res#1.offset_Out_38| 0)) (.cse3 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_78| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|)) (.cse5 (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_In_5| 256) 0))) (or (and .cse0 (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20| |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|) .cse1 (<= |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42| 2147483647) (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|)) .cse2 .cse3 .cse4 (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20| v_~get_subject_7~0_In_11) .cse5 (= (+ |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32| |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|) |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|) (= v_~get_subject_3~0_In_11 |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20|) (= v_~result_12~0_Out_86 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|)) (and (or (and .cse0 .cse1 (= v_~result_12~0_Out_86 1005) .cse4 .cse6) (and .cse0 .cse2 .cse4 (= (+ v_~result_12~0_Out_86 995) 0) .cse7)) (= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32| |v_thread1Thread1of1ForFork1_minus_~b#1_In_21|) (= (ite (not (and .cse7 .cse6)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|) (= |v_thread1Thread1of1ForFork1_minus_#res#1_In_6| |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_In_7| |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20|) .cse3 .cse5 (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_In_9| |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20|) (= |v_thread1Thread1of1ForFork1_minus_~a#1_In_21| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|))))) InVars {~get_subject_3~0=v_~get_subject_3~0_In_11, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_In_9|, ~is_null_5~0=v_~is_null_5~0_In_28, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_In_7|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_In_21|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_In_6|, ~is_null_1~0=v_~is_null_1~0_In_26, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_In_5|, ~get_subject_7~0=v_~get_subject_7~0_In_11, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_In_21|} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|, thread1Thread1of1ForFork1_#t~ite22#1=|v_thread1Thread1of1ForFork1_#t~ite22#1_Out_28|, thread1Thread1of1ForFork1_#t~ret20#1=|v_thread1Thread1of1ForFork1_#t~ret20#1_Out_20|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20|, ~get_subject_3~0=v_~get_subject_3~0_In_11, ~is_null_5~0=v_~is_null_5~0_In_28, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|, ~is_null_1~0=v_~is_null_1~0_In_26, thread1Thread1of1ForFork1_#t~ite21#1=|v_thread1Thread1of1ForFork1_#t~ite21#1_Out_26|, ~get_subject_7~0=v_~get_subject_7~0_In_11, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_Out_38|, ~result_12~0=v_~result_12~0_Out_86, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_Out_38|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_78|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ite22#1, thread1Thread1of1ForFork1_#t~ret20#1, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#t~ite21#1, thread1Thread1of1ForFork1_#res#1.offset, ~result_12~0, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [3012] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse0 (= (mod |v_thread3Thread1of1ForFork0_#t~nondet45#1_In_5| 256) 0)) (.cse4 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_38| 0)) (.cse5 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_38| 0)) (.cse2 (= (mod v_~is_null_9~0_In_31 256) 0)) (.cse1 (= (mod v_~is_null_1~0_In_28 256) 0)) (.cse3 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88|))) (or (and .cse0 (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_10| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|) (= (ite (not (and .cse1 .cse2)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66|) .cse3 (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| |v_thread3Thread1of1ForFork0_minus_~a#1_In_22|) (or (and .cse4 .cse5 .cse1 (= (+ v_~result_18~0_Out_94 995) 0)) (and .cse4 .cse5 .cse2 (= v_~result_18~0_Out_94 1005))) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_12| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88| 0)) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42| |v_thread3Thread1of1ForFork0_minus_#res#1_In_9|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_~b#1_In_20|)) (and .cse0 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|) .cse4 (<= 0 (+ v_~result_18~0_Out_94 2147483648)) .cse5 (= v_~get_subject_3~0_In_13 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|) (not .cse2) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|) (not .cse1) .cse3 (<= v_~result_18~0_Out_94 2147483647) (= v_~result_18~0_Out_94 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30|)) 1 0)) (= v_~get_subject_11~0_In_13 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|)))) InVars {~get_subject_3~0=v_~get_subject_3~0_In_13, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_9|, ~is_null_1~0=v_~is_null_1~0_In_28, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_20|, thread3Thread1of1ForFork0_#t~nondet45#1=|v_thread3Thread1of1ForFork0_#t~nondet45#1_In_5|, ~is_null_9~0=v_~is_null_9~0_In_31, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_22|, ~get_subject_11~0=v_~get_subject_11~0_In_13, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_12|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_10|} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_38|, thread3Thread1of1ForFork0_#t~ite66#1=|v_thread3Thread1of1ForFork0_#t~ite66#1_Out_24|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_30|, thread3Thread1of1ForFork0_#t~ret64#1=|v_thread3Thread1of1ForFork0_#t~ret64#1_Out_20|, ~get_subject_11~0=v_~get_subject_11~0_In_13, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_38|, ~get_subject_3~0=v_~get_subject_3~0_In_13, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|, ~result_18~0=v_~result_18~0_Out_94, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_30|, ~is_null_1~0=v_~is_null_1~0_In_28, thread3Thread1of1ForFork0_#t~ite65#1=|v_thread3Thread1of1ForFork0_#t~ite65#1_Out_24|, ~is_null_9~0=v_~is_null_9~0_In_31, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~nondet45#1, thread3Thread1of1ForFork0_#t~ite66#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_#t~ret64#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, ~result_18~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~ite65#1, thread3Thread1of1ForFork0_minus_#in~a#1] [2022-12-06 05:10:29,858 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:10:29,859 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3102 [2022-12-06 05:10:29,859 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 172 transitions, 1766 flow [2022-12-06 05:10:29,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.888888888888889) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:10:29,859 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:10:29,859 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:10:29,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-06 05:10:30,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 05:10:30,066 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:10:30,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:10:30,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1467628556, now seen corresponding path program 1 times [2022-12-06 05:10:30,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:10:30,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479126497] [2022-12-06 05:10:30,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:10:30,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:10:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:10:30,347 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-06 05:10:30,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:10:30,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479126497] [2022-12-06 05:10:30,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479126497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:10:30,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:10:30,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:10:30,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146277071] [2022-12-06 05:10:30,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:10:30,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:10:30,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:10:30,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:10:30,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:10:30,350 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 05:10:30,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 172 transitions, 1766 flow. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:10:30,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:10:30,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 05:10:30,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:10:39,341 INFO L130 PetriNetUnfolder]: 41874/56653 cut-off events. [2022-12-06 05:10:39,341 INFO L131 PetriNetUnfolder]: For 139988/139988 co-relation queries the response was YES. [2022-12-06 05:10:39,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213678 conditions, 56653 events. 41874/56653 cut-off events. For 139988/139988 co-relation queries the response was YES. Maximal size of possible extension queue 1453. Compared 328492 event pairs, 19874 based on Foata normal form. 5/46574 useless extension candidates. Maximal degree in co-relation 213607. Up to 55428 conditions per place. [2022-12-06 05:10:40,029 INFO L137 encePairwiseOnDemand]: 51/54 looper letters, 147 selfloop transitions, 0 changer transitions 62/209 dead transitions. [2022-12-06 05:10:40,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 209 transitions, 2300 flow [2022-12-06 05:10:40,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:10:40,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:10:40,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-12-06 05:10:40,031 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37962962962962965 [2022-12-06 05:10:40,031 INFO L175 Difference]: Start difference. First operand has 106 places, 172 transitions, 1766 flow. Second operand 4 states and 82 transitions. [2022-12-06 05:10:40,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 209 transitions, 2300 flow [2022-12-06 05:10:41,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 209 transitions, 2266 flow, removed 15 selfloop flow, removed 3 redundant places. [2022-12-06 05:10:41,236 INFO L231 Difference]: Finished difference. Result has 107 places, 147 transitions, 1325 flow [2022-12-06 05:10:41,236 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1588, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1325, PETRI_PLACES=107, PETRI_TRANSITIONS=147} [2022-12-06 05:10:41,236 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 61 predicate places. [2022-12-06 05:10:41,236 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:10:41,236 INFO L89 Accepts]: Start accepts. Operand has 107 places, 147 transitions, 1325 flow [2022-12-06 05:10:41,237 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:10:41,237 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:10:41,237 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 147 transitions, 1325 flow [2022-12-06 05:10:41,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 147 transitions, 1325 flow [2022-12-06 05:10:41,489 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2929] L58-->L58-7: Formula: (let ((.cse1 (= (mod v_~break_14~0_In_19 256) 0)) (.cse2 (not |v_thread1Thread1of1ForFork1_#t~short10#1_Out_6|)) (.cse0 (= (ite |v_thread1Thread1of1ForFork1_#t~short10#1_Out_6| (+ v_~i_13~0_In_26 (- 1000)) v_~result_12~0_In_15) v_~result_12~0_Out_52))) (or (and |v_thread1Thread1of1ForFork1_#t~short10#1_55| .cse0 .cse1 (let ((.cse3 (= (mod (select (select |v_#memory_int_In_61| v_~ends_with_2~0.base_In_13) (+ v_~i_13~0_In_26 v_~ends_with_2~0.offset_In_13)) 256) 0))) (or (and .cse2 .cse3) (and (not .cse3) |v_thread1Thread1of1ForFork1_#t~short10#1_Out_6|)))) (and (not .cse1) .cse2 .cse0))) InVars {~i_13~0=v_~i_13~0_In_26, #memory_int=|v_#memory_int_In_61|, ~result_12~0=v_~result_12~0_In_15, ~break_14~0=v_~break_14~0_In_19, ~ends_with_2~0.base=v_~ends_with_2~0.base_In_13, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_In_13} OutVars{thread1Thread1of1ForFork1_#t~short10#1=|v_thread1Thread1of1ForFork1_#t~short10#1_Out_6|, ~i_13~0=v_~i_13~0_In_26, thread1Thread1of1ForFork1_#t~mem9#1=|v_thread1Thread1of1ForFork1_#t~mem9#1_Out_8|, #memory_int=|v_#memory_int_In_61|, ~result_12~0=v_~result_12~0_Out_52, ~break_14~0=v_~break_14~0_In_19, ~ends_with_2~0.base=v_~ends_with_2~0.base_In_13, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_In_13} AuxVars[|v_thread1Thread1of1ForFork1_#t~short10#1_55|] AssignedVars[thread1Thread1of1ForFork1_#t~short10#1, thread1Thread1of1ForFork1_#t~mem9#1, ~result_12~0][113], [Black: 645#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 1210#(or (<= (+ ~result_12~0 995) 0) (and (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)) (or (<= (+ ~result_12~0 ~get_subject_7~0) ~get_subject_3~0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 767#(< (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|), Black: 763#(< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|), 1514#true, 1241#(and (= ~i_16~0 0) (= ~break_17~0 0)), 985#true, 517#L58-7true, Black: 1223#(or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= (+ ~result_12~0 ~get_subject_7~0) (+ ~result_18~0 ~get_subject_11~0))) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0)), Black: 1222#(or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)), Black: 1226#(and (or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)) (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= (+ ~result_12~0 ~get_subject_7~0) (+ ~result_18~0 ~get_subject_11~0))) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0))), 1183#true, 634#true, Black: 1237#(and (= ~break_20~0 0) (= ~i_19~0 0)), Black: 948#(or (and (not (= (mod ~is_null_9~0 256) 0)) (<= 0 (+ ~result_15~0 2147483648)) (= (+ ~result_15~0 ~get_subject_11~0) ~get_subject_7~0) (<= ~result_15~0 2147483647) (not (= (mod ~is_null_5~0 256) 0))) (and (= (mod ~is_null_9~0 256) 0) (= ~result_15~0 1005) (not (= (mod ~is_null_5~0 256) 0))) (and (not (= (mod ~is_null_9~0 256) 0)) (= (+ ~result_15~0 995) 0) (= (mod ~is_null_5~0 256) 0))), 180#L81-4true, Black: 1245#(and (= ~break_14~0 0) (= ~i_13~0 0)), Black: 991#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 4) (= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 1264#true, 587#L108-4true, Black: 1247#true, Black: 1582#(or (and (<= ~result_12~0 2147483647) (<= 0 (+ ~result_12~0 2147483648)) (not (= (mod ~is_null_1~0 256) 0)) (not (= (mod ~is_null_5~0 256) 0))) (and (not (= (mod ~is_null_1~0 256) 0)) (= ~result_12~0 1005)) (and (= (+ ~result_12~0 995) 0) (not (= (mod ~is_null_5~0 256) 0)))), Black: 1189#(and (or (<= (+ ~result_15~0 995) 0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (<= 1005 ~result_18~0) (and (<= (+ ~result_15~0 ~get_subject_3~0) (+ ~result_18~0 ~get_subject_7~0)) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))) (or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0))), Black: 1192#(and (or (<= (+ ~result_15~0 995) 0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (<= 1005 ~result_18~0) (and (<= (+ ~result_15~0 ~get_subject_3~0) (+ ~result_18~0 ~get_subject_7~0)) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))) (or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)) (or (<= (+ ~result_15~0 995) 0) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0) (<= (+ ~result_15~0 ~result_12~0) ~result_18~0))), Black: 1765#(and (or (<= ~result_12~0 0) (= (mod ~is_null_9~0 256) 0)) (or (<= ~result_12~0 0) (< 0 ~result_18~0))), Black: 1185#(or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)), Black: 1676#(or (<= ~result_12~0 0) (= (mod ~is_null_9~0 256) 0)), 1266#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 835#(or (and (= (mod ~is_null_1~0 256) 0) (= (+ ~result_12~0 995) 0) (not (= (mod ~is_null_5~0 256) 0))) (and (not (= (mod ~is_null_1~0 256) 0)) (= ~result_12~0 1005) (= (mod ~is_null_5~0 256) 0)) (and (= ~get_subject_3~0 (+ ~result_12~0 ~get_subject_7~0)) (not (= (mod ~is_null_1~0 256) 0)) (<= ~get_subject_3~0 (+ 2147483647 ~get_subject_7~0)) (<= ~get_subject_7~0 (+ ~get_subject_3~0 2147483648)) (not (= (mod ~is_null_5~0 256) 0)))), 52#L158-4true, Black: 1777#(<= (+ ~result_15~0 995) 0), Black: 1198#(or (<= (+ ~result_15~0 995) 0) (and (or (<= (+ ~result_15~0 ~get_subject_11~0) ~get_subject_7~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), 1220#true, Black: 1204#(and (or (<= (+ ~result_15~0 995) 0) (and (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)) (or (<= (+ ~result_15~0 ~result_12~0 ~get_subject_11~0) ~get_subject_3~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256))))) (<= (+ ~result_12~0 995) 0)) (or (<= (+ ~result_15~0 995) 0) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0) (<= (+ ~result_15~0 ~result_12~0) ~result_18~0)) (or (<= (+ ~result_15~0 995) 0) (and (or (<= (+ ~result_15~0 ~get_subject_11~0) ~get_subject_7~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))))), 1249#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 1202#(and (or (<= (+ ~result_15~0 995) 0) (and (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)) (or (<= (+ ~result_15~0 ~result_12~0 ~get_subject_11~0) ~get_subject_3~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256))))) (<= (+ ~result_12~0 995) 0)) (or (<= (+ ~result_15~0 995) 0) (and (or (<= (+ ~result_15~0 ~get_subject_11~0) ~get_subject_7~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))))), Black: 632#(and (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0) (= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|))]) [2022-12-06 05:10:41,489 INFO L382 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-06 05:10:41,490 INFO L385 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-06 05:10:41,490 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-06 05:10:41,490 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-06 05:10:41,706 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2152] thread2EXIT-->L160-2: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem95#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_#t~mem95#1=|v_ULTIMATE.start_main_#t~mem95#1_5|, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_#t~mem95#1=|v_ULTIMATE.start_main_#t~mem95#1_5|, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][143], [Black: 645#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 1210#(or (<= (+ ~result_12~0 995) 0) (and (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)) (or (<= (+ ~result_12~0 ~get_subject_7~0) ~get_subject_3~0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 767#(< (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|), Black: 763#(< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|), 1514#true, 985#true, Black: 1223#(or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= (+ ~result_12~0 ~get_subject_7~0) (+ ~result_18~0 ~get_subject_11~0))) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0)), Black: 1226#(and (or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)) (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= (+ ~result_12~0 ~get_subject_7~0) (+ ~result_18~0 ~get_subject_11~0))) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0))), 634#true, Black: 1237#(and (= ~break_20~0 0) (= ~i_19~0 0)), Black: 948#(or (and (not (= (mod ~is_null_9~0 256) 0)) (<= 0 (+ ~result_15~0 2147483648)) (= (+ ~result_15~0 ~get_subject_11~0) ~get_subject_7~0) (<= ~result_15~0 2147483647) (not (= (mod ~is_null_5~0 256) 0))) (and (= (mod ~is_null_9~0 256) 0) (= ~result_15~0 1005) (not (= (mod ~is_null_5~0 256) 0))) (and (not (= (mod ~is_null_9~0 256) 0)) (= (+ ~result_15~0 995) 0) (= (mod ~is_null_5~0 256) 0))), Black: 1241#(and (= ~i_16~0 0) (= ~break_17~0 0)), 539#L160-2true, Black: 991#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 4) (= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 1245#(and (= ~break_14~0 0) (= ~i_13~0 0)), Black: 1264#true, Black: 1247#true, Black: 1582#(or (and (<= ~result_12~0 2147483647) (<= 0 (+ ~result_12~0 2147483648)) (not (= (mod ~is_null_1~0 256) 0)) (not (= (mod ~is_null_5~0 256) 0))) (and (not (= (mod ~is_null_1~0 256) 0)) (= ~result_12~0 1005)) (and (= (+ ~result_12~0 995) 0) (not (= (mod ~is_null_5~0 256) 0)))), Black: 1189#(and (or (<= (+ ~result_15~0 995) 0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (<= 1005 ~result_18~0) (and (<= (+ ~result_15~0 ~get_subject_3~0) (+ ~result_18~0 ~get_subject_7~0)) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))) (or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0))), Black: 1765#(and (or (<= ~result_12~0 0) (= (mod ~is_null_9~0 256) 0)) (or (<= ~result_12~0 0) (< 0 ~result_18~0))), Black: 1192#(and (or (<= (+ ~result_15~0 995) 0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (<= 1005 ~result_18~0) (and (<= (+ ~result_15~0 ~get_subject_3~0) (+ ~result_18~0 ~get_subject_7~0)) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))) (or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)) (or (<= (+ ~result_15~0 995) 0) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0) (<= (+ ~result_15~0 ~result_12~0) ~result_18~0))), 465#thread3EXITtrue, 1266#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), 1185#(or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)), Black: 1676#(or (<= ~result_12~0 0) (= (mod ~is_null_9~0 256) 0)), Black: 835#(or (and (= (mod ~is_null_1~0 256) 0) (= (+ ~result_12~0 995) 0) (not (= (mod ~is_null_5~0 256) 0))) (and (not (= (mod ~is_null_1~0 256) 0)) (= ~result_12~0 1005) (= (mod ~is_null_5~0 256) 0)) (and (= ~get_subject_3~0 (+ ~result_12~0 ~get_subject_7~0)) (not (= (mod ~is_null_1~0 256) 0)) (<= ~get_subject_3~0 (+ 2147483647 ~get_subject_7~0)) (<= ~get_subject_7~0 (+ ~get_subject_3~0 2147483648)) (not (= (mod ~is_null_5~0 256) 0)))), Black: 1777#(<= (+ ~result_15~0 995) 0), 1222#(or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)), Black: 1198#(or (<= (+ ~result_15~0 995) 0) (and (or (<= (+ ~result_15~0 ~get_subject_11~0) ~get_subject_7~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), 1249#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 1204#(and (or (<= (+ ~result_15~0 995) 0) (and (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)) (or (<= (+ ~result_15~0 ~result_12~0 ~get_subject_11~0) ~get_subject_3~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256))))) (<= (+ ~result_12~0 995) 0)) (or (<= (+ ~result_15~0 995) 0) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0) (<= (+ ~result_15~0 ~result_12~0) ~result_18~0)) (or (<= (+ ~result_15~0 995) 0) (and (or (<= (+ ~result_15~0 ~get_subject_11~0) ~get_subject_7~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))))), Black: 1202#(and (or (<= (+ ~result_15~0 995) 0) (and (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)) (or (<= (+ ~result_15~0 ~result_12~0 ~get_subject_11~0) ~get_subject_3~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256))))) (<= (+ ~result_12~0 995) 0)) (or (<= (+ ~result_15~0 995) 0) (and (or (<= (+ ~result_15~0 ~get_subject_11~0) ~get_subject_7~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))))), Black: 632#(and (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0) (= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|))]) [2022-12-06 05:10:41,706 INFO L382 tUnfolder$Statistics]: this new event has 45 ancestors and is not cut-off event [2022-12-06 05:10:41,706 INFO L385 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2022-12-06 05:10:41,706 INFO L385 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2022-12-06 05:10:41,706 INFO L385 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2022-12-06 05:10:41,709 INFO L130 PetriNetUnfolder]: 1341/3419 cut-off events. [2022-12-06 05:10:41,709 INFO L131 PetriNetUnfolder]: For 7308/7660 co-relation queries the response was YES. [2022-12-06 05:10:41,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10443 conditions, 3419 events. 1341/3419 cut-off events. For 7308/7660 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 29864 event pairs, 31 based on Foata normal form. 77/2838 useless extension candidates. Maximal degree in co-relation 10384. Up to 867 conditions per place. [2022-12-06 05:10:41,752 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 147 transitions, 1325 flow [2022-12-06 05:10:41,753 INFO L188 LiptonReduction]: Number of co-enabled transitions 3234 [2022-12-06 05:10:41,766 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:10:41,769 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 533 [2022-12-06 05:10:41,769 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 147 transitions, 1325 flow [2022-12-06 05:10:41,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:10:41,769 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:10:41,769 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:10:41,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 05:10:41,769 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:10:41,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:10:41,770 INFO L85 PathProgramCache]: Analyzing trace with hash -221096964, now seen corresponding path program 1 times [2022-12-06 05:10:41,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:10:41,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750684163] [2022-12-06 05:10:41,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:10:41,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:10:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:10:41,966 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-06 05:10:41,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:10:41,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750684163] [2022-12-06 05:10:41,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750684163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:10:41,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:10:41,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:10:41,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820676773] [2022-12-06 05:10:41,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:10:41,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:10:41,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:10:41,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:10:41,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:10:41,968 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 05:10:41,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 147 transitions, 1325 flow. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:10:41,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:10:41,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 05:10:41,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:10:50,005 INFO L130 PetriNetUnfolder]: 41135/55426 cut-off events. [2022-12-06 05:10:50,005 INFO L131 PetriNetUnfolder]: For 135253/135253 co-relation queries the response was YES. [2022-12-06 05:10:50,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208430 conditions, 55426 events. 41135/55426 cut-off events. For 135253/135253 co-relation queries the response was YES. Maximal size of possible extension queue 1416. Compared 316070 event pairs, 10262 based on Foata normal form. 1/45563 useless extension candidates. Maximal degree in co-relation 208365. Up to 37009 conditions per place. [2022-12-06 05:10:50,705 INFO L137 encePairwiseOnDemand]: 42/49 looper letters, 159 selfloop transitions, 22 changer transitions 22/203 dead transitions. [2022-12-06 05:10:50,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 203 transitions, 1933 flow [2022-12-06 05:10:50,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:10:50,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:10:50,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-12-06 05:10:50,707 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5459183673469388 [2022-12-06 05:10:50,707 INFO L175 Difference]: Start difference. First operand has 99 places, 147 transitions, 1325 flow. Second operand 4 states and 107 transitions. [2022-12-06 05:10:50,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 203 transitions, 1933 flow [2022-12-06 05:10:51,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 203 transitions, 1828 flow, removed 48 selfloop flow, removed 7 redundant places. [2022-12-06 05:10:51,794 INFO L231 Difference]: Finished difference. Result has 96 places, 146 transitions, 1244 flow [2022-12-06 05:10:51,795 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1244, PETRI_PLACES=96, PETRI_TRANSITIONS=146} [2022-12-06 05:10:51,795 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 50 predicate places. [2022-12-06 05:10:51,795 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:10:51,795 INFO L89 Accepts]: Start accepts. Operand has 96 places, 146 transitions, 1244 flow [2022-12-06 05:10:51,796 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:10:51,796 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:10:51,796 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 146 transitions, 1244 flow [2022-12-06 05:10:51,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 146 transitions, 1244 flow [2022-12-06 05:10:52,041 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2929] L58-->L58-7: Formula: (let ((.cse1 (= (mod v_~break_14~0_In_19 256) 0)) (.cse2 (not |v_thread1Thread1of1ForFork1_#t~short10#1_Out_6|)) (.cse0 (= (ite |v_thread1Thread1of1ForFork1_#t~short10#1_Out_6| (+ v_~i_13~0_In_26 (- 1000)) v_~result_12~0_In_15) v_~result_12~0_Out_52))) (or (and |v_thread1Thread1of1ForFork1_#t~short10#1_55| .cse0 .cse1 (let ((.cse3 (= (mod (select (select |v_#memory_int_In_61| v_~ends_with_2~0.base_In_13) (+ v_~i_13~0_In_26 v_~ends_with_2~0.offset_In_13)) 256) 0))) (or (and .cse2 .cse3) (and (not .cse3) |v_thread1Thread1of1ForFork1_#t~short10#1_Out_6|)))) (and (not .cse1) .cse2 .cse0))) InVars {~i_13~0=v_~i_13~0_In_26, #memory_int=|v_#memory_int_In_61|, ~result_12~0=v_~result_12~0_In_15, ~break_14~0=v_~break_14~0_In_19, ~ends_with_2~0.base=v_~ends_with_2~0.base_In_13, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_In_13} OutVars{thread1Thread1of1ForFork1_#t~short10#1=|v_thread1Thread1of1ForFork1_#t~short10#1_Out_6|, ~i_13~0=v_~i_13~0_In_26, thread1Thread1of1ForFork1_#t~mem9#1=|v_thread1Thread1of1ForFork1_#t~mem9#1_Out_8|, #memory_int=|v_#memory_int_In_61|, ~result_12~0=v_~result_12~0_Out_52, ~break_14~0=v_~break_14~0_In_19, ~ends_with_2~0.base=v_~ends_with_2~0.base_In_13, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_In_13} AuxVars[|v_thread1Thread1of1ForFork1_#t~short10#1_55|] AssignedVars[thread1Thread1of1ForFork1_#t~short10#1, thread1Thread1of1ForFork1_#t~mem9#1, ~result_12~0][112], [Black: 645#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 1210#(or (<= (+ ~result_12~0 995) 0) (and (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)) (or (<= (+ ~result_12~0 ~get_subject_7~0) ~get_subject_3~0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 767#(< (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|), Black: 763#(< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|), 1514#true, 1241#(and (= ~i_16~0 0) (= ~break_17~0 0)), 1779#true, 985#true, Black: 1223#(or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= (+ ~result_12~0 ~get_subject_7~0) (+ ~result_18~0 ~get_subject_11~0))) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0)), 517#L58-7true, Black: 1222#(or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)), Black: 1226#(and (or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)) (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= (+ ~result_12~0 ~get_subject_7~0) (+ ~result_18~0 ~get_subject_11~0))) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0))), 1183#true, 634#true, Black: 1237#(and (= ~break_20~0 0) (= ~i_19~0 0)), 180#L81-4true, Black: 1245#(and (= ~break_14~0 0) (= ~i_13~0 0)), Black: 991#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 4) (= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 1264#true, 587#L108-4true, Black: 1247#true, Black: 1189#(and (or (<= (+ ~result_15~0 995) 0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (<= 1005 ~result_18~0) (and (<= (+ ~result_15~0 ~get_subject_3~0) (+ ~result_18~0 ~get_subject_7~0)) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))) (or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0))), Black: 1192#(and (or (<= (+ ~result_15~0 995) 0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (<= 1005 ~result_18~0) (and (<= (+ ~result_15~0 ~get_subject_3~0) (+ ~result_18~0 ~get_subject_7~0)) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))) (or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)) (or (<= (+ ~result_15~0 995) 0) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0) (<= (+ ~result_15~0 ~result_12~0) ~result_18~0))), Black: 1765#(and (or (<= ~result_12~0 0) (= (mod ~is_null_9~0 256) 0)) (or (<= ~result_12~0 0) (< 0 ~result_18~0))), 1266#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 1185#(or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)), Black: 1676#(or (<= ~result_12~0 0) (= (mod ~is_null_9~0 256) 0)), 52#L158-4true, 1249#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), 1220#true, Black: 1782#(<= 1005 ~result_18~0), Black: 632#(and (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0) (= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|))]) [2022-12-06 05:10:52,042 INFO L382 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-06 05:10:52,042 INFO L385 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-06 05:10:52,042 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-06 05:10:52,042 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-06 05:10:52,198 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2152] thread2EXIT-->L160-2: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem95#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_#t~mem95#1=|v_ULTIMATE.start_main_#t~mem95#1_5|, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_#t~mem95#1=|v_ULTIMATE.start_main_#t~mem95#1_5|, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][142], [Black: 645#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 1210#(or (<= (+ ~result_12~0 995) 0) (and (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)) (or (<= (+ ~result_12~0 ~get_subject_7~0) ~get_subject_3~0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 767#(< (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|), Black: 763#(< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|), 1514#true, 985#true, Black: 1223#(or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= (+ ~result_12~0 ~get_subject_7~0) (+ ~result_18~0 ~get_subject_11~0))) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0)), Black: 1226#(and (or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)) (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= (+ ~result_12~0 ~get_subject_7~0) (+ ~result_18~0 ~get_subject_11~0))) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0))), 634#true, Black: 1237#(and (= ~break_20~0 0) (= ~i_19~0 0)), Black: 1241#(and (= ~i_16~0 0) (= ~break_17~0 0)), 539#L160-2true, 1781#(or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= 1005 ~result_18~0)), Black: 991#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 4) (= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 1245#(and (= ~break_14~0 0) (= ~i_13~0 0)), Black: 1264#true, Black: 1247#true, Black: 1189#(and (or (<= (+ ~result_15~0 995) 0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (<= 1005 ~result_18~0) (and (<= (+ ~result_15~0 ~get_subject_3~0) (+ ~result_18~0 ~get_subject_7~0)) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))) (or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0))), Black: 1765#(and (or (<= ~result_12~0 0) (= (mod ~is_null_9~0 256) 0)) (or (<= ~result_12~0 0) (< 0 ~result_18~0))), Black: 1192#(and (or (<= (+ ~result_15~0 995) 0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (<= 1005 ~result_18~0) (and (<= (+ ~result_15~0 ~get_subject_3~0) (+ ~result_18~0 ~get_subject_7~0)) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))) (or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)) (or (<= (+ ~result_15~0 995) 0) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0) (<= (+ ~result_15~0 ~result_12~0) ~result_18~0))), 465#thread3EXITtrue, 1185#(or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)), Black: 1676#(or (<= ~result_12~0 0) (= (mod ~is_null_9~0 256) 0)), 1266#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), 1222#(or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)), 1249#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 1782#(<= 1005 ~result_18~0), Black: 632#(and (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0) (= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|))]) [2022-12-06 05:10:52,198 INFO L382 tUnfolder$Statistics]: this new event has 45 ancestors and is not cut-off event [2022-12-06 05:10:52,198 INFO L385 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2022-12-06 05:10:52,198 INFO L385 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2022-12-06 05:10:52,198 INFO L385 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2022-12-06 05:10:52,202 INFO L130 PetriNetUnfolder]: 1335/3387 cut-off events. [2022-12-06 05:10:52,202 INFO L131 PetriNetUnfolder]: For 5773/5976 co-relation queries the response was YES. [2022-12-06 05:10:52,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10035 conditions, 3387 events. 1335/3387 cut-off events. For 5773/5976 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 29429 event pairs, 31 based on Foata normal form. 77/2811 useless extension candidates. Maximal degree in co-relation 9984. Up to 859 conditions per place. [2022-12-06 05:10:52,245 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 146 transitions, 1244 flow [2022-12-06 05:10:52,246 INFO L188 LiptonReduction]: Number of co-enabled transitions 3232 [2022-12-06 05:10:52,257 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:10:52,257 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 462 [2022-12-06 05:10:52,257 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 146 transitions, 1244 flow [2022-12-06 05:10:52,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:10:52,258 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:10:52,258 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:10:52,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 05:10:52,258 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:10:52,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:10:52,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1521595665, now seen corresponding path program 2 times [2022-12-06 05:10:52,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:10:52,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852134131] [2022-12-06 05:10:52,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:10:52,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:10:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:10:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-06 05:10:52,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:10:52,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852134131] [2022-12-06 05:10:52,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852134131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:10:52,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:10:52,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:10:52,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834524749] [2022-12-06 05:10:52,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:10:52,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:10:52,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:10:52,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:10:52,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:10:52,563 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 05:10:52,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 146 transitions, 1244 flow. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:10:52,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:10:52,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 05:10:52,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:11:00,263 INFO L130 PetriNetUnfolder]: 40645/54734 cut-off events. [2022-12-06 05:11:00,263 INFO L131 PetriNetUnfolder]: For 119358/119358 co-relation queries the response was YES. [2022-12-06 05:11:00,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204063 conditions, 54734 events. 40645/54734 cut-off events. For 119358/119358 co-relation queries the response was YES. Maximal size of possible extension queue 1396. Compared 309007 event pairs, 7554 based on Foata normal form. 35/45059 useless extension candidates. Maximal degree in co-relation 204007. Up to 48378 conditions per place. [2022-12-06 05:11:00,739 INFO L137 encePairwiseOnDemand]: 43/48 looper letters, 176 selfloop transitions, 13 changer transitions 47/236 dead transitions. [2022-12-06 05:11:00,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 236 transitions, 2126 flow [2022-12-06 05:11:00,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:11:00,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:11:00,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2022-12-06 05:11:00,740 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5041666666666667 [2022-12-06 05:11:00,740 INFO L175 Difference]: Start difference. First operand has 94 places, 146 transitions, 1244 flow. Second operand 5 states and 121 transitions. [2022-12-06 05:11:00,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 236 transitions, 2126 flow [2022-12-06 05:11:02,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 236 transitions, 2064 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 05:11:02,949 INFO L231 Difference]: Finished difference. Result has 97 places, 132 transitions, 1077 flow [2022-12-06 05:11:02,949 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1169, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1077, PETRI_PLACES=97, PETRI_TRANSITIONS=132} [2022-12-06 05:11:02,949 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 51 predicate places. [2022-12-06 05:11:02,949 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:11:02,949 INFO L89 Accepts]: Start accepts. Operand has 97 places, 132 transitions, 1077 flow [2022-12-06 05:11:02,950 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:11:02,950 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:11:02,950 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 132 transitions, 1077 flow [2022-12-06 05:11:02,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 132 transitions, 1077 flow [2022-12-06 05:11:03,158 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2929] L58-->L58-7: Formula: (let ((.cse1 (= (mod v_~break_14~0_In_19 256) 0)) (.cse2 (not |v_thread1Thread1of1ForFork1_#t~short10#1_Out_6|)) (.cse0 (= (ite |v_thread1Thread1of1ForFork1_#t~short10#1_Out_6| (+ v_~i_13~0_In_26 (- 1000)) v_~result_12~0_In_15) v_~result_12~0_Out_52))) (or (and |v_thread1Thread1of1ForFork1_#t~short10#1_55| .cse0 .cse1 (let ((.cse3 (= (mod (select (select |v_#memory_int_In_61| v_~ends_with_2~0.base_In_13) (+ v_~i_13~0_In_26 v_~ends_with_2~0.offset_In_13)) 256) 0))) (or (and .cse2 .cse3) (and (not .cse3) |v_thread1Thread1of1ForFork1_#t~short10#1_Out_6|)))) (and (not .cse1) .cse2 .cse0))) InVars {~i_13~0=v_~i_13~0_In_26, #memory_int=|v_#memory_int_In_61|, ~result_12~0=v_~result_12~0_In_15, ~break_14~0=v_~break_14~0_In_19, ~ends_with_2~0.base=v_~ends_with_2~0.base_In_13, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_In_13} OutVars{thread1Thread1of1ForFork1_#t~short10#1=|v_thread1Thread1of1ForFork1_#t~short10#1_Out_6|, ~i_13~0=v_~i_13~0_In_26, thread1Thread1of1ForFork1_#t~mem9#1=|v_thread1Thread1of1ForFork1_#t~mem9#1_Out_8|, #memory_int=|v_#memory_int_In_61|, ~result_12~0=v_~result_12~0_Out_52, ~break_14~0=v_~break_14~0_In_19, ~ends_with_2~0.base=v_~ends_with_2~0.base_In_13, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_In_13} AuxVars[|v_thread1Thread1of1ForFork1_#t~short10#1_55|] AssignedVars[thread1Thread1of1ForFork1_#t~short10#1, thread1Thread1of1ForFork1_#t~mem9#1, ~result_12~0][103], [Black: 645#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 1792#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)) (<= 1005 ~result_18~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))), Black: 1210#(or (<= (+ ~result_12~0 995) 0) (and (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)) (or (<= (+ ~result_12~0 ~get_subject_7~0) ~get_subject_3~0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 767#(< (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|), Black: 763#(< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|), 1514#true, 1241#(and (= ~i_16~0 0) (= ~break_17~0 0)), 985#true, 517#L58-7true, Black: 1223#(or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= (+ ~result_12~0 ~get_subject_7~0) (+ ~result_18~0 ~get_subject_11~0))) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0)), Black: 1222#(or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)), Black: 1226#(and (or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)) (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= (+ ~result_12~0 ~get_subject_7~0) (+ ~result_18~0 ~get_subject_11~0))) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0))), 1183#true, 634#true, Black: 1237#(and (= ~break_20~0 0) (= ~i_19~0 0)), 180#L81-4true, Black: 1245#(and (= ~break_14~0 0) (= ~i_13~0 0)), Black: 991#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 4) (= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 1264#true, Black: 1247#true, 587#L108-4true, Black: 1189#(and (or (<= (+ ~result_15~0 995) 0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (<= 1005 ~result_18~0) (and (<= (+ ~result_15~0 ~get_subject_3~0) (+ ~result_18~0 ~get_subject_7~0)) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))) (or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0))), Black: 1192#(and (or (<= (+ ~result_15~0 995) 0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (<= 1005 ~result_18~0) (and (<= (+ ~result_15~0 ~get_subject_3~0) (+ ~result_18~0 ~get_subject_7~0)) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))) (or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)) (or (<= (+ ~result_15~0 995) 0) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0) (<= (+ ~result_15~0 ~result_12~0) ~result_18~0))), Black: 1765#(and (or (<= ~result_12~0 0) (= (mod ~is_null_9~0 256) 0)) (or (<= ~result_12~0 0) (< 0 ~result_18~0))), Black: 1185#(or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)), Black: 1676#(or (<= ~result_12~0 0) (= (mod ~is_null_9~0 256) 0)), 1266#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), 52#L158-4true, 1786#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))), 1220#true, 1249#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 632#(and (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0) (= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|))]) [2022-12-06 05:11:03,158 INFO L382 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-06 05:11:03,158 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-06 05:11:03,158 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-06 05:11:03,159 INFO L385 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-06 05:11:03,302 INFO L130 PetriNetUnfolder]: 1166/2967 cut-off events. [2022-12-06 05:11:03,302 INFO L131 PetriNetUnfolder]: For 4885/5021 co-relation queries the response was YES. [2022-12-06 05:11:03,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8529 conditions, 2967 events. 1166/2967 cut-off events. For 4885/5021 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 24921 event pairs, 24 based on Foata normal form. 56/2437 useless extension candidates. Maximal degree in co-relation 8480. Up to 717 conditions per place. [2022-12-06 05:11:03,340 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 132 transitions, 1077 flow [2022-12-06 05:11:03,340 INFO L188 LiptonReduction]: Number of co-enabled transitions 2736 [2022-12-06 05:11:03,349 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:11:03,349 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 400 [2022-12-06 05:11:03,349 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 132 transitions, 1077 flow [2022-12-06 05:11:03,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:11:03,350 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:11:03,350 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:11:03,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 05:11:03,350 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:11:03,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:11:03,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1486424277, now seen corresponding path program 3 times [2022-12-06 05:11:03,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:11:03,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512104194] [2022-12-06 05:11:03,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:11:03,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:11:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:11:03,560 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-06 05:11:03,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:11:03,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512104194] [2022-12-06 05:11:03,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512104194] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:11:03,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:11:03,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:11:03,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103045446] [2022-12-06 05:11:03,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:11:03,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:11:03,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:11:03,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:11:03,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:11:03,561 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 05:11:03,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 132 transitions, 1077 flow. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:11:03,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:11:03,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 05:11:03,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:11:11,130 INFO L130 PetriNetUnfolder]: 40207/54932 cut-off events. [2022-12-06 05:11:11,130 INFO L131 PetriNetUnfolder]: For 91007/91007 co-relation queries the response was YES. [2022-12-06 05:11:11,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191574 conditions, 54932 events. 40207/54932 cut-off events. For 91007/91007 co-relation queries the response was YES. Maximal size of possible extension queue 1436. Compared 325061 event pairs, 18721 based on Foata normal form. 4/44860 useless extension candidates. Maximal degree in co-relation 191521. Up to 49234 conditions per place. [2022-12-06 05:11:11,592 INFO L137 encePairwiseOnDemand]: 45/48 looper letters, 120 selfloop transitions, 0 changer transitions 73/193 dead transitions. [2022-12-06 05:11:11,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 193 transitions, 1759 flow [2022-12-06 05:11:11,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:11:11,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:11:11,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-12-06 05:11:11,594 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4895833333333333 [2022-12-06 05:11:11,594 INFO L175 Difference]: Start difference. First operand has 93 places, 132 transitions, 1077 flow. Second operand 4 states and 94 transitions. [2022-12-06 05:11:11,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 193 transitions, 1759 flow [2022-12-06 05:11:12,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 193 transitions, 1736 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-06 05:11:12,106 INFO L231 Difference]: Finished difference. Result has 94 places, 120 transitions, 897 flow [2022-12-06 05:11:12,107 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=897, PETRI_PLACES=94, PETRI_TRANSITIONS=120} [2022-12-06 05:11:12,107 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 48 predicate places. [2022-12-06 05:11:12,107 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:11:12,107 INFO L89 Accepts]: Start accepts. Operand has 94 places, 120 transitions, 897 flow [2022-12-06 05:11:12,108 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:11:12,108 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:11:12,108 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 120 transitions, 897 flow [2022-12-06 05:11:12,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 120 transitions, 897 flow [2022-12-06 05:11:12,448 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2929] L58-->L58-7: Formula: (let ((.cse1 (= (mod v_~break_14~0_In_19 256) 0)) (.cse2 (not |v_thread1Thread1of1ForFork1_#t~short10#1_Out_6|)) (.cse0 (= (ite |v_thread1Thread1of1ForFork1_#t~short10#1_Out_6| (+ v_~i_13~0_In_26 (- 1000)) v_~result_12~0_In_15) v_~result_12~0_Out_52))) (or (and |v_thread1Thread1of1ForFork1_#t~short10#1_55| .cse0 .cse1 (let ((.cse3 (= (mod (select (select |v_#memory_int_In_61| v_~ends_with_2~0.base_In_13) (+ v_~i_13~0_In_26 v_~ends_with_2~0.offset_In_13)) 256) 0))) (or (and .cse2 .cse3) (and (not .cse3) |v_thread1Thread1of1ForFork1_#t~short10#1_Out_6|)))) (and (not .cse1) .cse2 .cse0))) InVars {~i_13~0=v_~i_13~0_In_26, #memory_int=|v_#memory_int_In_61|, ~result_12~0=v_~result_12~0_In_15, ~break_14~0=v_~break_14~0_In_19, ~ends_with_2~0.base=v_~ends_with_2~0.base_In_13, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_In_13} OutVars{thread1Thread1of1ForFork1_#t~short10#1=|v_thread1Thread1of1ForFork1_#t~short10#1_Out_6|, ~i_13~0=v_~i_13~0_In_26, thread1Thread1of1ForFork1_#t~mem9#1=|v_thread1Thread1of1ForFork1_#t~mem9#1_Out_8|, #memory_int=|v_#memory_int_In_61|, ~result_12~0=v_~result_12~0_Out_52, ~break_14~0=v_~break_14~0_In_19, ~ends_with_2~0.base=v_~ends_with_2~0.base_In_13, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_In_13} AuxVars[|v_thread1Thread1of1ForFork1_#t~short10#1_55|] AssignedVars[thread1Thread1of1ForFork1_#t~short10#1, thread1Thread1of1ForFork1_#t~mem9#1, ~result_12~0][91], [Black: 645#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 767#(< (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|), Black: 763#(< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|), 1514#true, Black: 1797#(or (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= 1005 ~result_18~0)), Black: 1798#(<= 1005 ~result_18~0), 1241#(and (= ~i_16~0 0) (= ~break_17~0 0)), 985#true, 517#L58-7true, Black: 1223#(or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= (+ ~result_12~0 ~get_subject_7~0) (+ ~result_18~0 ~get_subject_11~0))) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0)), Black: 1222#(or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)), Black: 1226#(and (or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)) (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= (+ ~result_12~0 ~get_subject_7~0) (+ ~result_18~0 ~get_subject_11~0))) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0))), 1183#true, 634#true, Black: 1237#(and (= ~break_20~0 0) (= ~i_19~0 0)), 180#L81-4true, Black: 991#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 4) (= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 1245#(and (= ~break_14~0 0) (= ~i_13~0 0)), Black: 1264#true, 587#L108-4true, Black: 1247#true, Black: 1189#(and (or (<= (+ ~result_15~0 995) 0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (<= 1005 ~result_18~0) (and (<= (+ ~result_15~0 ~get_subject_3~0) (+ ~result_18~0 ~get_subject_7~0)) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))) (or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0))), Black: 1192#(and (or (<= (+ ~result_15~0 995) 0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (<= 1005 ~result_18~0) (and (<= (+ ~result_15~0 ~get_subject_3~0) (+ ~result_18~0 ~get_subject_7~0)) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))) (or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)) (or (<= (+ ~result_15~0 995) 0) (<= (+ ~result_12~0 995) 0) (<= 1005 ~result_18~0) (<= (+ ~result_15~0 ~result_12~0) ~result_18~0))), Black: 1676#(or (<= ~result_12~0 0) (= (mod ~is_null_9~0 256) 0)), Black: 1185#(or (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (and (not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))) (<= ~get_subject_3~0 (+ ~result_18~0 ~get_subject_11~0))) (<= 1005 ~result_18~0)), 1266#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), 52#L158-4true, 1786#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))), 1220#true, 1249#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 632#(and (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0) (= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|))]) [2022-12-06 05:11:12,449 INFO L382 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-06 05:11:12,449 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-06 05:11:12,449 INFO L385 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-06 05:11:12,449 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-06 05:11:12,596 INFO L130 PetriNetUnfolder]: 1130/2875 cut-off events. [2022-12-06 05:11:12,596 INFO L131 PetriNetUnfolder]: For 4241/4368 co-relation queries the response was YES. [2022-12-06 05:11:12,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8177 conditions, 2875 events. 1130/2875 cut-off events. For 4241/4368 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 23902 event pairs, 21 based on Foata normal form. 56/2360 useless extension candidates. Maximal degree in co-relation 8139. Up to 686 conditions per place. [2022-12-06 05:11:12,632 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 120 transitions, 897 flow [2022-12-06 05:11:12,632 INFO L188 LiptonReduction]: Number of co-enabled transitions 2588 [2022-12-06 05:11:12,639 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:11:12,640 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 533 [2022-12-06 05:11:12,640 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 120 transitions, 897 flow [2022-12-06 05:11:12,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:11:12,640 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:11:12,640 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:11:12,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 05:11:12,641 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:11:12,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:11:12,641 INFO L85 PathProgramCache]: Analyzing trace with hash -934702625, now seen corresponding path program 1 times [2022-12-06 05:11:12,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:11:12,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775265043] [2022-12-06 05:11:12,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:11:12,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:11:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:11:15,127 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:11:15,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:11:15,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775265043] [2022-12-06 05:11:15,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775265043] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:11:15,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100399861] [2022-12-06 05:11:15,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:11:15,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:11:15,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:11:15,140 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:11:15,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 05:11:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:11:15,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 05:11:15,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:11:15,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2022-12-06 05:11:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-06 05:11:15,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:11:16,079 INFO L321 Elim1Store]: treesize reduction 33, result has 78.4 percent of original size [2022-12-06 05:11:16,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 173 [2022-12-06 05:11:16,232 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-06 05:11:16,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100399861] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:11:16,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:11:16,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 9] total 33 [2022-12-06 05:11:16,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939430167] [2022-12-06 05:11:16,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:11:16,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-06 05:11:16,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:11:16,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-06 05:11:16,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=908, Unknown=0, NotChecked=0, Total=1056 [2022-12-06 05:11:16,234 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 05:11:16,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 120 transitions, 897 flow. Second operand has 33 states, 33 states have (on average 2.9696969696969697) internal successors, (98), 33 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:11:16,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:11:16,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 05:11:16,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand