/usr/bin/java -Xmx16000000000 -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-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 09:58:07,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 09:58:07,717 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 09:58:07,735 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 09:58:07,735 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 09:58:07,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 09:58:07,736 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 09:58:07,737 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 09:58:07,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 09:58:07,742 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 09:58:07,743 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 09:58:07,745 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 09:58:07,745 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 09:58:07,746 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 09:58:07,747 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 09:58:07,748 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 09:58:07,748 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 09:58:07,748 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 09:58:07,749 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 09:58:07,750 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 09:58:07,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 09:58:07,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 09:58:07,759 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 09:58:07,760 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 09:58:07,767 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 09:58:07,767 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 09:58:07,767 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 09:58:07,768 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 09:58:07,768 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 09:58:07,769 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 09:58:07,769 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 09:58:07,769 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 09:58:07,770 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 09:58:07,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 09:58:07,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 09:58:07,771 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 09:58:07,771 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 09:58:07,771 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 09:58:07,772 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 09:58:07,772 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 09:58:07,772 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 09:58:07,773 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-VariableLbe.epf [2023-01-28 09:58:07,785 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 09:58:07,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 09:58:07,786 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 09:58:07,786 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 09:58:07,786 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 09:58:07,787 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 09:58:07,787 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 09:58:07,787 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 09:58:07,787 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 09:58:07,787 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 09:58:07,787 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 09:58:07,787 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 09:58:07,788 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 09:58:07,788 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 09:58:07,788 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 09:58:07,788 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 09:58:07,788 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 09:58:07,788 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 09:58:07,792 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 09:58:07,793 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 09:58:07,793 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 09:58:07,793 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 09:58:07,793 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 09:58:07,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 09:58:07,794 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 09:58:07,794 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 09:58:07,794 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 09:58:07,794 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 09:58:07,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 09:58:07,795 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 09:58:07,795 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 09:58:07,795 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 09:58:07,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 09:58:07,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 09:58:07,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 09:58:07,998 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 09:58:07,999 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 09:58:08,000 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c [2023-01-28 09:58:08,875 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 09:58:09,045 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 09:58:09,045 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c [2023-01-28 09:58:09,049 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad55ada42/3311c04a1d1e4ceb9ad9998c6dfdcc7e/FLAGcee07ba4a [2023-01-28 09:58:09,057 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad55ada42/3311c04a1d1e4ceb9ad9998c6dfdcc7e [2023-01-28 09:58:09,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 09:58:09,060 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 09:58:09,061 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 09:58:09,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 09:58:09,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 09:58:09,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:58:09" (1/1) ... [2023-01-28 09:58:09,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@384e150f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:58:09, skipping insertion in model container [2023-01-28 09:58:09,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:58:09" (1/1) ... [2023-01-28 09:58:09,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 09:58:09,079 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 09:58:09,185 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c[4400,4413] [2023-01-28 09:58:09,188 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 09:58:09,194 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 09:58:09,217 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c[4400,4413] [2023-01-28 09:58:09,218 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 09:58:09,227 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 09:58:09,227 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 09:58:09,232 INFO L208 MainTranslator]: Completed translation [2023-01-28 09:58:09,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:58:09 WrapperNode [2023-01-28 09:58:09,232 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 09:58:09,233 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 09:58:09,233 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 09:58:09,233 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 09:58:09,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:58:09" (1/1) ... [2023-01-28 09:58:09,243 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:58:09" (1/1) ... [2023-01-28 09:58:09,265 INFO L138 Inliner]: procedures = 25, calls = 100, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 288 [2023-01-28 09:58:09,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 09:58:09,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 09:58:09,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 09:58:09,266 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 09:58:09,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:58:09" (1/1) ... [2023-01-28 09:58:09,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:58:09" (1/1) ... [2023-01-28 09:58:09,289 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:58:09" (1/1) ... [2023-01-28 09:58:09,289 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:58:09" (1/1) ... [2023-01-28 09:58:09,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:58:09" (1/1) ... [2023-01-28 09:58:09,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:58:09" (1/1) ... [2023-01-28 09:58:09,297 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:58:09" (1/1) ... [2023-01-28 09:58:09,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:58:09" (1/1) ... [2023-01-28 09:58:09,300 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 09:58:09,300 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 09:58:09,300 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 09:58:09,300 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 09:58:09,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:58:09" (1/1) ... [2023-01-28 09:58:09,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 09:58:09,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:58:09,333 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) [2023-01-28 09:58:09,345 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 [2023-01-28 09:58:09,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 09:58:09,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 09:58:09,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 09:58:09,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 09:58:09,366 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-28 09:58:09,366 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-28 09:58:09,366 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-28 09:58:09,367 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-28 09:58:09,367 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-28 09:58:09,367 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-28 09:58:09,367 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-01-28 09:58:09,368 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-01-28 09:58:09,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 09:58:09,368 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-01-28 09:58:09,368 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-01-28 09:58:09,368 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-01-28 09:58:09,368 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-01-28 09:58:09,368 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 09:58:09,368 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 09:58:09,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 09:58:09,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 09:58:09,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 09:58:09,369 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 09:58:09,445 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 09:58:09,446 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 09:58:09,757 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 09:58:09,810 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 09:58:09,810 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 09:58:09,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:58:09 BoogieIcfgContainer [2023-01-28 09:58:09,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 09:58:09,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 09:58:09,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 09:58:09,818 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 09:58:09,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 09:58:09" (1/3) ... [2023-01-28 09:58:09,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df71678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:58:09, skipping insertion in model container [2023-01-28 09:58:09,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:58:09" (2/3) ... [2023-01-28 09:58:09,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df71678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:58:09, skipping insertion in model container [2023-01-28 09:58:09,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:58:09" (3/3) ... [2023-01-28 09:58:09,819 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-6.wvr.c [2023-01-28 09:58:09,832 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 09:58:09,832 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 09:58:09,832 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 09:58:09,883 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2023-01-28 09:58:09,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 208 places, 191 transitions, 430 flow [2023-01-28 09:58:09,955 INFO L130 PetriNetUnfolder]: 2/185 cut-off events. [2023-01-28 09:58:09,955 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-01-28 09:58:09,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 185 events. 2/185 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 144. Up to 2 conditions per place. [2023-01-28 09:58:09,958 INFO L82 GeneralOperation]: Start removeDead. Operand has 208 places, 191 transitions, 430 flow [2023-01-28 09:58:09,961 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 186 places, 169 transitions, 374 flow [2023-01-28 09:58:09,964 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 09:58:09,969 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 169 transitions, 374 flow [2023-01-28 09:58:09,971 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 169 transitions, 374 flow [2023-01-28 09:58:09,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 169 transitions, 374 flow [2023-01-28 09:58:09,998 INFO L130 PetriNetUnfolder]: 2/169 cut-off events. [2023-01-28 09:58:09,998 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-01-28 09:58:09,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 169 events. 2/169 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 144. Up to 2 conditions per place. [2023-01-28 09:58:10,000 INFO L119 LiptonReduction]: Number of co-enabled transitions 3042 [2023-01-28 09:58:15,205 INFO L134 LiptonReduction]: Checked pairs total: 15662 [2023-01-28 09:58:15,206 INFO L136 LiptonReduction]: Total number of compositions: 126 [2023-01-28 09:58:15,215 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 09:58:15,219 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@567990bc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 09:58:15,220 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-28 09:58:15,228 INFO L130 PetriNetUnfolder]: 0/49 cut-off events. [2023-01-28 09:58:15,228 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-01-28 09:58:15,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:58:15,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 09:58:15,229 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 4 more)] === [2023-01-28 09:58:15,232 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:58:15,233 INFO L85 PathProgramCache]: Analyzing trace with hash 477829290, now seen corresponding path program 1 times [2023-01-28 09:58:15,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:58:15,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552775315] [2023-01-28 09:58:15,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:58:15,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:58:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:58:16,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 09:58:16,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:58:16,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552775315] [2023-01-28 09:58:16,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552775315] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 09:58:16,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 09:58:16,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 09:58:16,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013893933] [2023-01-28 09:58:16,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 09:58:16,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 09:58:16,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:58:16,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 09:58:16,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2023-01-28 09:58:16,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 317 [2023-01-28 09:58:16,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 50 transitions, 136 flow. Second operand has 7 states, 7 states have (on average 152.14285714285714) internal successors, (1065), 7 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 09:58:16,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:58:16,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 317 [2023-01-28 09:58:16,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:58:39,636 INFO L130 PetriNetUnfolder]: 421515/526270 cut-off events. [2023-01-28 09:58:39,636 INFO L131 PetriNetUnfolder]: For 30975/30975 co-relation queries the response was YES. [2023-01-28 09:58:40,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1079754 conditions, 526270 events. 421515/526270 cut-off events. For 30975/30975 co-relation queries the response was YES. Maximal size of possible extension queue 9895. Compared 3008673 event pairs, 87704 based on Foata normal form. 2/526272 useless extension candidates. Maximal degree in co-relation 953919. Up to 234423 conditions per place. [2023-01-28 09:58:41,621 INFO L137 encePairwiseOnDemand]: 308/317 looper letters, 143 selfloop transitions, 18 changer transitions 58/219 dead transitions. [2023-01-28 09:58:41,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 219 transitions, 1014 flow [2023-01-28 09:58:41,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 09:58:41,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 09:58:41,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1236 transitions. [2023-01-28 09:58:41,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5570076611086074 [2023-01-28 09:58:41,635 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1236 transitions. [2023-01-28 09:58:41,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1236 transitions. [2023-01-28 09:58:41,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:58:41,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1236 transitions. [2023-01-28 09:58:41,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 176.57142857142858) internal successors, (1236), 7 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 09:58:41,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 317.0) internal successors, (2536), 8 states have internal predecessors, (2536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 09:58:41,650 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 317.0) internal successors, (2536), 8 states have internal predecessors, (2536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 09:58:41,651 INFO L175 Difference]: Start difference. First operand has 69 places, 50 transitions, 136 flow. Second operand 7 states and 1236 transitions. [2023-01-28 09:58:41,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 219 transitions, 1014 flow [2023-01-28 09:58:53,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 219 transitions, 922 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-01-28 09:58:53,748 INFO L231 Difference]: Finished difference. Result has 67 places, 71 transitions, 236 flow [2023-01-28 09:58:53,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=236, PETRI_PLACES=67, PETRI_TRANSITIONS=71} [2023-01-28 09:58:53,751 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -2 predicate places. [2023-01-28 09:58:53,751 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 71 transitions, 236 flow [2023-01-28 09:58:53,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 152.14285714285714) internal successors, (1065), 7 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 09:58:53,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:58:53,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 09:58:53,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 09:58:53,752 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 4 more)] === [2023-01-28 09:58:53,753 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:58:53,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1298141890, now seen corresponding path program 2 times [2023-01-28 09:58:53,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:58:53,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844675443] [2023-01-28 09:58:53,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:58:53,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:58:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:58:54,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 09:58:54,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:58:54,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844675443] [2023-01-28 09:58:54,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844675443] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 09:58:54,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 09:58:54,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 09:58:54,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048221385] [2023-01-28 09:58:54,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 09:58:54,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 09:58:54,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:58:54,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 09:58:54,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 09:58:54,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 317 [2023-01-28 09:58:54,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 71 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 156.16666666666666) internal successors, (937), 6 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 09:58:54,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:58:54,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 317 [2023-01-28 09:58:54,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:59:00,734 INFO L130 PetriNetUnfolder]: 110776/147831 cut-off events. [2023-01-28 09:59:00,734 INFO L131 PetriNetUnfolder]: For 4523/5029 co-relation queries the response was YES. [2023-01-28 09:59:01,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303404 conditions, 147831 events. 110776/147831 cut-off events. For 4523/5029 co-relation queries the response was YES. Maximal size of possible extension queue 5871. Compared 982459 event pairs, 16644 based on Foata normal form. 1180/139833 useless extension candidates. Maximal degree in co-relation 303393. Up to 115357 conditions per place. [2023-01-28 09:59:01,627 INFO L137 encePairwiseOnDemand]: 303/317 looper letters, 126 selfloop transitions, 30 changer transitions 0/184 dead transitions. [2023-01-28 09:59:01,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 184 transitions, 794 flow [2023-01-28 09:59:01,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 09:59:01,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 09:59:01,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1201 transitions. [2023-01-28 09:59:01,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5412347904461469 [2023-01-28 09:59:01,777 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1201 transitions. [2023-01-28 09:59:01,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1201 transitions. [2023-01-28 09:59:01,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:59:01,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1201 transitions. [2023-01-28 09:59:01,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 171.57142857142858) internal successors, (1201), 7 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 09:59:01,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 317.0) internal successors, (2536), 8 states have internal predecessors, (2536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 09:59:01,783 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 317.0) internal successors, (2536), 8 states have internal predecessors, (2536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 09:59:01,783 INFO L175 Difference]: Start difference. First operand has 67 places, 71 transitions, 236 flow. Second operand 7 states and 1201 transitions. [2023-01-28 09:59:01,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 184 transitions, 794 flow [2023-01-28 09:59:01,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 184 transitions, 784 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-28 09:59:01,821 INFO L231 Difference]: Finished difference. Result has 74 places, 100 transitions, 403 flow [2023-01-28 09:59:01,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=403, PETRI_PLACES=74, PETRI_TRANSITIONS=100} [2023-01-28 09:59:01,821 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 5 predicate places. [2023-01-28 09:59:01,822 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 100 transitions, 403 flow [2023-01-28 09:59:01,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 156.16666666666666) internal successors, (937), 6 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 09:59:01,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:59:01,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 09:59:01,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 09:59:01,823 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 4 more)] === [2023-01-28 09:59:01,825 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:59:01,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1863345826, now seen corresponding path program 3 times [2023-01-28 09:59:01,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:59:01,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524336656] [2023-01-28 09:59:01,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:59:01,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:59:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:59:02,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 09:59:02,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:59:02,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524336656] [2023-01-28 09:59:02,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524336656] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 09:59:02,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 09:59:02,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-01-28 09:59:02,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179533612] [2023-01-28 09:59:02,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 09:59:02,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 09:59:02,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:59:02,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 09:59:02,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-01-28 09:59:02,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 317 [2023-01-28 09:59:02,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 100 transitions, 403 flow. Second operand has 9 states, 9 states have (on average 153.77777777777777) internal successors, (1384), 9 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 09:59:02,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:59:02,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 317 [2023-01-28 09:59:02,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:59:15,459 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][273], [60#L181-4true, 72#L150true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), 50#L45true, Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 147#L74true, 49#thread5EXITtrue, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 129#L93true, 245#(<= (+ ~s~0 4) ~t~0), 223#true, 216#(and (= ~b~0 0) (not (= ~x~0 1))), Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-01-28 09:59:15,459 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-01-28 09:59:15,460 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-01-28 09:59:15,460 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-01-28 09:59:15,460 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-01-28 09:59:16,957 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][273], [60#L181-4true, 72#L150true, 44#L49true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 147#L74true, 49#thread5EXITtrue, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 129#L93true, 245#(<= (+ ~s~0 4) ~t~0), 223#true, 216#(and (= ~b~0 0) (not (= ~x~0 1))), Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-01-28 09:59:16,957 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-01-28 09:59:16,957 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-01-28 09:59:16,958 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-01-28 09:59:16,958 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-01-28 09:59:17,017 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][273], [72#L150true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), 50#L45true, Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 87#L182-1true, 150#L112true, 147#L74true, 49#thread5EXITtrue, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 245#(<= (+ ~s~0 4) ~t~0), 129#L93true, 223#true, 216#(and (= ~b~0 0) (not (= ~x~0 1))), Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-01-28 09:59:17,017 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-01-28 09:59:17,017 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-01-28 09:59:17,017 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-01-28 09:59:17,017 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-01-28 09:59:18,058 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][313], [60#L181-4true, 72#L150true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 211#true, 147#L74true, 49#thread5EXITtrue, 13#L52true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 129#L93true, 245#(<= (+ ~s~0 4) ~t~0), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-01-28 09:59:18,058 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-01-28 09:59:18,058 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 09:59:18,058 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 09:59:18,058 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 09:59:18,463 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][312], [60#L181-4true, 72#L150true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 211#true, 147#L74true, 49#thread5EXITtrue, 13#L52true, 129#L93true, 245#(<= (+ ~s~0 4) ~t~0), Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-01-28 09:59:18,463 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-01-28 09:59:18,463 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 09:59:18,463 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 09:59:18,464 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 09:59:18,474 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][273], [72#L150true, 44#L49true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 87#L182-1true, Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 147#L74true, 49#thread5EXITtrue, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 245#(<= (+ ~s~0 4) ~t~0), 129#L93true, 216#(and (= ~b~0 0) (not (= ~x~0 1))), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-01-28 09:59:18,474 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-01-28 09:59:18,474 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 09:59:18,474 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 09:59:18,474 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 09:59:19,221 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][313], [72#L150true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 87#L182-1true, 150#L112true, 211#true, 147#L74true, 49#thread5EXITtrue, 13#L52true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 245#(<= (+ ~s~0 4) ~t~0), 129#L93true, 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-01-28 09:59:19,222 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-01-28 09:59:19,222 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 09:59:19,222 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 09:59:19,222 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 09:59:19,646 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][312], [72#L150true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 87#L182-1true, Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 211#true, 147#L74true, 49#thread5EXITtrue, 13#L52true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 245#(<= (+ ~s~0 4) ~t~0), 129#L93true, 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-01-28 09:59:19,646 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-01-28 09:59:19,646 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 09:59:19,646 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 09:59:19,646 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 09:59:20,954 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([557] L109-->L112: Formula: (= (ite (= (ite (or (not (= (mod v_~b~0_6 256) 0)) (= v_~x~0_5 1)) 1 0) 0) 0 1) v_~b~0_5) InVars {~b~0=v_~b~0_6, ~x~0=v_~x~0_5} OutVars{~b~0=v_~b~0_5, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[~b~0][199], [60#L181-4true, 243#(<= (+ 2 ~s~0) ~t~0), 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 211#true, 147#L74true, 194#thread1EXITtrue, 7#thread6EXITtrue, 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-01-28 09:59:20,954 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-01-28 09:59:20,954 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 09:59:20,954 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 09:59:20,954 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 09:59:21,256 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([658] L74-->thread2EXIT: Formula: (and (= (+ v_~s~0_127 1) v_~s~0_126) (= |v_thread2Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_127} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_7|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_7|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_#t~post4#1, ~s~0][263], [72#L150true, 37#thread2EXITtrue, 157#L183-1true, 243#(<= (+ 2 ~s~0) ~t~0), Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 211#true, 195#L105true, 49#thread5EXITtrue, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 129#L93true, 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-01-28 09:59:21,256 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-01-28 09:59:21,259 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 09:59:21,259 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 09:59:21,259 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 09:59:21,306 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([557] L109-->L112: Formula: (= (ite (= (ite (or (not (= (mod v_~b~0_6 256) 0)) (= v_~x~0_5 1)) 1 0) 0) 0 1) v_~b~0_5) InVars {~b~0=v_~b~0_6, ~x~0=v_~x~0_5} OutVars{~b~0=v_~b~0_5, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[~b~0][199], [243#(<= (+ 2 ~s~0) ~t~0), 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 87#L182-1true, Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 211#true, 147#L74true, 194#thread1EXITtrue, 7#thread6EXITtrue, 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-01-28 09:59:21,307 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-01-28 09:59:21,307 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 09:59:21,307 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 09:59:21,307 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 09:59:21,756 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([658] L74-->thread2EXIT: Formula: (and (= (+ v_~s~0_127 1) v_~s~0_126) (= |v_thread2Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_127} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_7|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_7|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_#t~post4#1, ~s~0][263], [72#L150true, 37#thread2EXITtrue, 157#L183-1true, 243#(<= (+ 2 ~s~0) ~t~0), Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 52#L109true, 211#true, 49#thread5EXITtrue, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 129#L93true, 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-01-28 09:59:21,757 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-01-28 09:59:21,757 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 09:59:21,757 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 09:59:21,757 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 09:59:21,785 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([668] L93-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res#1.offset_7| 0) (= (+ v_~s~0_135 1) v_~s~0_134) (= |v_thread3Thread1of1ForFork2_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_135} OutVars{thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_7|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_7|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_7|, ~s~0=v_~s~0_134} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_#t~post6#1, ~s~0][177], [72#L150true, 37#thread2EXITtrue, 110#L128true, 157#L183-1true, 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 211#true, 242#(<= (+ ~s~0 1) ~t~0), Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-01-28 09:59:21,785 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-01-28 09:59:21,785 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 09:59:21,786 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 09:59:21,786 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 09:59:21,787 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([658] L74-->thread2EXIT: Formula: (and (= (+ v_~s~0_127 1) v_~s~0_126) (= |v_thread2Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_127} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_7|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_7|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_#t~post4#1, ~s~0][202], [72#L150true, 37#thread2EXITtrue, 157#L183-1true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 52#L109true, 211#true, 49#thread5EXITtrue, 242#(<= (+ ~s~0 1) ~t~0), Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 129#L93true, 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-01-28 09:59:21,787 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-01-28 09:59:21,787 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 09:59:21,787 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 09:59:21,787 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 09:59:21,921 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([668] L93-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res#1.offset_7| 0) (= (+ v_~s~0_135 1) v_~s~0_134) (= |v_thread3Thread1of1ForFork2_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_135} OutVars{thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_7|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_7|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_7|, ~s~0=v_~s~0_134} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_#t~post6#1, ~s~0][177], [113#L183-2true, 72#L150true, 110#L128true, 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 211#true, 242#(<= (+ ~s~0 1) ~t~0), Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-01-28 09:59:21,921 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-01-28 09:59:21,922 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 09:59:21,922 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 09:59:21,922 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 09:59:22,005 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([668] L93-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res#1.offset_7| 0) (= (+ v_~s~0_135 1) v_~s~0_134) (= |v_thread3Thread1of1ForFork2_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_135} OutVars{thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_7|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_7|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_7|, ~s~0=v_~s~0_134} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_#t~post6#1, ~s~0][177], [72#L150true, 110#L128true, 80#thread3EXITtrue, 79#L184-1true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 211#true, 242#(<= (+ ~s~0 1) ~t~0), Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-01-28 09:59:22,005 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-01-28 09:59:22,005 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 09:59:22,005 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 09:59:22,005 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 09:59:22,128 INFO L130 PetriNetUnfolder]: 248438/349622 cut-off events. [2023-01-28 09:59:22,128 INFO L131 PetriNetUnfolder]: For 185337/185821 co-relation queries the response was YES. [2023-01-28 09:59:23,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 913048 conditions, 349622 events. 248438/349622 cut-off events. For 185337/185821 co-relation queries the response was YES. Maximal size of possible extension queue 15070. Compared 2920985 event pairs, 49714 based on Foata normal form. 1114/325906 useless extension candidates. Maximal degree in co-relation 488008. Up to 92985 conditions per place. [2023-01-28 09:59:24,874 INFO L137 encePairwiseOnDemand]: 303/317 looper letters, 213 selfloop transitions, 153 changer transitions 0/394 dead transitions. [2023-01-28 09:59:24,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 394 transitions, 2129 flow [2023-01-28 09:59:24,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-28 09:59:24,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-01-28 09:59:24,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2241 transitions. [2023-01-28 09:59:24,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5438000485319098 [2023-01-28 09:59:24,879 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2241 transitions. [2023-01-28 09:59:24,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2241 transitions. [2023-01-28 09:59:24,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:59:24,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2241 transitions. [2023-01-28 09:59:24,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 172.3846153846154) internal successors, (2241), 13 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 09:59:24,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 317.0) internal successors, (4438), 14 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 09:59:24,889 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 317.0) internal successors, (4438), 14 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 09:59:24,889 INFO L175 Difference]: Start difference. First operand has 74 places, 100 transitions, 403 flow. Second operand 13 states and 2241 transitions. [2023-01-28 09:59:24,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 394 transitions, 2129 flow [2023-01-28 09:59:25,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 394 transitions, 2129 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 09:59:25,476 INFO L231 Difference]: Finished difference. Result has 91 places, 240 transitions, 1596 flow [2023-01-28 09:59:25,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1596, PETRI_PLACES=91, PETRI_TRANSITIONS=240} [2023-01-28 09:59:25,477 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 22 predicate places. [2023-01-28 09:59:25,477 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 240 transitions, 1596 flow [2023-01-28 09:59:25,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 153.77777777777777) internal successors, (1384), 9 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 09:59:25,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:59:25,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 09:59:25,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 09:59:25,478 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 4 more)] === [2023-01-28 09:59:25,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:59:25,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1998415786, now seen corresponding path program 4 times [2023-01-28 09:59:25,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:59:25,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822820858] [2023-01-28 09:59:25,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:59:25,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:59:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:59:25,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 09:59:25,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:59:25,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822820858] [2023-01-28 09:59:25,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822820858] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 09:59:25,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 09:59:25,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 09:59:25,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599018182] [2023-01-28 09:59:25,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 09:59:25,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 09:59:25,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:59:25,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 09:59:25,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-28 09:59:25,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 317 [2023-01-28 09:59:25,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 240 transitions, 1596 flow. Second operand has 7 states, 7 states have (on average 155.14285714285714) internal successors, (1086), 7 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 09:59:25,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:59:25,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 317 [2023-01-28 09:59:25,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:59:48,891 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][340], [60#L181-4true, 72#L150true, Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 263#true, 150#L112true, 211#true, 147#L74true, 194#thread1EXITtrue, 49#thread5EXITtrue, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 238#true, 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-01-28 09:59:48,892 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-01-28 09:59:48,892 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 09:59:48,892 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 09:59:48,892 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 09:59:49,229 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([678] L131-->thread5EXIT: Formula: (and (= (+ v_~s~0_147 1) v_~s~0_146) (= |v_thread5Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread5Thread1of1ForFork1_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_147} OutVars{thread5Thread1of1ForFork1_#res#1.offset=|v_thread5Thread1of1ForFork1_#res#1.offset_7|, thread5Thread1of1ForFork1_#res#1.base=|v_thread5Thread1of1ForFork1_#res#1.base_7|, thread5Thread1of1ForFork1_#t~post10#1=|v_thread5Thread1of1ForFork1_#t~post10#1_7|, ~s~0=v_~s~0_146} AuxVars[] AssignedVars[thread5Thread1of1ForFork1_#res#1.offset, thread5Thread1of1ForFork1_#res#1.base, thread5Thread1of1ForFork1_#t~post10#1, ~s~0][302], [60#L181-4true, Black: 243#(<= (+ 2 ~s~0) ~t~0), 37#thread2EXITtrue, Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 263#true, 150#L112true, 211#true, 194#thread1EXITtrue, 49#thread5EXITtrue, 242#(<= (+ ~s~0 1) ~t~0), 7#thread6EXITtrue, 129#L93true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-01-28 09:59:49,229 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-01-28 09:59:49,229 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 09:59:49,229 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 09:59:49,229 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 09:59:49,530 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][340], [72#L150true, Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 87#L182-1true, 263#true, 150#L112true, 211#true, 147#L74true, 194#thread1EXITtrue, 49#thread5EXITtrue, 238#true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-01-28 09:59:49,531 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-01-28 09:59:49,536 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 09:59:49,536 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 09:59:49,536 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 09:59:49,977 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([678] L131-->thread5EXIT: Formula: (and (= (+ v_~s~0_147 1) v_~s~0_146) (= |v_thread5Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread5Thread1of1ForFork1_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_147} OutVars{thread5Thread1of1ForFork1_#res#1.offset=|v_thread5Thread1of1ForFork1_#res#1.offset_7|, thread5Thread1of1ForFork1_#res#1.base=|v_thread5Thread1of1ForFork1_#res#1.base_7|, thread5Thread1of1ForFork1_#t~post10#1=|v_thread5Thread1of1ForFork1_#t~post10#1_7|, ~s~0=v_~s~0_146} AuxVars[] AssignedVars[thread5Thread1of1ForFork1_#res#1.offset, thread5Thread1of1ForFork1_#res#1.base, thread5Thread1of1ForFork1_#t~post10#1, ~s~0][302], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), 37#thread2EXITtrue, Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 87#L182-1true, 263#true, 150#L112true, 211#true, 194#thread1EXITtrue, 49#thread5EXITtrue, 7#thread6EXITtrue, 242#(<= (+ ~s~0 1) ~t~0), 129#L93true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-01-28 09:59:49,977 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-01-28 09:59:49,977 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 09:59:49,977 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 09:59:49,977 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 09:59:50,218 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([678] L131-->thread5EXIT: Formula: (and (= (+ v_~s~0_147 1) v_~s~0_146) (= |v_thread5Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread5Thread1of1ForFork1_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_147} OutVars{thread5Thread1of1ForFork1_#res#1.offset=|v_thread5Thread1of1ForFork1_#res#1.offset_7|, thread5Thread1of1ForFork1_#res#1.base=|v_thread5Thread1of1ForFork1_#res#1.base_7|, thread5Thread1of1ForFork1_#t~post10#1=|v_thread5Thread1of1ForFork1_#t~post10#1_7|, ~s~0=v_~s~0_146} AuxVars[] AssignedVars[thread5Thread1of1ForFork1_#res#1.offset, thread5Thread1of1ForFork1_#res#1.base, thread5Thread1of1ForFork1_#t~post10#1, ~s~0][302], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), 37#thread2EXITtrue, Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 263#true, 150#L112true, 211#true, 15#L182-2true, 49#thread5EXITtrue, 7#thread6EXITtrue, 242#(<= (+ ~s~0 1) ~t~0), 129#L93true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-01-28 09:59:50,219 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-01-28 09:59:50,219 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 09:59:50,219 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 09:59:50,219 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 09:59:50,380 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([678] L131-->thread5EXIT: Formula: (and (= (+ v_~s~0_147 1) v_~s~0_146) (= |v_thread5Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread5Thread1of1ForFork1_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_147} OutVars{thread5Thread1of1ForFork1_#res#1.offset=|v_thread5Thread1of1ForFork1_#res#1.offset_7|, thread5Thread1of1ForFork1_#res#1.base=|v_thread5Thread1of1ForFork1_#res#1.base_7|, thread5Thread1of1ForFork1_#t~post10#1=|v_thread5Thread1of1ForFork1_#t~post10#1_7|, ~s~0=v_~s~0_146} AuxVars[] AssignedVars[thread5Thread1of1ForFork1_#res#1.offset, thread5Thread1of1ForFork1_#res#1.base, thread5Thread1of1ForFork1_#t~post10#1, ~s~0][302], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), 37#thread2EXITtrue, Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 157#L183-1true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 263#true, 150#L112true, 211#true, 49#thread5EXITtrue, 7#thread6EXITtrue, 242#(<= (+ ~s~0 1) ~t~0), 129#L93true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-01-28 09:59:50,380 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-01-28 09:59:50,380 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 09:59:50,380 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 09:59:50,380 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 09:59:50,483 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([678] L131-->thread5EXIT: Formula: (and (= (+ v_~s~0_147 1) v_~s~0_146) (= |v_thread5Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread5Thread1of1ForFork1_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_147} OutVars{thread5Thread1of1ForFork1_#res#1.offset=|v_thread5Thread1of1ForFork1_#res#1.offset_7|, thread5Thread1of1ForFork1_#res#1.base=|v_thread5Thread1of1ForFork1_#res#1.base_7|, thread5Thread1of1ForFork1_#t~post10#1=|v_thread5Thread1of1ForFork1_#t~post10#1_7|, ~s~0=v_~s~0_146} AuxVars[] AssignedVars[thread5Thread1of1ForFork1_#res#1.offset, thread5Thread1of1ForFork1_#res#1.base, thread5Thread1of1ForFork1_#t~post10#1, ~s~0][302], [113#L183-2true, Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 263#true, Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 211#true, 49#thread5EXITtrue, 7#thread6EXITtrue, 242#(<= (+ ~s~0 1) ~t~0), 129#L93true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-01-28 09:59:50,484 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-01-28 09:59:50,484 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-01-28 09:59:50,484 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-01-28 09:59:50,484 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-01-28 09:59:50,534 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([678] L131-->thread5EXIT: Formula: (and (= (+ v_~s~0_147 1) v_~s~0_146) (= |v_thread5Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread5Thread1of1ForFork1_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_147} OutVars{thread5Thread1of1ForFork1_#res#1.offset=|v_thread5Thread1of1ForFork1_#res#1.offset_7|, thread5Thread1of1ForFork1_#res#1.base=|v_thread5Thread1of1ForFork1_#res#1.base_7|, thread5Thread1of1ForFork1_#t~post10#1=|v_thread5Thread1of1ForFork1_#t~post10#1_7|, ~s~0=v_~s~0_146} AuxVars[] AssignedVars[thread5Thread1of1ForFork1_#res#1.offset, thread5Thread1of1ForFork1_#res#1.base, thread5Thread1of1ForFork1_#t~post10#1, ~s~0][302], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 79#L184-1true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 263#true, Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 211#true, 49#thread5EXITtrue, 7#thread6EXITtrue, 242#(<= (+ ~s~0 1) ~t~0), 129#L93true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-01-28 09:59:50,534 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-01-28 09:59:50,534 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-01-28 09:59:50,534 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-01-28 09:59:50,534 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-01-28 09:59:50,629 INFO L130 PetriNetUnfolder]: 253697/352376 cut-off events. [2023-01-28 09:59:50,629 INFO L131 PetriNetUnfolder]: For 666138/692667 co-relation queries the response was YES. [2023-01-28 09:59:52,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1220336 conditions, 352376 events. 253697/352376 cut-off events. For 666138/692667 co-relation queries the response was YES. Maximal size of possible extension queue 14524. Compared 2836338 event pairs, 60519 based on Foata normal form. 5096/335420 useless extension candidates. Maximal degree in co-relation 656199. Up to 267679 conditions per place. [2023-01-28 09:59:54,382 INFO L137 encePairwiseOnDemand]: 303/317 looper letters, 222 selfloop transitions, 132 changer transitions 0/382 dead transitions. [2023-01-28 09:59:54,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 382 transitions, 3004 flow [2023-01-28 09:59:54,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 09:59:54,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 09:59:54,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1523 transitions. [2023-01-28 09:59:54,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5338240448650543 [2023-01-28 09:59:54,406 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1523 transitions. [2023-01-28 09:59:54,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1523 transitions. [2023-01-28 09:59:54,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:59:54,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1523 transitions. [2023-01-28 09:59:54,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 169.22222222222223) internal successors, (1523), 9 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 09:59:54,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 317.0) internal successors, (3170), 10 states have internal predecessors, (3170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 09:59:54,412 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 317.0) internal successors, (3170), 10 states have internal predecessors, (3170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 09:59:54,412 INFO L175 Difference]: Start difference. First operand has 91 places, 240 transitions, 1596 flow. Second operand 9 states and 1523 transitions. [2023-01-28 09:59:54,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 382 transitions, 3004 flow [2023-01-28 10:00:34,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 382 transitions, 2865 flow, removed 66 selfloop flow, removed 1 redundant places. [2023-01-28 10:00:34,696 INFO L231 Difference]: Finished difference. Result has 102 places, 277 transitions, 2180 flow [2023-01-28 10:00:34,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2180, PETRI_PLACES=102, PETRI_TRANSITIONS=277} [2023-01-28 10:00:34,697 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 33 predicate places. [2023-01-28 10:00:34,697 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 277 transitions, 2180 flow [2023-01-28 10:00:34,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 155.14285714285714) internal successors, (1086), 7 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:00:34,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:00:34,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:00:34,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 10:00:34,698 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 4 more)] === [2023-01-28 10:00:34,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:00:34,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1949326470, now seen corresponding path program 5 times [2023-01-28 10:00:34,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:00:34,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404540571] [2023-01-28 10:00:34,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:00:34,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:00:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:00:34,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:00:34,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:00:34,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404540571] [2023-01-28 10:00:34,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404540571] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:00:34,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:00:34,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 10:00:34,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61157552] [2023-01-28 10:00:34,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:00:34,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 10:00:34,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:00:34,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 10:00:34,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-28 10:00:34,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 317 [2023-01-28 10:00:34,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 277 transitions, 2180 flow. Second operand has 7 states, 7 states have (on average 155.14285714285714) internal successors, (1086), 7 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:00:34,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:00:34,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 317 [2023-01-28 10:00:34,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:00:54,576 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][306], [60#L181-4true, Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 50#L45true, 263#true, 147#L74true, 124#thread4EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 281#true, 72#L150true, 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 216#(and (= ~b~0 0) (not (= ~x~0 1)))]) [2023-01-28 10:00:54,576 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-01-28 10:00:54,576 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-01-28 10:00:54,576 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-01-28 10:00:54,576 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-01-28 10:00:56,563 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][306], [60#L181-4true, Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), 44#L49true, Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 263#true, 147#L74true, 124#thread4EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 281#true, 72#L150true, 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 216#(and (= ~b~0 0) (not (= ~x~0 1)))]) [2023-01-28 10:00:56,563 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-01-28 10:00:56,563 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 10:00:56,563 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 10:00:56,563 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 10:00:56,564 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][409], [60#L181-4true, Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 263#true, 211#true, 147#L74true, 124#thread4EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 281#true, 72#L150true, 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 13#L52true]) [2023-01-28 10:00:56,564 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-01-28 10:00:56,564 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 10:00:56,566 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 10:00:56,566 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 10:00:56,630 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][306], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 50#L45true, 263#true, 87#L182-1true, 147#L74true, 124#thread4EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 281#true, 72#L150true, 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 216#(and (= ~b~0 0) (not (= ~x~0 1)))]) [2023-01-28 10:00:56,630 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-01-28 10:00:56,631 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 10:00:56,631 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 10:00:56,631 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 10:00:58,001 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][306], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), 44#L49true, Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 263#true, 87#L182-1true, 124#thread4EXITtrue, 147#L74true, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 281#true, 72#L150true, 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 216#(and (= ~b~0 0) (not (= ~x~0 1)))]) [2023-01-28 10:00:58,001 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-01-28 10:00:58,001 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 10:00:58,001 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 10:00:58,001 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 10:00:58,001 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][409], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 263#true, 87#L182-1true, 211#true, 124#thread4EXITtrue, 147#L74true, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 281#true, 72#L150true, 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 13#L52true]) [2023-01-28 10:00:58,002 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-01-28 10:00:58,002 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 10:00:58,002 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 10:00:58,002 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 10:00:58,368 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][405], [60#L181-4true, Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 263#true, 211#true, 147#L74true, 194#thread1EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 281#true, 72#L150true, 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true]) [2023-01-28 10:00:58,368 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-01-28 10:00:58,368 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 10:00:58,368 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 10:00:58,368 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 10:00:59,379 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][405], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 263#true, 87#L182-1true, 211#true, 147#L74true, 194#thread1EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 281#true, 72#L150true, 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true]) [2023-01-28 10:00:59,380 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-01-28 10:00:59,380 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 10:00:59,380 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 10:00:59,380 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 10:01:00,479 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([678] L131-->thread5EXIT: Formula: (and (= (+ v_~s~0_147 1) v_~s~0_146) (= |v_thread5Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread5Thread1of1ForFork1_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_147} OutVars{thread5Thread1of1ForFork1_#res#1.offset=|v_thread5Thread1of1ForFork1_#res#1.offset_7|, thread5Thread1of1ForFork1_#res#1.base=|v_thread5Thread1of1ForFork1_#res#1.base_7|, thread5Thread1of1ForFork1_#t~post10#1=|v_thread5Thread1of1ForFork1_#t~post10#1_7|, ~s~0=v_~s~0_146} AuxVars[] AssignedVars[thread5Thread1of1ForFork1_#res#1.offset, thread5Thread1of1ForFork1_#res#1.base, thread5Thread1of1ForFork1_#t~post10#1, ~s~0][305], [60#L181-4true, Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 263#true, 211#true, 147#L74true, 194#thread1EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), 49#thread5EXITtrue, Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 7#thread6EXITtrue, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 281#true, 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 238#true]) [2023-01-28 10:01:00,479 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-01-28 10:01:00,479 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 10:01:00,480 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 10:01:00,480 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 10:01:00,801 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([678] L131-->thread5EXIT: Formula: (and (= (+ v_~s~0_147 1) v_~s~0_146) (= |v_thread5Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread5Thread1of1ForFork1_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_147} OutVars{thread5Thread1of1ForFork1_#res#1.offset=|v_thread5Thread1of1ForFork1_#res#1.offset_7|, thread5Thread1of1ForFork1_#res#1.base=|v_thread5Thread1of1ForFork1_#res#1.base_7|, thread5Thread1of1ForFork1_#t~post10#1=|v_thread5Thread1of1ForFork1_#t~post10#1_7|, ~s~0=v_~s~0_146} AuxVars[] AssignedVars[thread5Thread1of1ForFork1_#res#1.offset, thread5Thread1of1ForFork1_#res#1.base, thread5Thread1of1ForFork1_#t~post10#1, ~s~0][305], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 263#true, 87#L182-1true, 211#true, 147#L74true, 194#thread1EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 49#thread5EXITtrue, Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 7#thread6EXITtrue, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 281#true, 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 238#true]) [2023-01-28 10:01:00,802 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-01-28 10:01:00,802 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 10:01:00,802 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 10:01:00,802 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 10:01:01,259 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([678] L131-->thread5EXIT: Formula: (and (= (+ v_~s~0_147 1) v_~s~0_146) (= |v_thread5Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread5Thread1of1ForFork1_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_147} OutVars{thread5Thread1of1ForFork1_#res#1.offset=|v_thread5Thread1of1ForFork1_#res#1.offset_7|, thread5Thread1of1ForFork1_#res#1.base=|v_thread5Thread1of1ForFork1_#res#1.base_7|, thread5Thread1of1ForFork1_#t~post10#1=|v_thread5Thread1of1ForFork1_#t~post10#1_7|, ~s~0=v_~s~0_146} AuxVars[] AssignedVars[thread5Thread1of1ForFork1_#res#1.offset, thread5Thread1of1ForFork1_#res#1.base, thread5Thread1of1ForFork1_#t~post10#1, ~s~0][305], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 263#true, 211#true, 147#L74true, 15#L182-2true, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 49#thread5EXITtrue, Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 7#thread6EXITtrue, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 281#true, 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 238#true]) [2023-01-28 10:01:01,260 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-01-28 10:01:01,260 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 10:01:01,260 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 10:01:01,260 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 10:01:01,381 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([678] L131-->thread5EXIT: Formula: (and (= (+ v_~s~0_147 1) v_~s~0_146) (= |v_thread5Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread5Thread1of1ForFork1_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_147} OutVars{thread5Thread1of1ForFork1_#res#1.offset=|v_thread5Thread1of1ForFork1_#res#1.offset_7|, thread5Thread1of1ForFork1_#res#1.base=|v_thread5Thread1of1ForFork1_#res#1.base_7|, thread5Thread1of1ForFork1_#t~post10#1=|v_thread5Thread1of1ForFork1_#t~post10#1_7|, ~s~0=v_~s~0_146} AuxVars[] AssignedVars[thread5Thread1of1ForFork1_#res#1.offset, thread5Thread1of1ForFork1_#res#1.base, thread5Thread1of1ForFork1_#t~post10#1, ~s~0][305], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 157#L183-1true, 263#true, 211#true, 147#L74true, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 49#thread5EXITtrue, Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 7#thread6EXITtrue, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 281#true, 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 238#true]) [2023-01-28 10:01:01,381 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-01-28 10:01:01,381 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 10:01:01,381 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 10:01:01,381 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 10:01:01,567 INFO L130 PetriNetUnfolder]: 254801/353096 cut-off events. [2023-01-28 10:01:01,568 INFO L131 PetriNetUnfolder]: For 747740/783734 co-relation queries the response was YES. [2023-01-28 10:01:03,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1235717 conditions, 353096 events. 254801/353096 cut-off events. For 747740/783734 co-relation queries the response was YES. Maximal size of possible extension queue 14237. Compared 2825076 event pairs, 69445 based on Foata normal form. 4560/335269 useless extension candidates. Maximal degree in co-relation 677528. Up to 266928 conditions per place. [2023-01-28 10:01:05,075 INFO L137 encePairwiseOnDemand]: 303/317 looper letters, 238 selfloop transitions, 189 changer transitions 0/455 dead transitions. [2023-01-28 10:01:05,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 455 transitions, 4113 flow [2023-01-28 10:01:05,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 10:01:05,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 10:01:05,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1535 transitions. [2023-01-28 10:01:05,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5380301437083771 [2023-01-28 10:01:05,078 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1535 transitions. [2023-01-28 10:01:05,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1535 transitions. [2023-01-28 10:01:05,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:01:05,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1535 transitions. [2023-01-28 10:01:05,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 170.55555555555554) internal successors, (1535), 9 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:01:05,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 317.0) internal successors, (3170), 10 states have internal predecessors, (3170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:01:05,084 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 317.0) internal successors, (3170), 10 states have internal predecessors, (3170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:01:05,084 INFO L175 Difference]: Start difference. First operand has 102 places, 277 transitions, 2180 flow. Second operand 9 states and 1535 transitions. [2023-01-28 10:01:05,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 455 transitions, 4113 flow [2023-01-28 10:01:36,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 455 transitions, 3908 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-01-28 10:01:36,819 INFO L231 Difference]: Finished difference. Result has 109 places, 335 transitions, 3122 flow [2023-01-28 10:01:36,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=2047, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3122, PETRI_PLACES=109, PETRI_TRANSITIONS=335} [2023-01-28 10:01:36,820 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 40 predicate places. [2023-01-28 10:01:36,820 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 335 transitions, 3122 flow [2023-01-28 10:01:36,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 155.14285714285714) internal successors, (1086), 7 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:01:36,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:01:36,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:01:36,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 10:01:36,821 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 4 more)] === [2023-01-28 10:01:36,821 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:01:36,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1715764558, now seen corresponding path program 6 times [2023-01-28 10:01:36,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:01:36,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657325634] [2023-01-28 10:01:36,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:01:36,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:01:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:01:37,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:01:37,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:01:37,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657325634] [2023-01-28 10:01:37,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657325634] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:01:37,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:01:37,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-01-28 10:01:37,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634031102] [2023-01-28 10:01:37,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:01:37,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 10:01:37,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:01:37,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 10:01:37,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-01-28 10:01:37,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 317 [2023-01-28 10:01:37,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 335 transitions, 3122 flow. Second operand has 9 states, 9 states have (on average 153.77777777777777) internal successors, (1384), 9 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:01:37,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:01:37,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 317 [2023-01-28 10:01:37,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:02:07,400 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([658] L74-->thread2EXIT: Formula: (and (= (+ v_~s~0_127 1) v_~s~0_126) (= |v_thread2Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_127} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_7|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_7|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_#t~post4#1, ~s~0][218], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 302#(<= (+ ~s~0 1) ~t~0), 157#L183-1true, 211#true, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), 49#thread5EXITtrue, Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 242#(<= (+ ~s~0 1) ~t~0), Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 281#true, 72#L150true, 37#thread2EXITtrue, Black: 291#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 286#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 293#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 184#L90true]) [2023-01-28 10:02:07,400 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-01-28 10:02:07,400 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 10:02:07,400 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 10:02:07,400 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 10:02:08,220 INFO L130 PetriNetUnfolder]: 258285/361623 cut-off events. [2023-01-28 10:02:08,220 INFO L131 PetriNetUnfolder]: For 874721/918757 co-relation queries the response was YES. [2023-01-28 10:02:10,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1287670 conditions, 361623 events. 258285/361623 cut-off events. For 874721/918757 co-relation queries the response was YES. Maximal size of possible extension queue 14907. Compared 2982131 event pairs, 52402 based on Foata normal form. 9276/346546 useless extension candidates. Maximal degree in co-relation 751837. Up to 78583 conditions per place. [2023-01-28 10:02:12,305 INFO L137 encePairwiseOnDemand]: 303/317 looper letters, 225 selfloop transitions, 318 changer transitions 0/571 dead transitions. [2023-01-28 10:02:12,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 571 transitions, 5619 flow [2023-01-28 10:02:12,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-28 10:02:12,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-01-28 10:02:12,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2245 transitions. [2023-01-28 10:02:12,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5447706867265227 [2023-01-28 10:02:12,309 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2245 transitions. [2023-01-28 10:02:12,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2245 transitions. [2023-01-28 10:02:12,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:02:12,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2245 transitions. [2023-01-28 10:02:12,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 172.69230769230768) internal successors, (2245), 13 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:02:12,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 317.0) internal successors, (4438), 14 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:02:12,316 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 317.0) internal successors, (4438), 14 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:02:12,316 INFO L175 Difference]: Start difference. First operand has 109 places, 335 transitions, 3122 flow. Second operand 13 states and 2245 transitions. [2023-01-28 10:02:12,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 571 transitions, 5619 flow [2023-01-28 10:02:23,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 571 transitions, 5361 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-28 10:02:23,483 INFO L231 Difference]: Finished difference. Result has 119 places, 405 transitions, 4439 flow [2023-01-28 10:02:23,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=2929, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=248, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4439, PETRI_PLACES=119, PETRI_TRANSITIONS=405} [2023-01-28 10:02:23,483 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 50 predicate places. [2023-01-28 10:02:23,484 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 405 transitions, 4439 flow [2023-01-28 10:02:23,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 153.77777777777777) internal successors, (1384), 9 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:02:23,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:02:23,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:02:23,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 10:02:23,484 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 4 more)] === [2023-01-28 10:02:23,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:02:23,485 INFO L85 PathProgramCache]: Analyzing trace with hash -407801938, now seen corresponding path program 7 times [2023-01-28 10:02:23,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:02:23,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729458263] [2023-01-28 10:02:23,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:02:23,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:02:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:02:23,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:02:23,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:02:23,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729458263] [2023-01-28 10:02:23,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729458263] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:02:23,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:02:23,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 10:02:23,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752902448] [2023-01-28 10:02:23,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:02:23,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 10:02:23,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:02:23,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 10:02:23,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-01-28 10:02:23,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 317 [2023-01-28 10:02:23,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 405 transitions, 4439 flow. Second operand has 8 states, 8 states have (on average 154.375) internal successors, (1235), 8 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:02:23,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:02:23,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 317 [2023-01-28 10:02:23,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:02:48,176 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][561], [60#L181-4true, Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 304#(<= (+ 3 ~s~0) ~t~0), 211#true, 194#thread1EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 72#L150true, 37#thread2EXITtrue, Black: 291#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 286#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 293#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~s~0 0)), 320#true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 195#L105true, 129#L93true, Black: 314#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), Black: 316#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0))]) [2023-01-28 10:02:48,177 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-01-28 10:02:48,177 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 10:02:48,177 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 10:02:48,177 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 10:02:50,138 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][561], [60#L181-4true, Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 304#(<= (+ 3 ~s~0) ~t~0), 211#true, 194#thread1EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 72#L150true, 37#thread2EXITtrue, Black: 291#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 286#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 293#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~s~0 0)), 320#true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 52#L109true, 129#L93true, Black: 314#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), Black: 316#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0))]) [2023-01-28 10:02:50,138 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-01-28 10:02:50,138 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 10:02:50,138 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 10:02:50,138 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 10:02:50,186 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][561], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 304#(<= (+ 3 ~s~0) ~t~0), 87#L182-1true, 211#true, 194#thread1EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 72#L150true, 37#thread2EXITtrue, Black: 291#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 286#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 293#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 225#(and (= ~t~0 0) (= ~s~0 0)), 320#true, Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 195#L105true, 129#L93true, Black: 314#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), Black: 316#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0))]) [2023-01-28 10:02:50,186 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-01-28 10:02:50,186 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 10:02:50,186 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 10:02:50,186 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 10:02:51,077 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][563], [60#L181-4true, Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 305#(<= (+ ~s~0 4) ~t~0), 211#true, 147#L74true, 124#thread4EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 49#thread5EXITtrue, Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 245#(<= (+ ~s~0 4) ~t~0), Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 72#L150true, Black: 291#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 286#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 293#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~s~0 0)), 320#true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 13#L52true, 129#L93true, Black: 314#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), Black: 316#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0))]) [2023-01-28 10:02:51,078 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-01-28 10:02:51,078 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 10:02:51,078 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 10:02:51,078 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 10:02:51,594 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][561], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 304#(<= (+ 3 ~s~0) ~t~0), 87#L182-1true, 211#true, 194#thread1EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 72#L150true, 37#thread2EXITtrue, Black: 291#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 286#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 293#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~s~0 0)), 320#true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 52#L109true, Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 129#L93true, Black: 314#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), Black: 316#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0))]) [2023-01-28 10:02:51,594 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-01-28 10:02:51,594 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 10:02:51,594 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 10:02:51,594 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 10:02:52,346 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][563], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 87#L182-1true, 305#(<= (+ ~s~0 4) ~t~0), 211#true, 147#L74true, 124#thread4EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), 49#thread5EXITtrue, Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 245#(<= (+ ~s~0 4) ~t~0), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 72#L150true, Black: 291#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 286#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 293#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~s~0 0)), 320#true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 13#L52true, 129#L93true, Black: 314#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), Black: 316#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0))]) [2023-01-28 10:02:52,347 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-01-28 10:02:52,347 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 10:02:52,347 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 10:02:52,347 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 10:02:53,115 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][561], [60#L181-4true, Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 211#true, 147#L74true, 194#thread1EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), 49#thread5EXITtrue, Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 72#L150true, 298#true, Black: 291#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 286#(and (<= 2 ~t~0) (= ~s~0 0)), 80#thread3EXITtrue, Black: 293#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 225#(and (= ~t~0 0) (= ~s~0 0)), 320#true, Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 238#true, Black: 314#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), Black: 316#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0))]) [2023-01-28 10:02:53,116 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-01-28 10:02:53,116 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 10:02:53,116 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 10:02:53,116 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 10:02:53,862 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][561], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 87#L182-1true, 211#true, 147#L74true, 194#thread1EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), 49#thread5EXITtrue, Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 72#L150true, 298#true, Black: 291#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 286#(and (<= 2 ~t~0) (= ~s~0 0)), 80#thread3EXITtrue, Black: 293#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 225#(and (= ~t~0 0) (= ~s~0 0)), 320#true, Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 238#true, Black: 314#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), Black: 316#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0))]) [2023-01-28 10:02:53,862 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-01-28 10:02:53,862 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 10:02:53,862 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 10:02:53,862 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 10:02:54,360 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([678] L131-->thread5EXIT: Formula: (and (= (+ v_~s~0_147 1) v_~s~0_146) (= |v_thread5Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread5Thread1of1ForFork1_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_147} OutVars{thread5Thread1of1ForFork1_#res#1.offset=|v_thread5Thread1of1ForFork1_#res#1.offset_7|, thread5Thread1of1ForFork1_#res#1.base=|v_thread5Thread1of1ForFork1_#res#1.base_7|, thread5Thread1of1ForFork1_#t~post10#1=|v_thread5Thread1of1ForFork1_#t~post10#1_7|, ~s~0=v_~s~0_146} AuxVars[] AssignedVars[thread5Thread1of1ForFork1_#res#1.offset, thread5Thread1of1ForFork1_#res#1.base, thread5Thread1of1ForFork1_#t~post10#1, ~s~0][526], [Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 243#(<= (+ 2 ~s~0) ~t~0), 157#L183-1true, 211#true, 147#L74true, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), 49#thread5EXITtrue, Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 7#thread6EXITtrue, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), Black: 291#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 286#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 293#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~s~0 0)), 320#true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 303#(<= (+ 2 ~s~0) ~t~0), 129#L93true, Black: 314#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), Black: 316#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0))]) [2023-01-28 10:02:54,361 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-01-28 10:02:54,361 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 10:02:54,361 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 10:02:54,361 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 10:02:54,919 INFO L130 PetriNetUnfolder]: 265274/368294 cut-off events. [2023-01-28 10:02:54,920 INFO L131 PetriNetUnfolder]: For 1334464/1410254 co-relation queries the response was YES. [2023-01-28 10:02:57,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1477770 conditions, 368294 events. 265274/368294 cut-off events. For 1334464/1410254 co-relation queries the response was YES. Maximal size of possible extension queue 14631. Compared 2960872 event pairs, 73051 based on Foata normal form. 8074/353011 useless extension candidates. Maximal degree in co-relation 865035. Up to 272051 conditions per place. [2023-01-28 10:02:58,895 INFO L137 encePairwiseOnDemand]: 303/317 looper letters, 242 selfloop transitions, 337 changer transitions 0/607 dead transitions. [2023-01-28 10:02:58,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 607 transitions, 7119 flow [2023-01-28 10:02:58,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-28 10:02:58,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-01-28 10:02:58,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1872 transitions. [2023-01-28 10:02:58,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5368511614568396 [2023-01-28 10:02:58,898 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1872 transitions. [2023-01-28 10:02:58,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1872 transitions. [2023-01-28 10:02:58,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:02:58,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1872 transitions. [2023-01-28 10:02:58,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 170.1818181818182) internal successors, (1872), 11 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:02:58,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 317.0) internal successors, (3804), 12 states have internal predecessors, (3804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:02:58,904 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 317.0) internal successors, (3804), 12 states have internal predecessors, (3804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:02:58,904 INFO L175 Difference]: Start difference. First operand has 119 places, 405 transitions, 4439 flow. Second operand 11 states and 1872 transitions. [2023-01-28 10:02:58,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 607 transitions, 7119 flow [2023-01-28 10:03:28,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 607 transitions, 6601 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-01-28 10:03:28,717 INFO L231 Difference]: Finished difference. Result has 125 places, 484 transitions, 5903 flow [2023-01-28 10:03:28,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=4004, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=258, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5903, PETRI_PLACES=125, PETRI_TRANSITIONS=484} [2023-01-28 10:03:28,718 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 56 predicate places. [2023-01-28 10:03:28,718 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 484 transitions, 5903 flow [2023-01-28 10:03:28,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 154.375) internal successors, (1235), 8 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:28,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:03:28,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:03:28,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 10:03:28,719 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 4 more)] === [2023-01-28 10:03:28,719 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:03:28,719 INFO L85 PathProgramCache]: Analyzing trace with hash -314242782, now seen corresponding path program 8 times [2023-01-28 10:03:28,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:03:28,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063441813] [2023-01-28 10:03:28,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:03:28,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:03:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:03:28,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:03:28,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:03:28,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063441813] [2023-01-28 10:03:28,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063441813] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:03:28,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:03:28,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-01-28 10:03:28,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004310924] [2023-01-28 10:03:28,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:03:28,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-01-28 10:03:28,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:03:28,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-01-28 10:03:28,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-01-28 10:03:28,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 317 [2023-01-28 10:03:28,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 484 transitions, 5903 flow. Second operand has 11 states, 11 states have (on average 152.9090909090909) internal successors, (1682), 11 states have internal predecessors, (1682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:28,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:03:28,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 317 [2023-01-28 10:03:28,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:04:02,000 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][732], [60#L181-4true, Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 348#(<= (+ ~s~0 4) ~t~0), 211#true, Black: 326#(and (<= 3 ~t~0) (= ~s~0 0)), Black: 335#(and (<= 3 ~m5~0) (<= 3 ~t~0) (= ~s~0 0)), 147#L74true, Black: 325#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 333#(and (<= 3 ~m5~0) (= ~m1~0 0) (<= 3 ~t~0) (= ~s~0 0)), 194#thread1EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 72#L150true, Black: 291#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 80#thread3EXITtrue, Black: 286#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 293#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~s~0 0)), 320#true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, Black: 314#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), Black: 316#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0))]) [2023-01-28 10:04:02,001 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-01-28 10:04:02,001 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 10:04:02,001 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 10:04:02,001 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 10:04:02,991 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][732], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 348#(<= (+ ~s~0 4) ~t~0), 87#L182-1true, 211#true, Black: 326#(and (<= 3 ~t~0) (= ~s~0 0)), Black: 335#(and (<= 3 ~m5~0) (<= 3 ~t~0) (= ~s~0 0)), Black: 325#(and (<= 2 ~t~0) (= ~s~0 0)), 147#L74true, Black: 333#(and (<= 3 ~m5~0) (= ~m1~0 0) (<= 3 ~t~0) (= ~s~0 0)), 194#thread1EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 72#L150true, Black: 291#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 80#thread3EXITtrue, Black: 286#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 293#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~s~0 0)), 320#true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, Black: 314#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), Black: 316#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0))]) [2023-01-28 10:04:02,992 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-01-28 10:04:02,992 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 10:04:02,992 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 10:04:02,992 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 10:04:05,011 INFO L130 PetriNetUnfolder]: 273024/381178 cut-off events. [2023-01-28 10:04:05,011 INFO L131 PetriNetUnfolder]: For 1439384/1552348 co-relation queries the response was YES. [2023-01-28 10:04:07,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1489593 conditions, 381178 events. 273024/381178 cut-off events. For 1439384/1552348 co-relation queries the response was YES. Maximal size of possible extension queue 15223. Compared 3119760 event pairs, 52066 based on Foata normal form. 21430/377480 useless extension candidates. Maximal degree in co-relation 961895. Up to 79900 conditions per place. [2023-01-28 10:04:09,306 INFO L137 encePairwiseOnDemand]: 303/317 looper letters, 250 selfloop transitions, 626 changer transitions 0/904 dead transitions. [2023-01-28 10:04:09,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 904 transitions, 11255 flow [2023-01-28 10:04:09,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-28 10:04:09,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-01-28 10:04:09,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3060 transitions. [2023-01-28 10:04:09,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5362776025236593 [2023-01-28 10:04:09,311 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3060 transitions. [2023-01-28 10:04:09,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3060 transitions. [2023-01-28 10:04:09,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:04:09,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3060 transitions. [2023-01-28 10:04:09,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 170.0) internal successors, (3060), 18 states have internal predecessors, (3060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:04:09,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 317.0) internal successors, (6023), 19 states have internal predecessors, (6023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:04:09,320 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 317.0) internal successors, (6023), 19 states have internal predecessors, (6023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:04:09,321 INFO L175 Difference]: Start difference. First operand has 125 places, 484 transitions, 5903 flow. Second operand 18 states and 3060 transitions. [2023-01-28 10:04:09,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 904 transitions, 11255 flow [2023-01-28 10:04:35,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 904 transitions, 10698 flow, removed 15 selfloop flow, removed 6 redundant places. [2023-01-28 10:04:35,700 INFO L231 Difference]: Finished difference. Result has 141 places, 712 transitions, 10158 flow [2023-01-28 10:04:35,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=5527, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=404, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=10158, PETRI_PLACES=141, PETRI_TRANSITIONS=712} [2023-01-28 10:04:35,701 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 72 predicate places. [2023-01-28 10:04:35,701 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 712 transitions, 10158 flow [2023-01-28 10:04:35,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 152.9090909090909) internal successors, (1682), 11 states have internal predecessors, (1682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:04:35,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:04:35,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:04:35,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 10:04:35,702 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 4 more)] === [2023-01-28 10:04:35,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:04:35,702 INFO L85 PathProgramCache]: Analyzing trace with hash 2028382412, now seen corresponding path program 9 times [2023-01-28 10:04:35,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:04:35,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661543245] [2023-01-28 10:04:35,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:04:35,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:04:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:04:35,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:04:35,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:04:35,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661543245] [2023-01-28 10:04:35,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661543245] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:04:35,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:04:35,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 10:04:35,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39618284] [2023-01-28 10:04:35,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:04:35,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 10:04:35,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:04:35,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 10:04:35,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-01-28 10:04:35,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 317 [2023-01-28 10:04:35,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 712 transitions, 10158 flow. Second operand has 8 states, 8 states have (on average 154.375) internal successors, (1235), 8 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:04:35,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:04:35,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 317 [2023-01-28 10:04:35,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:05:15,529 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][855], [60#L181-4true, Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 348#(<= (+ ~s~0 4) ~t~0), 211#true, Black: 326#(and (<= 3 ~t~0) (= ~s~0 0)), Black: 335#(and (<= 3 ~m5~0) (<= 3 ~t~0) (= ~s~0 0)), 147#L74true, Black: 325#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 333#(and (<= 3 ~m5~0) (= ~m1~0 0) (<= 3 ~t~0) (= ~s~0 0)), Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 49#thread5EXITtrue, Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 72#L150true, Black: 291#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 286#(and (<= 2 ~t~0) (= ~s~0 0)), 80#thread3EXITtrue, Black: 293#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, Black: 369#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 381#(<= (+ 2 ~s~0) ~t~0), Black: 345#(<= (+ ~s~0 1) ~t~0), Black: 357#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0)), Black: 363#(and (<= (+ 5 ~s~0) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 13#L52true, Black: 316#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0))]) [2023-01-28 10:05:15,530 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-01-28 10:05:15,530 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 10:05:15,530 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 10:05:15,530 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 10:05:17,806 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][855], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 348#(<= (+ ~s~0 4) ~t~0), 87#L182-1true, 211#true, Black: 326#(and (<= 3 ~t~0) (= ~s~0 0)), Black: 335#(and (<= 3 ~m5~0) (<= 3 ~t~0) (= ~s~0 0)), 147#L74true, Black: 325#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 333#(and (<= 3 ~m5~0) (= ~m1~0 0) (<= 3 ~t~0) (= ~s~0 0)), Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 49#thread5EXITtrue, Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 72#L150true, Black: 291#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 80#thread3EXITtrue, Black: 286#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 293#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, Black: 369#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), Black: 345#(<= (+ ~s~0 1) ~t~0), 381#(<= (+ 2 ~s~0) ~t~0), Black: 357#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0)), Black: 363#(and (<= (+ 5 ~s~0) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 13#L52true, Black: 316#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0))]) [2023-01-28 10:05:17,806 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-01-28 10:05:17,806 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 10:05:17,806 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 10:05:17,806 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 10:05:24,535 INFO L130 PetriNetUnfolder]: 313146/444227 cut-off events. [2023-01-28 10:05:24,535 INFO L131 PetriNetUnfolder]: For 2117870/2252665 co-relation queries the response was YES. [2023-01-28 10:05:27,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1966608 conditions, 444227 events. 313146/444227 cut-off events. For 2117870/2252665 co-relation queries the response was YES. Maximal size of possible extension queue 17835. Compared 3806350 event pairs, 57804 based on Foata normal form. 26398/445220 useless extension candidates. Maximal degree in co-relation 1317477. Up to 121392 conditions per place. [2023-01-28 10:05:30,365 INFO L137 encePairwiseOnDemand]: 303/317 looper letters, 342 selfloop transitions, 748 changer transitions 3/1121 dead transitions. [2023-01-28 10:05:30,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 1121 transitions, 16391 flow [2023-01-28 10:05:30,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-28 10:05:30,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-01-28 10:05:30,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2240 transitions. [2023-01-28 10:05:30,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5435573889832565 [2023-01-28 10:05:30,368 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2240 transitions. [2023-01-28 10:05:30,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2240 transitions. [2023-01-28 10:05:30,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:05:30,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2240 transitions. [2023-01-28 10:05:30,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 172.30769230769232) internal successors, (2240), 13 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:05:30,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 317.0) internal successors, (4438), 14 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:05:30,375 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 317.0) internal successors, (4438), 14 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:05:30,375 INFO L175 Difference]: Start difference. First operand has 141 places, 712 transitions, 10158 flow. Second operand 13 states and 2240 transitions. [2023-01-28 10:05:30,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 1121 transitions, 16391 flow [2023-01-28 10:07:43,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 1121 transitions, 16232 flow, removed 46 selfloop flow, removed 4 redundant places. [2023-01-28 10:07:43,421 INFO L231 Difference]: Finished difference. Result has 155 places, 924 transitions, 15790 flow [2023-01-28 10:07:43,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=8820, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=639, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=481, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=15790, PETRI_PLACES=155, PETRI_TRANSITIONS=924} [2023-01-28 10:07:43,422 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 86 predicate places. [2023-01-28 10:07:43,422 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 924 transitions, 15790 flow [2023-01-28 10:07:43,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 154.375) internal successors, (1235), 8 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:07:43,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:07:43,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:07:43,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 10:07:43,423 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 4 more)] === [2023-01-28 10:07:43,423 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:07:43,423 INFO L85 PathProgramCache]: Analyzing trace with hash -787308670, now seen corresponding path program 10 times [2023-01-28 10:07:43,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:07:43,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336894028] [2023-01-28 10:07:43,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:07:43,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:07:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:07:43,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:07:43,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:07:43,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336894028] [2023-01-28 10:07:43,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336894028] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:07:43,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:07:43,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 10:07:43,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020821842] [2023-01-28 10:07:43,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:07:43,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 10:07:43,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:07:43,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 10:07:43,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-28 10:07:43,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 317 [2023-01-28 10:07:43,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 924 transitions, 15790 flow. Second operand has 7 states, 7 states have (on average 155.14285714285714) internal successors, (1086), 7 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:07:43,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:07:43,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 317 [2023-01-28 10:07:43,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:08:53,688 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([551] L90-->L93: Formula: (= (ite (= (ite (or (= v_~x~0_4 1) (not (= (mod v_~b~0_4 256) 0))) 1 0) 0) 0 1) v_~b~0_3) InVars {~b~0=v_~b~0_4, ~x~0=v_~x~0_4} OutVars{~b~0=v_~b~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~b~0][227], [408#(<= (+ 2 ~s~0) ~t~0), Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 348#(<= (+ ~s~0 4) ~t~0), Black: 395#(and (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m4~0)), Black: 381#(<= (+ 2 ~s~0) ~t~0), 305#(<= (+ ~s~0 4) ~t~0), Black: 391#(and (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m4~0)), 211#true, Black: 389#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m4~0)), Black: 380#(<= (+ ~s~0 1) ~t~0), Black: 326#(and (<= 3 ~t~0) (= ~s~0 0)), Black: 335#(and (<= 3 ~m5~0) (<= 3 ~t~0) (= ~s~0 0)), Black: 393#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m4~0)), 147#L74true, Black: 325#(and (<= 2 ~t~0) (= ~s~0 0)), 124#thread4EXITtrue, Black: 333#(and (<= 3 ~m5~0) (= ~m1~0 0) (<= 3 ~t~0) (= ~s~0 0)), 15#L182-2true, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 245#(<= (+ ~s~0 4) ~t~0), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 72#L150true, Black: 291#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 286#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 293#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 369#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), Black: 345#(<= (+ ~s~0 1) ~t~0), 382#(<= (+ 3 ~s~0) ~t~0), Black: 357#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0)), Black: 363#(and (<= (+ 5 ~s~0) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 129#L93true, Black: 316#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0))]) [2023-01-28 10:08:53,689 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-01-28 10:08:53,689 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 10:08:53,689 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 10:08:53,689 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 10:08:55,302 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([551] L90-->L93: Formula: (= (ite (= (ite (or (= v_~x~0_4 1) (not (= (mod v_~b~0_4 256) 0))) 1 0) 0) 0 1) v_~b~0_3) InVars {~b~0=v_~b~0_4, ~x~0=v_~x~0_4} OutVars{~b~0=v_~b~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~b~0][227], [408#(<= (+ 2 ~s~0) ~t~0), Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 157#L183-1true, 348#(<= (+ ~s~0 4) ~t~0), Black: 395#(and (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m4~0)), 305#(<= (+ ~s~0 4) ~t~0), Black: 381#(<= (+ 2 ~s~0) ~t~0), Black: 391#(and (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m4~0)), 211#true, Black: 389#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m4~0)), Black: 380#(<= (+ ~s~0 1) ~t~0), Black: 326#(and (<= 3 ~t~0) (= ~s~0 0)), Black: 335#(and (<= 3 ~m5~0) (<= 3 ~t~0) (= ~s~0 0)), Black: 393#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m4~0)), 147#L74true, Black: 325#(and (<= 2 ~t~0) (= ~s~0 0)), 124#thread4EXITtrue, Black: 333#(and (<= 3 ~m5~0) (= ~m1~0 0) (<= 3 ~t~0) (= ~s~0 0)), Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 245#(<= (+ ~s~0 4) ~t~0), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 72#L150true, Black: 291#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 286#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 293#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 369#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), Black: 345#(<= (+ ~s~0 1) ~t~0), 382#(<= (+ 3 ~s~0) ~t~0), Black: 357#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0)), Black: 363#(and (<= (+ 5 ~s~0) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 129#L93true, Black: 316#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0))]) [2023-01-28 10:08:55,302 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-01-28 10:08:55,302 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 10:08:55,302 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 10:08:55,302 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 10:08:57,564 INFO L130 PetriNetUnfolder]: 384554/545101 cut-off events. [2023-01-28 10:08:57,565 INFO L131 PetriNetUnfolder]: For 3911294/4124407 co-relation queries the response was YES. [2023-01-28 10:09:02,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2839240 conditions, 545101 events. 384554/545101 cut-off events. For 3911294/4124407 co-relation queries the response was YES. Maximal size of possible extension queue 22150. Compared 4748783 event pairs, 72170 based on Foata normal form. 39416/555162 useless extension candidates. Maximal degree in co-relation 2136063. Up to 268291 conditions per place. [2023-01-28 10:09:04,974 INFO L137 encePairwiseOnDemand]: 303/317 looper letters, 430 selfloop transitions, 774 changer transitions 11/1243 dead transitions. [2023-01-28 10:09:04,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 1243 transitions, 21927 flow [2023-01-28 10:09:04,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 10:09:04,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 10:09:04,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1549 transitions. [2023-01-28 10:09:04,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5429372590255871 [2023-01-28 10:09:04,976 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1549 transitions. [2023-01-28 10:09:04,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1549 transitions. [2023-01-28 10:09:04,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:09:04,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1549 transitions. [2023-01-28 10:09:04,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 172.11111111111111) internal successors, (1549), 9 states have internal predecessors, (1549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:09:04,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 317.0) internal successors, (3170), 10 states have internal predecessors, (3170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:09:04,981 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 317.0) internal successors, (3170), 10 states have internal predecessors, (3170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:09:04,981 INFO L175 Difference]: Start difference. First operand has 155 places, 924 transitions, 15790 flow. Second operand 9 states and 1549 transitions. [2023-01-28 10:09:04,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 1243 transitions, 21927 flow Received shutdown request... [2023-01-28 10:10:02,888 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 10:10:03,236 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-28 10:10:03,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 10:10:03,237 WARN L619 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2023-01-28 10:10:03,238 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 7 remaining) [2023-01-28 10:10:03,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-28 10:10:03,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-28 10:10:03,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-28 10:10:03,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-28 10:10:03,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2023-01-28 10:10:03,239 INFO L445 BasicCegarLoop]: Path program histogram: [10] [2023-01-28 10:10:03,242 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 10:10:03,242 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 10:10:03,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 10:10:03 BasicIcfg [2023-01-28 10:10:03,244 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 10:10:03,244 INFO L158 Benchmark]: Toolchain (without parser) took 714184.53ms. Allocated memory was 343.9MB in the beginning and 16.0GB in the end (delta: 15.7GB). Free memory was 312.8MB in the beginning and 8.3GB in the end (delta: -8.0GB). Peak memory consumption was 10.8GB. Max. memory is 16.0GB. [2023-01-28 10:10:03,244 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 255.9MB. Free memory is still 212.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 10:10:03,245 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.78ms. Allocated memory is still 343.9MB. Free memory was 312.2MB in the beginning and 300.2MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-01-28 10:10:03,245 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.98ms. Allocated memory is still 343.9MB. Free memory was 300.2MB in the beginning and 298.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 10:10:03,245 INFO L158 Benchmark]: Boogie Preprocessor took 33.62ms. Allocated memory is still 343.9MB. Free memory was 298.1MB in the beginning and 296.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 10:10:03,245 INFO L158 Benchmark]: RCFGBuilder took 514.12ms. Allocated memory is still 343.9MB. Free memory was 296.0MB in the beginning and 266.1MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-01-28 10:10:03,245 INFO L158 Benchmark]: TraceAbstraction took 713428.27ms. Allocated memory was 343.9MB in the beginning and 16.0GB in the end (delta: 15.7GB). Free memory was 265.6MB in the beginning and 8.3GB in the end (delta: -8.0GB). Peak memory consumption was 10.8GB. Max. memory is 16.0GB. [2023-01-28 10:10:03,246 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40ms. Allocated memory is still 255.9MB. Free memory is still 212.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 171.78ms. Allocated memory is still 343.9MB. Free memory was 312.2MB in the beginning and 300.2MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 32.98ms. Allocated memory is still 343.9MB. Free memory was 300.2MB in the beginning and 298.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 33.62ms. Allocated memory is still 343.9MB. Free memory was 298.1MB in the beginning and 296.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 514.12ms. Allocated memory is still 343.9MB. Free memory was 296.0MB in the beginning and 266.1MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 713428.27ms. Allocated memory was 343.9MB in the beginning and 16.0GB in the end (delta: 15.7GB). Free memory was 265.6MB in the beginning and 8.3GB in the end (delta: -8.0GB). Peak memory consumption was 10.8GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 186 PlacesBefore, 69 PlacesAfterwards, 169 TransitionsBefore, 50 TransitionsAfterwards, 3042 CoEnabledTransitionPairs, 7 FixpointIterations, 79 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 0 ConcurrentYvCompositions, 2 ChoiceCompositions, 126 TotalNumberOfCompositions, 15662 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4587, independent: 4241, independent conditional: 0, independent unconditional: 4241, dependent: 346, dependent conditional: 0, dependent unconditional: 346, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1424, independent: 1383, independent conditional: 0, independent unconditional: 1383, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4587, independent: 2858, independent conditional: 0, independent unconditional: 2858, dependent: 305, dependent conditional: 0, dependent unconditional: 305, unknown: 1424, unknown conditional: 0, unknown unconditional: 1424] , Statistics on independence cache: Total cache size (in pairs): 310, Positive cache size: 288, Positive conditional cache size: 0, Positive unconditional cache size: 288, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 190]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 180]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 181]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 178]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 179]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 177]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 176]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 239 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 713.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 704.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1280 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1280 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 401 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6742 IncrementalHoareTripleChecker+Invalid, 7143 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 401 mSolverCounterUnsat, 4 mSDtfsCounter, 6742 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15790occurred in iteration=9, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 500 NumberOfCodeBlocks, 500 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 490 ConstructedInterpolants, 0 QuantifiedInterpolants, 1911 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown