/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 10:30:04,155 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 10:30:04,157 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 10:30:04,175 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 10:30:04,176 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 10:30:04,177 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 10:30:04,177 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 10:30:04,179 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 10:30:04,180 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 10:30:04,181 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 10:30:04,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 10:30:04,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 10:30:04,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 10:30:04,183 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 10:30:04,184 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 10:30:04,185 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 10:30:04,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 10:30:04,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 10:30:04,187 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 10:30:04,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 10:30:04,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 10:30:04,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 10:30:04,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 10:30:04,192 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 10:30:04,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 10:30:04,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 10:30:04,195 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 10:30:04,195 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 10:30:04,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 10:30:04,196 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 10:30:04,196 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 10:30:04,197 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 10:30:04,197 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 10:30:04,198 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 10:30:04,199 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 10:30:04,199 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 10:30:04,199 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 10:30:04,199 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 10:30:04,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 10:30:04,200 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 10:30:04,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 10:30:04,201 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 10:30:04,216 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 10:30:04,217 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 10:30:04,218 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 10:30:04,218 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 10:30:04,218 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 10:30:04,218 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 10:30:04,218 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 10:30:04,218 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 10:30:04,219 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 10:30:04,219 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 10:30:04,219 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 10:30:04,219 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 10:30:04,219 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 10:30:04,219 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 10:30:04,219 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 10:30:04,219 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 10:30:04,219 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 10:30:04,220 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 10:30:04,220 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 10:30:04,220 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 10:30:04,220 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 10:30:04,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:30:04,220 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 10:30:04,220 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 10:30:04,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 10:30:04,221 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 10:30:04,221 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 10:30:04,221 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 10:30:04,221 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 10:30:04,221 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 10:30:04,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 10:30:04,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 10:30:04,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 10:30:04,522 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 10:30:04,522 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 10:30:04,523 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2022-12-13 10:30:05,552 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 10:30:05,753 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 10:30:05,753 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2022-12-13 10:30:05,758 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0da7c242/944e2009eb0a4f2785f25f9b08118a0f/FLAGeef0c76fa [2022-12-13 10:30:05,768 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0da7c242/944e2009eb0a4f2785f25f9b08118a0f [2022-12-13 10:30:05,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 10:30:05,771 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 10:30:05,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 10:30:05,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 10:30:05,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 10:30:05,774 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:30:05" (1/1) ... [2022-12-13 10:30:05,775 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a18145a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:30:05, skipping insertion in model container [2022-12-13 10:30:05,775 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:30:05" (1/1) ... [2022-12-13 10:30:05,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 10:30:05,797 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 10:30:05,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:30:05,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:30:05,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:30:05,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:30:05,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:30:05,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:30:05,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:30:05,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:30:05,922 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c[2554,2567] [2022-12-13 10:30:05,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:30:05,933 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 10:30:05,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:30:05,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:30:05,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:30:05,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:30:05,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:30:05,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:30:05,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:30:05,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:30:05,956 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c[2554,2567] [2022-12-13 10:30:05,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:30:05,966 INFO L208 MainTranslator]: Completed translation [2022-12-13 10:30:05,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:30:05 WrapperNode [2022-12-13 10:30:05,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 10:30:05,969 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 10:30:05,969 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 10:30:05,969 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 10:30:05,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:30:05" (1/1) ... [2022-12-13 10:30:05,979 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:30:05" (1/1) ... [2022-12-13 10:30:05,995 INFO L138 Inliner]: procedures = 21, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2022-12-13 10:30:05,996 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 10:30:05,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 10:30:05,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 10:30:05,996 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 10:30:06,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:30:05" (1/1) ... [2022-12-13 10:30:06,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:30:05" (1/1) ... [2022-12-13 10:30:06,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:30:05" (1/1) ... [2022-12-13 10:30:06,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:30:05" (1/1) ... [2022-12-13 10:30:06,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:30:05" (1/1) ... [2022-12-13 10:30:06,009 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:30:05" (1/1) ... [2022-12-13 10:30:06,010 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:30:05" (1/1) ... [2022-12-13 10:30:06,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:30:05" (1/1) ... [2022-12-13 10:30:06,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 10:30:06,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 10:30:06,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 10:30:06,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 10:30:06,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:30:05" (1/1) ... [2022-12-13 10:30:06,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:30:06,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:30:06,042 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 10:30:06,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 10:30:06,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 10:30:06,069 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 10:30:06,069 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 10:30:06,069 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 10:30:06,069 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 10:30:06,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 10:30:06,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 10:30:06,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 10:30:06,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 10:30:06,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 10:30:06,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 10:30:06,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 10:30:06,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 10:30:06,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 10:30:06,070 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 10:30:06,170 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 10:30:06,171 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 10:30:06,298 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 10:30:06,315 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 10:30:06,315 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 10:30:06,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:30:06 BoogieIcfgContainer [2022-12-13 10:30:06,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 10:30:06,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 10:30:06,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 10:30:06,321 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 10:30:06,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:30:05" (1/3) ... [2022-12-13 10:30:06,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272d8f61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:30:06, skipping insertion in model container [2022-12-13 10:30:06,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:30:05" (2/3) ... [2022-12-13 10:30:06,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272d8f61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:30:06, skipping insertion in model container [2022-12-13 10:30:06,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:30:06" (3/3) ... [2022-12-13 10:30:06,323 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2022-12-13 10:30:06,335 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 10:30:06,335 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 10:30:06,335 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 10:30:06,388 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 10:30:06,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 97 transitions, 210 flow [2022-12-13 10:30:06,464 INFO L130 PetriNetUnfolder]: 8/95 cut-off events. [2022-12-13 10:30:06,464 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 10:30:06,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 95 events. 8/95 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2022-12-13 10:30:06,469 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 97 transitions, 210 flow [2022-12-13 10:30:06,472 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 87 transitions, 186 flow [2022-12-13 10:30:06,473 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:06,487 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 87 transitions, 186 flow [2022-12-13 10:30:06,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 87 transitions, 186 flow [2022-12-13 10:30:06,520 INFO L130 PetriNetUnfolder]: 8/87 cut-off events. [2022-12-13 10:30:06,521 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 10:30:06,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 87 events. 8/87 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2022-12-13 10:30:06,525 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 87 transitions, 186 flow [2022-12-13 10:30:06,525 INFO L226 LiptonReduction]: Number of co-enabled transitions 728 [2022-12-13 10:30:09,124 INFO L241 LiptonReduction]: Total number of compositions: 74 [2022-12-13 10:30:09,146 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 10:30:09,150 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7dfa4215, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 10:30:09,150 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 10:30:09,153 INFO L130 PetriNetUnfolder]: 2/12 cut-off events. [2022-12-13 10:30:09,153 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 10:30:09,154 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:09,154 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:30:09,154 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:30:09,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:09,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1885800598, now seen corresponding path program 1 times [2022-12-13 10:30:09,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:09,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849326998] [2022-12-13 10:30:09,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:09,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:09,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:30:09,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:09,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849326998] [2022-12-13 10:30:09,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849326998] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:09,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:09,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 10:30:09,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886269973] [2022-12-13 10:30:09,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:09,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:30:09,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:09,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:30:09,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:30:09,472 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-13 10:30:09,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 13 transitions, 38 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:09,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:09,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-13 10:30:09,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:09,521 INFO L130 PetriNetUnfolder]: 41/77 cut-off events. [2022-12-13 10:30:09,521 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-13 10:30:09,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 77 events. 41/77 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 169 event pairs, 9 based on Foata normal form. 1/54 useless extension candidates. Maximal degree in co-relation 120. Up to 51 conditions per place. [2022-12-13 10:30:09,523 INFO L137 encePairwiseOnDemand]: 9/13 looper letters, 19 selfloop transitions, 3 changer transitions 1/23 dead transitions. [2022-12-13 10:30:09,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 23 transitions, 113 flow [2022-12-13 10:30:09,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:30:09,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:30:09,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-12-13 10:30:09,546 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2022-12-13 10:30:09,547 INFO L175 Difference]: Start difference. First operand has 18 places, 13 transitions, 38 flow. Second operand 3 states and 24 transitions. [2022-12-13 10:30:09,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 23 transitions, 113 flow [2022-12-13 10:30:09,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 23 transitions, 99 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 10:30:09,551 INFO L231 Difference]: Finished difference. Result has 17 places, 15 transitions, 49 flow [2022-12-13 10:30:09,552 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=30, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=49, PETRI_PLACES=17, PETRI_TRANSITIONS=15} [2022-12-13 10:30:09,555 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, -1 predicate places. [2022-12-13 10:30:09,555 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:09,555 INFO L89 Accepts]: Start accepts. Operand has 17 places, 15 transitions, 49 flow [2022-12-13 10:30:09,557 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:09,557 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:09,558 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 17 places, 15 transitions, 49 flow [2022-12-13 10:30:09,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 17 places, 15 transitions, 49 flow [2022-12-13 10:30:09,566 INFO L130 PetriNetUnfolder]: 5/23 cut-off events. [2022-12-13 10:30:09,566 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 10:30:09,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 23 events. 5/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 18. Up to 8 conditions per place. [2022-12-13 10:30:09,568 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 17 places, 15 transitions, 49 flow [2022-12-13 10:30:09,568 INFO L226 LiptonReduction]: Number of co-enabled transitions 46 [2022-12-13 10:30:09,569 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:09,570 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 10:30:09,571 INFO L495 AbstractCegarLoop]: Abstraction has has 17 places, 15 transitions, 49 flow [2022-12-13 10:30:09,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:09,573 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:09,577 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:30:09,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 10:30:09,577 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:30:09,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:09,579 INFO L85 PathProgramCache]: Analyzing trace with hash -291346094, now seen corresponding path program 1 times [2022-12-13 10:30:09,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:09,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639411597] [2022-12-13 10:30:09,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:09,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:09,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:30:09,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:09,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639411597] [2022-12-13 10:30:09,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639411597] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:09,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:09,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:30:09,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053542370] [2022-12-13 10:30:09,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:09,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:30:09,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:09,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:30:09,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:30:09,779 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-13 10:30:09,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 15 transitions, 49 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:09,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:09,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-13 10:30:09,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:09,874 INFO L130 PetriNetUnfolder]: 53/103 cut-off events. [2022-12-13 10:30:09,874 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-13 10:30:09,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 103 events. 53/103 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 252 event pairs, 7 based on Foata normal form. 4/107 useless extension candidates. Maximal degree in co-relation 76. Up to 57 conditions per place. [2022-12-13 10:30:09,875 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 27 selfloop transitions, 7 changer transitions 0/34 dead transitions. [2022-12-13 10:30:09,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 34 transitions, 171 flow [2022-12-13 10:30:09,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:30:09,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:30:09,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-12-13 10:30:09,877 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49230769230769234 [2022-12-13 10:30:09,877 INFO L175 Difference]: Start difference. First operand has 17 places, 15 transitions, 49 flow. Second operand 5 states and 32 transitions. [2022-12-13 10:30:09,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 34 transitions, 171 flow [2022-12-13 10:30:09,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 34 transitions, 167 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 10:30:09,878 INFO L231 Difference]: Finished difference. Result has 23 places, 21 transitions, 102 flow [2022-12-13 10:30:09,878 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=23, PETRI_TRANSITIONS=21} [2022-12-13 10:30:09,879 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-13 10:30:09,879 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:09,879 INFO L89 Accepts]: Start accepts. Operand has 23 places, 21 transitions, 102 flow [2022-12-13 10:30:09,879 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:09,879 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:09,880 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 21 transitions, 102 flow [2022-12-13 10:30:09,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 21 transitions, 102 flow [2022-12-13 10:30:09,884 INFO L130 PetriNetUnfolder]: 10/37 cut-off events. [2022-12-13 10:30:09,884 INFO L131 PetriNetUnfolder]: For 16/17 co-relation queries the response was YES. [2022-12-13 10:30:09,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 37 events. 10/37 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 83 event pairs, 0 based on Foata normal form. 1/36 useless extension candidates. Maximal degree in co-relation 62. Up to 15 conditions per place. [2022-12-13 10:30:09,885 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 21 transitions, 102 flow [2022-12-13 10:30:09,885 INFO L226 LiptonReduction]: Number of co-enabled transitions 56 [2022-12-13 10:30:09,885 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:09,886 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 10:30:09,886 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 21 transitions, 102 flow [2022-12-13 10:30:09,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:09,886 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:09,886 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:30:09,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 10:30:09,887 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:30:09,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:09,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1866870150, now seen corresponding path program 2 times [2022-12-13 10:30:09,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:09,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513218882] [2022-12-13 10:30:09,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:09,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:09,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:30:09,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:09,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513218882] [2022-12-13 10:30:09,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513218882] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:30:09,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458887818] [2022-12-13 10:30:09,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 10:30:09,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:30:09,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:30:09,991 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:30:10,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 10:30:10,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 10:30:10,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:30:10,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 10:30:10,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:30:10,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:30:10,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:30:10,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:30:10,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458887818] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:30:10,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:30:10,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 10:30:10,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73343024] [2022-12-13 10:30:10,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:30:10,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:30:10,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:10,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:30:10,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:30:10,499 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-13 10:30:10,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 21 transitions, 102 flow. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:10,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:10,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-13 10:30:10,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:10,621 INFO L130 PetriNetUnfolder]: 69/133 cut-off events. [2022-12-13 10:30:10,621 INFO L131 PetriNetUnfolder]: For 145/145 co-relation queries the response was YES. [2022-12-13 10:30:10,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 133 events. 69/133 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 366 event pairs, 11 based on Foata normal form. 18/151 useless extension candidates. Maximal degree in co-relation 205. Up to 59 conditions per place. [2022-12-13 10:30:10,623 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 32 selfloop transitions, 11 changer transitions 4/47 dead transitions. [2022-12-13 10:30:10,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 47 transitions, 302 flow [2022-12-13 10:30:10,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:30:10,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:30:10,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-13 10:30:10,625 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2022-12-13 10:30:10,625 INFO L175 Difference]: Start difference. First operand has 23 places, 21 transitions, 102 flow. Second operand 6 states and 44 transitions. [2022-12-13 10:30:10,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 47 transitions, 302 flow [2022-12-13 10:30:10,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 47 transitions, 302 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 10:30:10,629 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 185 flow [2022-12-13 10:30:10,629 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=185, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2022-12-13 10:30:10,630 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 13 predicate places. [2022-12-13 10:30:10,630 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:10,630 INFO L89 Accepts]: Start accepts. Operand has 31 places, 25 transitions, 185 flow [2022-12-13 10:30:10,631 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:10,631 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:10,631 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 25 transitions, 185 flow [2022-12-13 10:30:10,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 25 transitions, 185 flow [2022-12-13 10:30:10,649 INFO L130 PetriNetUnfolder]: 13/47 cut-off events. [2022-12-13 10:30:10,649 INFO L131 PetriNetUnfolder]: For 81/84 co-relation queries the response was YES. [2022-12-13 10:30:10,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 47 events. 13/47 cut-off events. For 81/84 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 108 event pairs, 1 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 124. Up to 20 conditions per place. [2022-12-13 10:30:10,651 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 25 transitions, 185 flow [2022-12-13 10:30:10,651 INFO L226 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-13 10:30:10,654 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:10,659 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-13 10:30:10,659 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 185 flow [2022-12-13 10:30:10,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:10,659 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:10,659 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:30:10,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 10:30:10,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:30:10,865 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:30:10,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:10,865 INFO L85 PathProgramCache]: Analyzing trace with hash -219994634, now seen corresponding path program 1 times [2022-12-13 10:30:10,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:10,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070822313] [2022-12-13 10:30:10,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:10,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:10,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:30:10,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:10,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070822313] [2022-12-13 10:30:10,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070822313] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:10,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:10,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:30:10,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079047980] [2022-12-13 10:30:10,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:10,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:30:10,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:10,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:30:10,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:30:10,959 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-13 10:30:10,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 185 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:10,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:10,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-13 10:30:10,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:11,035 INFO L130 PetriNetUnfolder]: 78/160 cut-off events. [2022-12-13 10:30:11,035 INFO L131 PetriNetUnfolder]: For 498/498 co-relation queries the response was YES. [2022-12-13 10:30:11,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 696 conditions, 160 events. 78/160 cut-off events. For 498/498 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 507 event pairs, 10 based on Foata normal form. 12/172 useless extension candidates. Maximal degree in co-relation 342. Up to 80 conditions per place. [2022-12-13 10:30:11,038 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 38 selfloop transitions, 8 changer transitions 4/50 dead transitions. [2022-12-13 10:30:11,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 50 transitions, 420 flow [2022-12-13 10:30:11,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:30:11,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:30:11,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-13 10:30:11,039 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5538461538461539 [2022-12-13 10:30:11,039 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 185 flow. Second operand 5 states and 36 transitions. [2022-12-13 10:30:11,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 50 transitions, 420 flow [2022-12-13 10:30:11,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 50 transitions, 371 flow, removed 21 selfloop flow, removed 2 redundant places. [2022-12-13 10:30:11,045 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 236 flow [2022-12-13 10:30:11,045 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=236, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2022-12-13 10:30:11,046 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 18 predicate places. [2022-12-13 10:30:11,046 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:11,046 INFO L89 Accepts]: Start accepts. Operand has 36 places, 30 transitions, 236 flow [2022-12-13 10:30:11,047 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:11,047 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:11,048 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 30 transitions, 236 flow [2022-12-13 10:30:11,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 30 transitions, 236 flow [2022-12-13 10:30:11,053 INFO L130 PetriNetUnfolder]: 16/56 cut-off events. [2022-12-13 10:30:11,053 INFO L131 PetriNetUnfolder]: For 169/171 co-relation queries the response was YES. [2022-12-13 10:30:11,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 56 events. 16/56 cut-off events. For 169/171 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 141 event pairs, 1 based on Foata normal form. 2/58 useless extension candidates. Maximal degree in co-relation 158. Up to 23 conditions per place. [2022-12-13 10:30:11,054 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 30 transitions, 236 flow [2022-12-13 10:30:11,054 INFO L226 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-13 10:30:11,072 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [356] L61-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (not (< (mod v_~i2~0_In_3 4294967296) (* (mod v_~N~0_In_7 2147483648) 2))) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~i2~0=v_~i2~0_In_3, ~N~0=v_~N~0_In_7} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, ~i2~0=v_~i2~0_In_3, ~N~0=v_~N~0_In_7, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [354] L42-1-->L42-1: Formula: (let ((.cse1 (= (mod v_~d1~0_In_1 256) 0))) (let ((.cse0 (= v_~d1~0_Out_6 (ite (= (ite .cse1 1 0) 0) 0 1))) (.cse2 (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_6)) (.cse3 (< (mod v_~i1~0_In_3 4294967296) (* 2 (mod v_~N~0_In_3 2147483648))))) (or (and (= (+ v_~pos~0_Out_6 1) v_~pos~0_In_3) .cse0 .cse1 .cse2 (= |v_thread1Thread1of1ForFork0_#t~post1_Out_2| |v_thread1Thread1of1ForFork0_#t~post1_In_1|) .cse3) (and (not .cse1) .cse0 .cse2 (= |v_thread1Thread1of1ForFork0_#t~post2_In_1| |v_thread1Thread1of1ForFork0_#t~post2_Out_2|) .cse3 (= v_~pos~0_Out_6 (+ v_~pos~0_In_3 1)))))) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_In_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_In_1|, ~i1~0=v_~i1~0_In_3, ~pos~0=v_~pos~0_In_3, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_In_1} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_Out_2|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_Out_2|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|, ~i1~0=v_~i1~0_Out_6, ~pos~0=v_~pos~0_Out_6, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_Out_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i1~0, ~pos~0, ~d1~0] [2022-12-13 10:30:11,245 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:30:11,246 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 200 [2022-12-13 10:30:11,246 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 245 flow [2022-12-13 10:30:11,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:11,246 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:11,246 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:30:11,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 10:30:11,247 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:30:11,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:11,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1211042950, now seen corresponding path program 2 times [2022-12-13 10:30:11,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:11,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828207514] [2022-12-13 10:30:11,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:11,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:11,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:30:11,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:11,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828207514] [2022-12-13 10:30:11,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828207514] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:30:11,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126127783] [2022-12-13 10:30:11,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 10:30:11,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:30:11,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:30:11,628 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:30:11,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 10:30:11,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 10:30:11,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:30:11,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 10:30:11,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:30:11,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:30:11,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:30:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:30:11,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126127783] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:30:11,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:30:11,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 7 [2022-12-13 10:30:11,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630479985] [2022-12-13 10:30:11,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:30:11,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:30:11,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:11,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:30:11,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:30:11,946 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-13 10:30:11,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 245 flow. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:11,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:11,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-13 10:30:11,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:12,129 INFO L130 PetriNetUnfolder]: 93/184 cut-off events. [2022-12-13 10:30:12,129 INFO L131 PetriNetUnfolder]: For 732/732 co-relation queries the response was YES. [2022-12-13 10:30:12,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 870 conditions, 184 events. 93/184 cut-off events. For 732/732 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 572 event pairs, 10 based on Foata normal form. 22/206 useless extension candidates. Maximal degree in co-relation 616. Up to 119 conditions per place. [2022-12-13 10:30:12,131 INFO L137 encePairwiseOnDemand]: 9/14 looper letters, 41 selfloop transitions, 16 changer transitions 1/58 dead transitions. [2022-12-13 10:30:12,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 58 transitions, 536 flow [2022-12-13 10:30:12,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:30:12,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:30:12,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-12-13 10:30:12,132 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4489795918367347 [2022-12-13 10:30:12,132 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 245 flow. Second operand 7 states and 44 transitions. [2022-12-13 10:30:12,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 58 transitions, 536 flow [2022-12-13 10:30:12,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 58 transitions, 522 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-12-13 10:30:12,135 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 386 flow [2022-12-13 10:30:12,135 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=386, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2022-12-13 10:30:12,135 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 27 predicate places. [2022-12-13 10:30:12,135 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:12,136 INFO L89 Accepts]: Start accepts. Operand has 45 places, 38 transitions, 386 flow [2022-12-13 10:30:12,148 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:12,148 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:12,148 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 38 transitions, 386 flow [2022-12-13 10:30:12,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 38 transitions, 386 flow [2022-12-13 10:30:12,165 INFO L130 PetriNetUnfolder]: 22/74 cut-off events. [2022-12-13 10:30:12,165 INFO L131 PetriNetUnfolder]: For 334/334 co-relation queries the response was YES. [2022-12-13 10:30:12,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 74 events. 22/74 cut-off events. For 334/334 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 218 event pairs, 2 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 301. Up to 35 conditions per place. [2022-12-13 10:30:12,166 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 38 transitions, 386 flow [2022-12-13 10:30:12,166 INFO L226 LiptonReduction]: Number of co-enabled transitions 98 [2022-12-13 10:30:12,773 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:30:12,776 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 641 [2022-12-13 10:30:12,776 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 400 flow [2022-12-13 10:30:12,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:12,776 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:12,776 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:30:12,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 10:30:12,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:30:12,977 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:30:12,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:12,977 INFO L85 PathProgramCache]: Analyzing trace with hash 511785357, now seen corresponding path program 1 times [2022-12-13 10:30:12,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:12,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796644070] [2022-12-13 10:30:12,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:12,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:13,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 10:30:13,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:13,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796644070] [2022-12-13 10:30:13,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796644070] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:30:13,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312151025] [2022-12-13 10:30:13,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:13,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:30:13,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:30:13,816 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:30:13,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 10:30:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:13,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 10:30:13,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:30:14,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:30:14,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:30:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:30:15,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312151025] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:30:15,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:30:15,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 11 [2022-12-13 10:30:15,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425921330] [2022-12-13 10:30:15,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:30:15,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 10:30:15,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:15,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 10:30:15,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-12-13 10:30:15,243 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 10:30:15,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 400 flow. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:15,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:15,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 10:30:15,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:16,932 INFO L130 PetriNetUnfolder]: 212/430 cut-off events. [2022-12-13 10:30:16,932 INFO L131 PetriNetUnfolder]: For 2729/2729 co-relation queries the response was YES. [2022-12-13 10:30:16,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2403 conditions, 430 events. 212/430 cut-off events. For 2729/2729 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1899 event pairs, 6 based on Foata normal form. 3/433 useless extension candidates. Maximal degree in co-relation 1615. Up to 189 conditions per place. [2022-12-13 10:30:16,935 INFO L137 encePairwiseOnDemand]: 7/16 looper letters, 63 selfloop transitions, 63 changer transitions 8/134 dead transitions. [2022-12-13 10:30:16,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 134 transitions, 1568 flow [2022-12-13 10:30:16,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 10:30:16,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 10:30:16,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 102 transitions. [2022-12-13 10:30:16,949 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2022-12-13 10:30:16,949 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 400 flow. Second operand 18 states and 102 transitions. [2022-12-13 10:30:16,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 134 transitions, 1568 flow [2022-12-13 10:30:16,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 134 transitions, 1448 flow, removed 52 selfloop flow, removed 2 redundant places. [2022-12-13 10:30:16,955 INFO L231 Difference]: Finished difference. Result has 67 places, 89 transitions, 1206 flow [2022-12-13 10:30:16,955 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1206, PETRI_PLACES=67, PETRI_TRANSITIONS=89} [2022-12-13 10:30:16,956 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 49 predicate places. [2022-12-13 10:30:16,956 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:16,956 INFO L89 Accepts]: Start accepts. Operand has 67 places, 89 transitions, 1206 flow [2022-12-13 10:30:16,957 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:16,957 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:16,957 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 89 transitions, 1206 flow [2022-12-13 10:30:16,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 89 transitions, 1206 flow [2022-12-13 10:30:16,971 INFO L130 PetriNetUnfolder]: 46/157 cut-off events. [2022-12-13 10:30:16,971 INFO L131 PetriNetUnfolder]: For 1199/1199 co-relation queries the response was YES. [2022-12-13 10:30:16,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 909 conditions, 157 events. 46/157 cut-off events. For 1199/1199 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 728 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 817. Up to 76 conditions per place. [2022-12-13 10:30:16,972 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 89 transitions, 1206 flow [2022-12-13 10:30:16,972 INFO L226 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-13 10:30:18,540 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [355] L61-1-->L61-1: Formula: (let ((.cse3 (= (mod v_~d2~0_In_1 256) 0))) (let ((.cse0 (= v_~i2~0_Out_6 (+ v_~i2~0_In_1 1))) (.cse1 (< (mod v_~i2~0_In_1 4294967296) (* (mod v_~N~0_In_5 2147483648) 2))) (.cse2 (= (ite (= (ite .cse3 1 0) 0) 0 1) v_~d2~0_Out_6))) (or (and .cse0 .cse1 (= (+ v_~pos~0_Out_10 2) v_~pos~0_In_5) .cse2 .cse3) (and .cse0 .cse1 .cse2 (= (+ 2 v_~pos~0_In_5) v_~pos~0_Out_10) (not .cse3))))) InVars {~i2~0=v_~i2~0_In_1, ~pos~0=v_~pos~0_In_5, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_In_1} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_Out_2|, ~i2~0=v_~i2~0_Out_6, ~pos~0=v_~pos~0_Out_10, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_Out_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~i2~0, ~pos~0, ~d2~0] and [354] L42-1-->L42-1: Formula: (let ((.cse1 (= (mod v_~d1~0_In_1 256) 0))) (let ((.cse0 (= v_~d1~0_Out_6 (ite (= (ite .cse1 1 0) 0) 0 1))) (.cse2 (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_6)) (.cse3 (< (mod v_~i1~0_In_3 4294967296) (* 2 (mod v_~N~0_In_3 2147483648))))) (or (and (= (+ v_~pos~0_Out_6 1) v_~pos~0_In_3) .cse0 .cse1 .cse2 (= |v_thread1Thread1of1ForFork0_#t~post1_Out_2| |v_thread1Thread1of1ForFork0_#t~post1_In_1|) .cse3) (and (not .cse1) .cse0 .cse2 (= |v_thread1Thread1of1ForFork0_#t~post2_In_1| |v_thread1Thread1of1ForFork0_#t~post2_Out_2|) .cse3 (= v_~pos~0_Out_6 (+ v_~pos~0_In_3 1)))))) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_In_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_In_1|, ~i1~0=v_~i1~0_In_3, ~pos~0=v_~pos~0_In_3, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_In_1} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_Out_2|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_Out_2|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|, ~i1~0=v_~i1~0_Out_6, ~pos~0=v_~pos~0_Out_6, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_Out_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i1~0, ~pos~0, ~d1~0] [2022-12-13 10:30:20,275 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [355] L61-1-->L61-1: Formula: (let ((.cse3 (= (mod v_~d2~0_In_1 256) 0))) (let ((.cse0 (= v_~i2~0_Out_6 (+ v_~i2~0_In_1 1))) (.cse1 (< (mod v_~i2~0_In_1 4294967296) (* (mod v_~N~0_In_5 2147483648) 2))) (.cse2 (= (ite (= (ite .cse3 1 0) 0) 0 1) v_~d2~0_Out_6))) (or (and .cse0 .cse1 (= (+ v_~pos~0_Out_10 2) v_~pos~0_In_5) .cse2 .cse3) (and .cse0 .cse1 .cse2 (= (+ 2 v_~pos~0_In_5) v_~pos~0_Out_10) (not .cse3))))) InVars {~i2~0=v_~i2~0_In_1, ~pos~0=v_~pos~0_In_5, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_In_1} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_Out_2|, ~i2~0=v_~i2~0_Out_6, ~pos~0=v_~pos~0_Out_10, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_Out_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~i2~0, ~pos~0, ~d2~0] and [354] L42-1-->L42-1: Formula: (let ((.cse1 (= (mod v_~d1~0_In_1 256) 0))) (let ((.cse0 (= v_~d1~0_Out_6 (ite (= (ite .cse1 1 0) 0) 0 1))) (.cse2 (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_6)) (.cse3 (< (mod v_~i1~0_In_3 4294967296) (* 2 (mod v_~N~0_In_3 2147483648))))) (or (and (= (+ v_~pos~0_Out_6 1) v_~pos~0_In_3) .cse0 .cse1 .cse2 (= |v_thread1Thread1of1ForFork0_#t~post1_Out_2| |v_thread1Thread1of1ForFork0_#t~post1_In_1|) .cse3) (and (not .cse1) .cse0 .cse2 (= |v_thread1Thread1of1ForFork0_#t~post2_In_1| |v_thread1Thread1of1ForFork0_#t~post2_Out_2|) .cse3 (= v_~pos~0_Out_6 (+ v_~pos~0_In_3 1)))))) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_In_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_In_1|, ~i1~0=v_~i1~0_In_3, ~pos~0=v_~pos~0_In_3, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_In_1} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_Out_2|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_Out_2|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|, ~i1~0=v_~i1~0_Out_6, ~pos~0=v_~pos~0_Out_6, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_Out_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i1~0, ~pos~0, ~d1~0] [2022-12-13 10:30:21,714 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [354] L42-1-->L42-1: Formula: (let ((.cse1 (= (mod v_~d1~0_In_1 256) 0))) (let ((.cse0 (= v_~d1~0_Out_6 (ite (= (ite .cse1 1 0) 0) 0 1))) (.cse2 (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_6)) (.cse3 (< (mod v_~i1~0_In_3 4294967296) (* 2 (mod v_~N~0_In_3 2147483648))))) (or (and (= (+ v_~pos~0_Out_6 1) v_~pos~0_In_3) .cse0 .cse1 .cse2 (= |v_thread1Thread1of1ForFork0_#t~post1_Out_2| |v_thread1Thread1of1ForFork0_#t~post1_In_1|) .cse3) (and (not .cse1) .cse0 .cse2 (= |v_thread1Thread1of1ForFork0_#t~post2_In_1| |v_thread1Thread1of1ForFork0_#t~post2_Out_2|) .cse3 (= v_~pos~0_Out_6 (+ v_~pos~0_In_3 1)))))) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_In_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_In_1|, ~i1~0=v_~i1~0_In_3, ~pos~0=v_~pos~0_In_3, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_In_1} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_Out_2|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_Out_2|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|, ~i1~0=v_~i1~0_Out_6, ~pos~0=v_~pos~0_Out_6, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_Out_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i1~0, ~pos~0, ~d1~0] and [371] L61-1-->L61-1: Formula: (let ((.cse4 (+ v_~pos~0_323 2)) (.cse5 (* (mod v_~N~0_117 2147483648) 2))) (and (let ((.cse1 (= (mod v_~d2~0_161 256) 0))) (let ((.cse0 (= (ite (= (ite .cse1 1 0) 0) 0 1) v_~d2~0_160)) (.cse2 (< (mod v_~i2~0_146 4294967296) .cse5)) (.cse3 (= v_~i2~0_145 (+ v_~i2~0_146 1)))) (or (and .cse0 (not .cse1) .cse2 (= v_~pos~0_323 (+ v_~pos~0_324 2)) .cse3) (and (= v_~pos~0_324 .cse4) .cse1 .cse0 .cse2 .cse3)))) (let ((.cse7 (= (mod v_~d2~0_160 256) 0))) (let ((.cse6 (< (mod v_~i2~0_145 4294967296) .cse5)) (.cse8 (= (ite (= (ite .cse7 1 0) 0) 0 1) v_~d2~0_159)) (.cse9 (= (+ v_~i2~0_145 1) v_~i2~0_144))) (or (and .cse6 (= v_~pos~0_323 (+ v_~pos~0_322 2)) .cse7 .cse8 .cse9) (and (= v_~pos~0_322 .cse4) .cse6 .cse8 .cse9 (not .cse7))))))) InVars {~i2~0=v_~i2~0_146, ~pos~0=v_~pos~0_324, ~N~0=v_~N~0_117, ~d2~0=v_~d2~0_161} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_76|, ~i2~0=v_~i2~0_144, ~pos~0=v_~pos~0_322, ~N~0=v_~N~0_117, ~d2~0=v_~d2~0_159} AuxVars[v_~pos~0_323, v_~i2~0_145, v_~d2~0_160] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~i2~0, ~pos~0, ~d2~0] [2022-12-13 10:30:22,126 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [354] L42-1-->L42-1: Formula: (let ((.cse1 (= (mod v_~d1~0_In_1 256) 0))) (let ((.cse0 (= v_~d1~0_Out_6 (ite (= (ite .cse1 1 0) 0) 0 1))) (.cse2 (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_6)) (.cse3 (< (mod v_~i1~0_In_3 4294967296) (* 2 (mod v_~N~0_In_3 2147483648))))) (or (and (= (+ v_~pos~0_Out_6 1) v_~pos~0_In_3) .cse0 .cse1 .cse2 (= |v_thread1Thread1of1ForFork0_#t~post1_Out_2| |v_thread1Thread1of1ForFork0_#t~post1_In_1|) .cse3) (and (not .cse1) .cse0 .cse2 (= |v_thread1Thread1of1ForFork0_#t~post2_In_1| |v_thread1Thread1of1ForFork0_#t~post2_Out_2|) .cse3 (= v_~pos~0_Out_6 (+ v_~pos~0_In_3 1)))))) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_In_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_In_1|, ~i1~0=v_~i1~0_In_3, ~pos~0=v_~pos~0_In_3, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_In_1} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_Out_2|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_Out_2|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|, ~i1~0=v_~i1~0_Out_6, ~pos~0=v_~pos~0_Out_6, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_Out_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i1~0, ~pos~0, ~d1~0] and [373] L61-1-->L42-1: Formula: (let ((.cse4 (+ v_~pos~0_331 1)) (.cse0 (* 2 (mod v_~N~0_119 2147483648))) (.cse11 (+ v_~pos~0_329 2))) (and (= |v_thread2Thread1of1ForFork1_#res.offset_27| 0) (not (< (mod v_~i2~0_150 4294967296) .cse0)) (let ((.cse1 (= 0 (mod v_~d1~0_181 256)))) (let ((.cse2 (< (mod v_~i1~0_178 4294967296) .cse0)) (.cse3 (= v_~i1~0_179 (+ v_~i1~0_178 1))) (.cse5 (= v_~d1~0_182 (ite (= (ite .cse1 1 0) 0) 0 1)))) (or (and .cse1 .cse2 .cse3 (= |v_thread1Thread1of1ForFork0_#t~post1_87| |v_thread1Thread1of1ForFork0_#t~post1_86|) (= v_~pos~0_330 .cse4) .cse5) (and (not .cse1) .cse2 .cse3 .cse5 (= v_~pos~0_331 (+ v_~pos~0_330 1)) (= |v_thread1Thread1of1ForFork0_#t~post2_86| |v_thread1Thread1of1ForFork0_#t~post2_87|))))) (let ((.cse9 (= (mod v_~d1~0_182 256) 0))) (let ((.cse6 (= (+ v_~i1~0_179 1) v_~i1~0_177)) (.cse7 (< (mod v_~i1~0_179 4294967296) .cse0)) (.cse8 (= v_~d1~0_180 (ite (= (ite .cse9 1 0) 0) 0 1)))) (or (and (= v_~pos~0_328 .cse4) .cse6 (= |v_thread1Thread1of1ForFork0_#t~post2_85| |v_thread1Thread1of1ForFork0_#t~post2_87|) .cse7 .cse8 (not .cse9)) (and (= |v_thread1Thread1of1ForFork0_#t~post1_85| |v_thread1Thread1of1ForFork0_#t~post1_87|) .cse6 .cse7 .cse8 (= v_~pos~0_331 (+ v_~pos~0_328 1)) .cse9)))) (let ((.cse12 (= (mod v_~d2~0_166 256) 0))) (let ((.cse10 (= (ite (= (ite .cse12 1 0) 0) 0 1) v_~d2~0_165)) (.cse13 (< (mod v_~i2~0_151 4294967296) .cse0)) (.cse14 (= v_~i2~0_150 (+ v_~i2~0_151 1)))) (or (and .cse10 (= v_~pos~0_330 .cse11) (not .cse12) .cse13 .cse14) (and .cse10 .cse13 .cse14 (= v_~pos~0_329 (+ v_~pos~0_330 2)) .cse12)))) (let ((.cse16 (= (mod v_~d2~0_167 256) 0))) (let ((.cse15 (= v_~d2~0_166 (ite (= (ite .cse16 1 0) 0) 0 1))) (.cse17 (= (+ v_~i2~0_152 1) v_~i2~0_151))) (or (and .cse15 (not .cse16) .cse17 (= v_~pos~0_329 (+ v_~pos~0_332 2))) (and .cse15 .cse16 (= v_~pos~0_332 .cse11) .cse17)))) (= |v_thread2Thread1of1ForFork1_#res.base_27| 0))) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_86|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_86|, ~i2~0=v_~i2~0_152, ~i1~0=v_~i1~0_178, ~pos~0=v_~pos~0_332, ~N~0=v_~N~0_119, ~d1~0=v_~d1~0_181, ~d2~0=v_~d2~0_167} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_27|, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_80|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_85|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_85|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_69|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_27|, ~i2~0=v_~i2~0_150, ~i1~0=v_~i1~0_177, ~pos~0=v_~pos~0_328, ~N~0=v_~N~0_119, ~d1~0=v_~d1~0_180, ~d2~0=v_~d2~0_165} AuxVars[v_~d2~0_166, v_~pos~0_330, v_~i1~0_179, v_~pos~0_331, v_~pos~0_329, |v_thread1Thread1of1ForFork0_#t~post2_87|, v_~d1~0_182, |v_thread1Thread1of1ForFork0_#t~post1_87|, v_~i2~0_151] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread2Thread1of1ForFork1_#res.base, ~i2~0, ~i1~0, ~pos~0, ~d1~0, ~d2~0] [2022-12-13 10:30:23,653 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [354] L42-1-->L42-1: Formula: (let ((.cse1 (= (mod v_~d1~0_In_1 256) 0))) (let ((.cse0 (= v_~d1~0_Out_6 (ite (= (ite .cse1 1 0) 0) 0 1))) (.cse2 (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_6)) (.cse3 (< (mod v_~i1~0_In_3 4294967296) (* 2 (mod v_~N~0_In_3 2147483648))))) (or (and (= (+ v_~pos~0_Out_6 1) v_~pos~0_In_3) .cse0 .cse1 .cse2 (= |v_thread1Thread1of1ForFork0_#t~post1_Out_2| |v_thread1Thread1of1ForFork0_#t~post1_In_1|) .cse3) (and (not .cse1) .cse0 .cse2 (= |v_thread1Thread1of1ForFork0_#t~post2_In_1| |v_thread1Thread1of1ForFork0_#t~post2_Out_2|) .cse3 (= v_~pos~0_Out_6 (+ v_~pos~0_In_3 1)))))) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_In_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_In_1|, ~i1~0=v_~i1~0_In_3, ~pos~0=v_~pos~0_In_3, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_In_1} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_Out_2|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_Out_2|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|, ~i1~0=v_~i1~0_Out_6, ~pos~0=v_~pos~0_Out_6, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_Out_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i1~0, ~pos~0, ~d1~0] and [374] L61-1-->L42-1: Formula: (let ((.cse4 (* (mod v_~N~0_121 2147483648) 2))) (and (let ((.cse3 (= (mod v_~d2~0_172 256) 0))) (let ((.cse0 (= v_~i2~0_156 (+ v_~i2~0_157 1))) (.cse1 (< (mod v_~i2~0_157 4294967296) .cse4)) (.cse2 (= (ite (= (ite .cse3 1 0) 0) 0 1) v_~d2~0_171))) (or (and .cse0 (= v_~pos~0_339 (+ v_~pos~0_340 2)) .cse1 .cse2 (not .cse3)) (and .cse3 .cse0 (= v_~pos~0_340 (+ v_~pos~0_339 2)) .cse1 .cse2)))) (let ((.cse6 (= (mod v_~d1~0_187 256) 0))) (let ((.cse5 (= v_~i1~0_183 (+ v_~i1~0_184 1))) (.cse7 (= (ite (= (ite .cse6 1 0) 0) 0 1) v_~d1~0_186)) (.cse8 (< (mod v_~i1~0_184 4294967296) .cse4))) (or (and .cse5 (not .cse6) (= v_~pos~0_338 (+ v_~pos~0_339 1)) .cse7 (= |v_thread1Thread1of1ForFork0_#t~post2_92| |v_thread1Thread1of1ForFork0_#t~post2_91|) .cse8) (and .cse5 .cse7 .cse6 (= v_~pos~0_339 (+ v_~pos~0_338 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_92| |v_thread1Thread1of1ForFork0_#t~post1_91|) .cse8)))))) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_92|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_92|, ~i2~0=v_~i2~0_157, ~i1~0=v_~i1~0_184, ~pos~0=v_~pos~0_340, ~N~0=v_~N~0_121, ~d1~0=v_~d1~0_187, ~d2~0=v_~d2~0_172} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_84|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_91|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_91|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_71|, ~i2~0=v_~i2~0_156, ~i1~0=v_~i1~0_183, ~pos~0=v_~pos~0_338, ~N~0=v_~N~0_121, ~d1~0=v_~d1~0_186, ~d2~0=v_~d2~0_171} AuxVars[v_~pos~0_339] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~i1~0, ~pos~0, ~d1~0, ~d2~0] [2022-12-13 10:30:24,090 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [354] L42-1-->L42-1: Formula: (let ((.cse1 (= (mod v_~d1~0_In_1 256) 0))) (let ((.cse0 (= v_~d1~0_Out_6 (ite (= (ite .cse1 1 0) 0) 0 1))) (.cse2 (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_6)) (.cse3 (< (mod v_~i1~0_In_3 4294967296) (* 2 (mod v_~N~0_In_3 2147483648))))) (or (and (= (+ v_~pos~0_Out_6 1) v_~pos~0_In_3) .cse0 .cse1 .cse2 (= |v_thread1Thread1of1ForFork0_#t~post1_Out_2| |v_thread1Thread1of1ForFork0_#t~post1_In_1|) .cse3) (and (not .cse1) .cse0 .cse2 (= |v_thread1Thread1of1ForFork0_#t~post2_In_1| |v_thread1Thread1of1ForFork0_#t~post2_Out_2|) .cse3 (= v_~pos~0_Out_6 (+ v_~pos~0_In_3 1)))))) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_In_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_In_1|, ~i1~0=v_~i1~0_In_3, ~pos~0=v_~pos~0_In_3, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_In_1} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_Out_2|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_Out_2|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|, ~i1~0=v_~i1~0_Out_6, ~pos~0=v_~pos~0_Out_6, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_Out_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i1~0, ~pos~0, ~d1~0] and [376] L61-1-->L42-1: Formula: (let ((.cse0 (+ v_~pos~0_345 2)) (.cse5 (* 2 (mod v_~N~0_123 2147483648)))) (and (let ((.cse2 (= (mod v_~d2~0_176 256) 0))) (let ((.cse1 (< (mod v_~i2~0_161 4294967296) .cse5)) (.cse3 (= (+ v_~i2~0_161 1) v_~i2~0_160)) (.cse4 (= v_~d2~0_175 (ite (= (ite .cse2 1 0) 0) 0 1)))) (or (and (= v_~pos~0_346 .cse0) .cse1 (not .cse2) .cse3 .cse4) (and .cse2 .cse1 .cse3 .cse4 (= v_~pos~0_345 (+ v_~pos~0_346 2)))))) (let ((.cse7 (= (mod v_~d1~0_191 256) 0))) (let ((.cse6 (= v_~i1~0_187 (+ v_~i1~0_188 1))) (.cse8 (= v_~d1~0_190 (ite (= 0 (ite .cse7 1 0)) 0 1))) (.cse9 (< (mod v_~i1~0_188 4294967296) .cse5))) (or (and (= v_~pos~0_346 (+ v_~pos~0_344 1)) .cse6 .cse7 .cse8 (= |v_thread1Thread1of1ForFork0_#t~post1_96| |v_thread1Thread1of1ForFork0_#t~post1_95|) .cse9) (and .cse6 .cse8 .cse9 (= |v_thread1Thread1of1ForFork0_#t~post2_96| |v_thread1Thread1of1ForFork0_#t~post2_95|) (= (+ v_~pos~0_346 1) v_~pos~0_344) (not .cse7))))) (let ((.cse10 (= (mod v_~d2~0_177 256) 0))) (let ((.cse11 (= (ite (= (ite .cse10 1 0) 0) 0 1) v_~d2~0_176)) (.cse12 (< (mod v_~i2~0_162 4294967296) .cse5)) (.cse13 (= v_~i2~0_161 (+ v_~i2~0_162 1)))) (or (and .cse10 .cse11 .cse12 .cse13 (= v_~pos~0_347 .cse0)) (and (= v_~pos~0_345 (+ v_~pos~0_347 2)) .cse11 .cse12 .cse13 (not .cse10))))))) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_96|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_96|, ~i2~0=v_~i2~0_162, ~i1~0=v_~i1~0_188, ~pos~0=v_~pos~0_347, ~N~0=v_~N~0_123, ~d1~0=v_~d1~0_191, ~d2~0=v_~d2~0_177} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_86|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_95|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_95|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_73|, ~i2~0=v_~i2~0_160, ~i1~0=v_~i1~0_187, ~pos~0=v_~pos~0_344, ~N~0=v_~N~0_123, ~d1~0=v_~d1~0_190, ~d2~0=v_~d2~0_175} AuxVars[v_~pos~0_345, v_~pos~0_346, v_~d2~0_176, v_~i2~0_161] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~i1~0, ~pos~0, ~d1~0, ~d2~0] [2022-12-13 10:30:24,874 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [354] L42-1-->L42-1: Formula: (let ((.cse1 (= (mod v_~d1~0_In_1 256) 0))) (let ((.cse0 (= v_~d1~0_Out_6 (ite (= (ite .cse1 1 0) 0) 0 1))) (.cse2 (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_6)) (.cse3 (< (mod v_~i1~0_In_3 4294967296) (* 2 (mod v_~N~0_In_3 2147483648))))) (or (and (= (+ v_~pos~0_Out_6 1) v_~pos~0_In_3) .cse0 .cse1 .cse2 (= |v_thread1Thread1of1ForFork0_#t~post1_Out_2| |v_thread1Thread1of1ForFork0_#t~post1_In_1|) .cse3) (and (not .cse1) .cse0 .cse2 (= |v_thread1Thread1of1ForFork0_#t~post2_In_1| |v_thread1Thread1of1ForFork0_#t~post2_Out_2|) .cse3 (= v_~pos~0_Out_6 (+ v_~pos~0_In_3 1)))))) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_In_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_In_1|, ~i1~0=v_~i1~0_In_3, ~pos~0=v_~pos~0_In_3, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_In_1} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_Out_2|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_Out_2|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|, ~i1~0=v_~i1~0_Out_6, ~pos~0=v_~pos~0_Out_6, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_Out_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i1~0, ~pos~0, ~d1~0] and [378] L61-1-->L61-1: Formula: (let ((.cse5 (* 2 (mod v_~N~0_125 2147483648))) (.cse6 (+ v_~pos~0_354 2)) (.cse3 (+ v_~pos~0_353 2))) (and (let ((.cse2 (= (mod v_~d2~0_184 256) 0))) (let ((.cse0 (< (mod v_~i2~0_169 4294967296) .cse5)) (.cse1 (= (+ v_~i2~0_169 1) v_~i2~0_167)) (.cse4 (= v_~d2~0_182 (ite (= (ite .cse2 1 0) 0) 0 1)))) (or (and .cse0 .cse1 .cse2 (= v_~pos~0_355 .cse3) .cse4) (and .cse0 (= v_~pos~0_353 (+ v_~pos~0_355 2)) .cse1 (not .cse2) .cse4)))) (let ((.cse8 (= (mod v_~d2~0_183 256) 0))) (let ((.cse7 (< (mod v_~i2~0_168 4294967296) .cse5)) (.cse9 (= (ite (= (ite .cse8 1 0) 0) 0 1) v_~d2~0_181)) (.cse10 (= v_~i2~0_166 (+ v_~i2~0_168 1)))) (or (and (= v_~pos~0_352 .cse6) .cse7 (not .cse8) .cse9 .cse10) (and .cse8 .cse7 (= v_~pos~0_354 (+ v_~pos~0_352 2)) .cse9 .cse10)))) (let ((.cse11 (= (mod v_~d2~0_182 256) 0))) (let ((.cse12 (= (+ v_~i2~0_167 1) v_~i2~0_168)) (.cse13 (= (ite (= (ite .cse11 1 0) 0) 0 1) v_~d2~0_183))) (or (and .cse11 .cse12 (= v_~pos~0_353 .cse6) .cse13) (and (not .cse11) .cse12 (= v_~pos~0_354 .cse3) .cse13)))))) InVars {~i2~0=v_~i2~0_169, ~pos~0=v_~pos~0_355, ~N~0=v_~N~0_125, ~d2~0=v_~d2~0_184} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_90|, ~i2~0=v_~i2~0_166, ~pos~0=v_~pos~0_352, ~N~0=v_~N~0_125, ~d2~0=v_~d2~0_181} AuxVars[v_~pos~0_354, v_~i2~0_167, v_~i2~0_168, v_~pos~0_353, v_~d2~0_182, v_~d2~0_183] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~i2~0, ~pos~0, ~d2~0] [2022-12-13 10:30:25,736 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [354] L42-1-->L42-1: Formula: (let ((.cse1 (= (mod v_~d1~0_In_1 256) 0))) (let ((.cse0 (= v_~d1~0_Out_6 (ite (= (ite .cse1 1 0) 0) 0 1))) (.cse2 (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_6)) (.cse3 (< (mod v_~i1~0_In_3 4294967296) (* 2 (mod v_~N~0_In_3 2147483648))))) (or (and (= (+ v_~pos~0_Out_6 1) v_~pos~0_In_3) .cse0 .cse1 .cse2 (= |v_thread1Thread1of1ForFork0_#t~post1_Out_2| |v_thread1Thread1of1ForFork0_#t~post1_In_1|) .cse3) (and (not .cse1) .cse0 .cse2 (= |v_thread1Thread1of1ForFork0_#t~post2_In_1| |v_thread1Thread1of1ForFork0_#t~post2_Out_2|) .cse3 (= v_~pos~0_Out_6 (+ v_~pos~0_In_3 1)))))) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_In_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_In_1|, ~i1~0=v_~i1~0_In_3, ~pos~0=v_~pos~0_In_3, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_In_1} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_Out_2|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_Out_2|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|, ~i1~0=v_~i1~0_Out_6, ~pos~0=v_~pos~0_Out_6, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_Out_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i1~0, ~pos~0, ~d1~0] and [355] L61-1-->L61-1: Formula: (let ((.cse3 (= (mod v_~d2~0_In_1 256) 0))) (let ((.cse0 (= v_~i2~0_Out_6 (+ v_~i2~0_In_1 1))) (.cse1 (< (mod v_~i2~0_In_1 4294967296) (* (mod v_~N~0_In_5 2147483648) 2))) (.cse2 (= (ite (= (ite .cse3 1 0) 0) 0 1) v_~d2~0_Out_6))) (or (and .cse0 .cse1 (= (+ v_~pos~0_Out_10 2) v_~pos~0_In_5) .cse2 .cse3) (and .cse0 .cse1 .cse2 (= (+ 2 v_~pos~0_In_5) v_~pos~0_Out_10) (not .cse3))))) InVars {~i2~0=v_~i2~0_In_1, ~pos~0=v_~pos~0_In_5, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_In_1} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_Out_2|, ~i2~0=v_~i2~0_Out_6, ~pos~0=v_~pos~0_Out_10, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_Out_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~i2~0, ~pos~0, ~d2~0] [2022-12-13 10:30:25,936 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 10:30:25,937 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8981 [2022-12-13 10:30:25,937 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 88 transitions, 1272 flow [2022-12-13 10:30:25,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:25,937 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:25,937 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:30:25,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 10:30:26,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:30:26,138 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:30:26,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:26,139 INFO L85 PathProgramCache]: Analyzing trace with hash -959847685, now seen corresponding path program 1 times [2022-12-13 10:30:26,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:26,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244774785] [2022-12-13 10:30:26,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:26,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:26,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:30:26,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:26,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244774785] [2022-12-13 10:30:26,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244774785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:26,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:26,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 10:30:26,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082547849] [2022-12-13 10:30:26,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:26,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:30:26,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:26,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:30:26,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:30:26,393 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 10:30:26,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 88 transitions, 1272 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:26,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:26,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 10:30:26,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:26,571 INFO L130 PetriNetUnfolder]: 233/464 cut-off events. [2022-12-13 10:30:26,571 INFO L131 PetriNetUnfolder]: For 5148/5148 co-relation queries the response was YES. [2022-12-13 10:30:26,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3089 conditions, 464 events. 233/464 cut-off events. For 5148/5148 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2130 event pairs, 31 based on Foata normal form. 6/466 useless extension candidates. Maximal degree in co-relation 2613. Up to 364 conditions per place. [2022-12-13 10:30:26,574 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 91 selfloop transitions, 13 changer transitions 3/107 dead transitions. [2022-12-13 10:30:26,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 107 transitions, 1698 flow [2022-12-13 10:30:26,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:30:26,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:30:26,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-13 10:30:26,576 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48 [2022-12-13 10:30:26,576 INFO L175 Difference]: Start difference. First operand has 65 places, 88 transitions, 1272 flow. Second operand 3 states and 36 transitions. [2022-12-13 10:30:26,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 107 transitions, 1698 flow [2022-12-13 10:30:26,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 107 transitions, 1284 flow, removed 207 selfloop flow, removed 0 redundant places. [2022-12-13 10:30:26,590 INFO L231 Difference]: Finished difference. Result has 68 places, 90 transitions, 957 flow [2022-12-13 10:30:26,590 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=957, PETRI_PLACES=68, PETRI_TRANSITIONS=90} [2022-12-13 10:30:26,591 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 50 predicate places. [2022-12-13 10:30:26,591 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:26,591 INFO L89 Accepts]: Start accepts. Operand has 68 places, 90 transitions, 957 flow [2022-12-13 10:30:26,593 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:26,593 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:26,593 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 90 transitions, 957 flow [2022-12-13 10:30:26,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 90 transitions, 957 flow [2022-12-13 10:30:26,611 INFO L130 PetriNetUnfolder]: 52/181 cut-off events. [2022-12-13 10:30:26,611 INFO L131 PetriNetUnfolder]: For 1085/1088 co-relation queries the response was YES. [2022-12-13 10:30:26,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 833 conditions, 181 events. 52/181 cut-off events. For 1085/1088 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 951 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 724. Up to 51 conditions per place. [2022-12-13 10:30:26,613 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 90 transitions, 957 flow [2022-12-13 10:30:26,613 INFO L226 LiptonReduction]: Number of co-enabled transitions 250 [2022-12-13 10:30:26,616 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:26,617 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-13 10:30:26,617 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 90 transitions, 957 flow [2022-12-13 10:30:26,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:26,617 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:26,617 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:30:26,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 10:30:26,617 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:30:26,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:26,618 INFO L85 PathProgramCache]: Analyzing trace with hash 707106315, now seen corresponding path program 1 times [2022-12-13 10:30:26,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:26,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227558704] [2022-12-13 10:30:26,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:26,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:26,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:30:26,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:26,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227558704] [2022-12-13 10:30:26,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227558704] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:26,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:26,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:30:26,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853627377] [2022-12-13 10:30:26,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:26,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:30:26,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:26,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:30:26,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:30:26,887 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 10:30:26,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 90 transitions, 957 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:26,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:26,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 10:30:26,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:27,021 INFO L130 PetriNetUnfolder]: 254/497 cut-off events. [2022-12-13 10:30:27,021 INFO L131 PetriNetUnfolder]: For 3805/3805 co-relation queries the response was YES. [2022-12-13 10:30:27,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2793 conditions, 497 events. 254/497 cut-off events. For 3805/3805 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2317 event pairs, 16 based on Foata normal form. 0/493 useless extension candidates. Maximal degree in co-relation 2358. Up to 460 conditions per place. [2022-12-13 10:30:27,024 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 92 selfloop transitions, 17 changer transitions 1/110 dead transitions. [2022-12-13 10:30:27,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 110 transitions, 1327 flow [2022-12-13 10:30:27,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:30:27,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:30:27,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-13 10:30:27,025 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2022-12-13 10:30:27,025 INFO L175 Difference]: Start difference. First operand has 65 places, 90 transitions, 957 flow. Second operand 4 states and 37 transitions. [2022-12-13 10:30:27,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 110 transitions, 1327 flow [2022-12-13 10:30:27,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 110 transitions, 1288 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-13 10:30:27,034 INFO L231 Difference]: Finished difference. Result has 66 places, 99 transitions, 1081 flow [2022-12-13 10:30:27,035 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1081, PETRI_PLACES=66, PETRI_TRANSITIONS=99} [2022-12-13 10:30:27,035 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 48 predicate places. [2022-12-13 10:30:27,035 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:27,035 INFO L89 Accepts]: Start accepts. Operand has 66 places, 99 transitions, 1081 flow [2022-12-13 10:30:27,036 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:27,036 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:27,036 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 99 transitions, 1081 flow [2022-12-13 10:30:27,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 99 transitions, 1081 flow [2022-12-13 10:30:27,051 INFO L130 PetriNetUnfolder]: 58/197 cut-off events. [2022-12-13 10:30:27,051 INFO L131 PetriNetUnfolder]: For 1122/1126 co-relation queries the response was YES. [2022-12-13 10:30:27,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 197 events. 58/197 cut-off events. For 1122/1126 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1057 event pairs, 0 based on Foata normal form. 1/196 useless extension candidates. Maximal degree in co-relation 807. Up to 56 conditions per place. [2022-12-13 10:30:27,053 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 99 transitions, 1081 flow [2022-12-13 10:30:27,053 INFO L226 LiptonReduction]: Number of co-enabled transitions 280 [2022-12-13 10:30:27,054 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L42-1-->L42-1: Formula: (let ((.cse0 (+ v_~pos~0_418 1)) (.cse5 (* (mod v_~N~0_137 2147483648) 2))) (and (let ((.cse4 (= (mod v_~d1~0_224 256) 0))) (let ((.cse1 (= v_~i1~0_220 (+ v_~i1~0_221 1))) (.cse2 (= v_~d1~0_223 (ite (= (ite .cse4 1 0) 0) 0 1))) (.cse3 (< (mod v_~i1~0_221 4294967296) .cse5))) (or (and (= v_~pos~0_417 .cse0) .cse1 (= |v_thread1Thread1of1ForFork0_#t~post2_129| |v_thread1Thread1of1ForFork0_#t~post2_128|) .cse2 .cse3 (not .cse4)) (and (= (+ v_~pos~0_417 1) v_~pos~0_418) (= |v_thread1Thread1of1ForFork0_#t~post1_129| |v_thread1Thread1of1ForFork0_#t~post1_128|) .cse1 .cse4 .cse2 .cse3)))) (let ((.cse8 (= (mod v_~d1~0_225 256) 0))) (let ((.cse6 (< (mod v_~i1~0_222 4294967296) .cse5)) (.cse7 (= (+ v_~i1~0_222 1) v_~i1~0_221)) (.cse9 (= v_~d1~0_224 (ite (= (ite .cse8 1 0) 0) 0 1)))) (or (and (= v_~pos~0_418 (+ v_~pos~0_419 1)) .cse6 (= |v_thread1Thread1of1ForFork0_#t~post2_129| |v_thread1Thread1of1ForFork0_#t~post2_130|) .cse7 (not .cse8) .cse9) (and .cse8 (= v_~pos~0_419 .cse0) .cse6 (= |v_thread1Thread1of1ForFork0_#t~post1_129| |v_thread1Thread1of1ForFork0_#t~post1_130|) .cse7 .cse9)))))) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_130|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_130|, ~i1~0=v_~i1~0_222, ~pos~0=v_~pos~0_419, ~N~0=v_~N~0_137, ~d1~0=v_~d1~0_225} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_128|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_128|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_91|, ~i1~0=v_~i1~0_220, ~pos~0=v_~pos~0_417, ~N~0=v_~N~0_137, ~d1~0=v_~d1~0_223} AuxVars[|v_thread1Thread1of1ForFork0_#t~post2_129|, |v_thread1Thread1of1ForFork0_#t~post1_129|, v_~d1~0_224, v_~i1~0_221, v_~pos~0_418] AssignedVars[thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i1~0, ~pos~0, ~d1~0] and [355] L61-1-->L61-1: Formula: (let ((.cse3 (= (mod v_~d2~0_In_1 256) 0))) (let ((.cse0 (= v_~i2~0_Out_6 (+ v_~i2~0_In_1 1))) (.cse1 (< (mod v_~i2~0_In_1 4294967296) (* (mod v_~N~0_In_5 2147483648) 2))) (.cse2 (= (ite (= (ite .cse3 1 0) 0) 0 1) v_~d2~0_Out_6))) (or (and .cse0 .cse1 (= (+ v_~pos~0_Out_10 2) v_~pos~0_In_5) .cse2 .cse3) (and .cse0 .cse1 .cse2 (= (+ 2 v_~pos~0_In_5) v_~pos~0_Out_10) (not .cse3))))) InVars {~i2~0=v_~i2~0_In_1, ~pos~0=v_~pos~0_In_5, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_In_1} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_Out_2|, ~i2~0=v_~i2~0_Out_6, ~pos~0=v_~pos~0_Out_10, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_Out_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~i2~0, ~pos~0, ~d2~0] [2022-12-13 10:30:27,509 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:30:27,510 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 475 [2022-12-13 10:30:27,510 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 99 transitions, 1090 flow [2022-12-13 10:30:27,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:27,510 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:27,510 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:30:27,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 10:30:27,510 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:30:27,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:27,510 INFO L85 PathProgramCache]: Analyzing trace with hash 649848013, now seen corresponding path program 1 times [2022-12-13 10:30:27,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:27,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711286439] [2022-12-13 10:30:27,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:27,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:27,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:30:27,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:27,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711286439] [2022-12-13 10:30:27,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711286439] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:27,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:27,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:30:27,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953699935] [2022-12-13 10:30:27,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:27,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:30:27,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:27,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:30:27,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:30:27,671 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 10:30:27,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 99 transitions, 1090 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:27,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:27,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 10:30:27,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:29,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 10:30:29,179 INFO L130 PetriNetUnfolder]: 275/534 cut-off events. [2022-12-13 10:30:29,180 INFO L131 PetriNetUnfolder]: For 4146/4146 co-relation queries the response was YES. [2022-12-13 10:30:29,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3005 conditions, 534 events. 275/534 cut-off events. For 4146/4146 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2504 event pairs, 30 based on Foata normal form. 12/542 useless extension candidates. Maximal degree in co-relation 2556. Up to 453 conditions per place. [2022-12-13 10:30:29,183 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 98 selfloop transitions, 20 changer transitions 0/118 dead transitions. [2022-12-13 10:30:29,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 118 transitions, 1460 flow [2022-12-13 10:30:29,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:30:29,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:30:29,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-13 10:30:29,186 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43478260869565216 [2022-12-13 10:30:29,186 INFO L175 Difference]: Start difference. First operand has 66 places, 99 transitions, 1090 flow. Second operand 4 states and 40 transitions. [2022-12-13 10:30:29,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 118 transitions, 1460 flow [2022-12-13 10:30:29,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 118 transitions, 1431 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-13 10:30:29,198 INFO L231 Difference]: Finished difference. Result has 68 places, 104 transitions, 1179 flow [2022-12-13 10:30:29,199 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=1046, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1179, PETRI_PLACES=68, PETRI_TRANSITIONS=104} [2022-12-13 10:30:29,199 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 50 predicate places. [2022-12-13 10:30:29,199 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:29,200 INFO L89 Accepts]: Start accepts. Operand has 68 places, 104 transitions, 1179 flow [2022-12-13 10:30:29,201 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:29,201 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:29,201 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 104 transitions, 1179 flow [2022-12-13 10:30:29,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 104 transitions, 1179 flow [2022-12-13 10:30:29,223 INFO L130 PetriNetUnfolder]: 63/205 cut-off events. [2022-12-13 10:30:29,223 INFO L131 PetriNetUnfolder]: For 1386/1401 co-relation queries the response was YES. [2022-12-13 10:30:29,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1023 conditions, 205 events. 63/205 cut-off events. For 1386/1401 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1090 event pairs, 0 based on Foata normal form. 4/205 useless extension candidates. Maximal degree in co-relation 911. Up to 62 conditions per place. [2022-12-13 10:30:29,225 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 104 transitions, 1179 flow [2022-12-13 10:30:29,225 INFO L226 LiptonReduction]: Number of co-enabled transitions 302 [2022-12-13 10:30:29,226 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:29,227 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-13 10:30:29,227 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 104 transitions, 1179 flow [2022-12-13 10:30:29,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:29,227 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:29,227 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:30:29,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 10:30:29,227 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:30:29,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:29,228 INFO L85 PathProgramCache]: Analyzing trace with hash -342223369, now seen corresponding path program 1 times [2022-12-13 10:30:29,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:29,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761399327] [2022-12-13 10:30:29,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:29,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:29,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:30:29,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:29,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761399327] [2022-12-13 10:30:29,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761399327] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:30:29,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773587239] [2022-12-13 10:30:29,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:29,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:30:29,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:30:29,615 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:30:29,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 10:30:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:29,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 10:30:29,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:30:29,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:30:29,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:30:30,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:30:30,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773587239] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:30:30,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:30:30,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 6 [2022-12-13 10:30:30,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551919387] [2022-12-13 10:30:30,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:30:30,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:30:30,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:30,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:30:30,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:30:30,636 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 10:30:30,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 104 transitions, 1179 flow. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:30,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:30,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 10:30:30,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:31,027 INFO L130 PetriNetUnfolder]: 340/685 cut-off events. [2022-12-13 10:30:31,028 INFO L131 PetriNetUnfolder]: For 6115/6115 co-relation queries the response was YES. [2022-12-13 10:30:31,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3994 conditions, 685 events. 340/685 cut-off events. For 6115/6115 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3676 event pairs, 10 based on Foata normal form. 3/684 useless extension candidates. Maximal degree in co-relation 3322. Up to 318 conditions per place. [2022-12-13 10:30:31,032 INFO L137 encePairwiseOnDemand]: 9/23 looper letters, 100 selfloop transitions, 56 changer transitions 6/162 dead transitions. [2022-12-13 10:30:31,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 162 transitions, 2006 flow [2022-12-13 10:30:31,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:30:31,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:30:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 67 transitions. [2022-12-13 10:30:31,033 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3641304347826087 [2022-12-13 10:30:31,033 INFO L175 Difference]: Start difference. First operand has 68 places, 104 transitions, 1179 flow. Second operand 8 states and 67 transitions. [2022-12-13 10:30:31,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 162 transitions, 2006 flow [2022-12-13 10:30:31,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 162 transitions, 1980 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-13 10:30:31,046 INFO L231 Difference]: Finished difference. Result has 79 places, 126 transitions, 1669 flow [2022-12-13 10:30:31,046 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=1156, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1669, PETRI_PLACES=79, PETRI_TRANSITIONS=126} [2022-12-13 10:30:31,047 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 61 predicate places. [2022-12-13 10:30:31,047 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:31,047 INFO L89 Accepts]: Start accepts. Operand has 79 places, 126 transitions, 1669 flow [2022-12-13 10:30:31,048 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:31,048 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:31,048 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 126 transitions, 1669 flow [2022-12-13 10:30:31,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 126 transitions, 1669 flow [2022-12-13 10:30:31,069 INFO L130 PetriNetUnfolder]: 72/256 cut-off events. [2022-12-13 10:30:31,069 INFO L131 PetriNetUnfolder]: For 2248/2253 co-relation queries the response was YES. [2022-12-13 10:30:31,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1383 conditions, 256 events. 72/256 cut-off events. For 2248/2253 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1552 event pairs, 0 based on Foata normal form. 1/254 useless extension candidates. Maximal degree in co-relation 1236. Up to 71 conditions per place. [2022-12-13 10:30:31,072 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 126 transitions, 1669 flow [2022-12-13 10:30:31,072 INFO L226 LiptonReduction]: Number of co-enabled transitions 374 [2022-12-13 10:30:31,072 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:31,073 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-13 10:30:31,073 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 126 transitions, 1669 flow [2022-12-13 10:30:31,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:31,073 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:31,073 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:30:31,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 10:30:31,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:30:31,278 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:30:31,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:31,279 INFO L85 PathProgramCache]: Analyzing trace with hash -611596776, now seen corresponding path program 1 times [2022-12-13 10:30:31,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:31,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571761449] [2022-12-13 10:30:31,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:31,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:31,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:30:31,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:31,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571761449] [2022-12-13 10:30:31,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571761449] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:30:31,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227553560] [2022-12-13 10:30:31,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:31,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:30:31,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:30:31,441 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:30:31,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 10:30:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:31,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 10:30:31,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:30:31,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:30:31,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:30:49,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:30:49,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227553560] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:30:49,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:30:49,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-13 10:30:49,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319837445] [2022-12-13 10:30:49,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:30:49,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:30:49,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:49,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:30:49,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:30:49,007 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 10:30:49,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 126 transitions, 1669 flow. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:49,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:49,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 10:30:49,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:50,251 INFO L130 PetriNetUnfolder]: 489/995 cut-off events. [2022-12-13 10:30:50,251 INFO L131 PetriNetUnfolder]: For 14005/14005 co-relation queries the response was YES. [2022-12-13 10:30:50,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6193 conditions, 995 events. 489/995 cut-off events. For 14005/14005 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5803 event pairs, 8 based on Foata normal form. 76/1067 useless extension candidates. Maximal degree in co-relation 5702. Up to 249 conditions per place. [2022-12-13 10:30:50,258 INFO L137 encePairwiseOnDemand]: 10/23 looper letters, 156 selfloop transitions, 87 changer transitions 0/243 dead transitions. [2022-12-13 10:30:50,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 243 transitions, 3364 flow [2022-12-13 10:30:50,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 10:30:50,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 10:30:50,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 93 transitions. [2022-12-13 10:30:50,261 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3675889328063241 [2022-12-13 10:30:50,261 INFO L175 Difference]: Start difference. First operand has 79 places, 126 transitions, 1669 flow. Second operand 11 states and 93 transitions. [2022-12-13 10:30:50,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 243 transitions, 3364 flow [2022-12-13 10:30:50,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 243 transitions, 3300 flow, removed 32 selfloop flow, removed 0 redundant places. [2022-12-13 10:30:50,290 INFO L231 Difference]: Finished difference. Result has 93 places, 163 transitions, 2553 flow [2022-12-13 10:30:50,291 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=1635, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2553, PETRI_PLACES=93, PETRI_TRANSITIONS=163} [2022-12-13 10:30:50,291 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 75 predicate places. [2022-12-13 10:30:50,291 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:50,291 INFO L89 Accepts]: Start accepts. Operand has 93 places, 163 transitions, 2553 flow [2022-12-13 10:30:50,293 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:50,293 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:50,293 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 163 transitions, 2553 flow [2022-12-13 10:30:50,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 163 transitions, 2553 flow [2022-12-13 10:30:50,331 INFO L130 PetriNetUnfolder]: 103/386 cut-off events. [2022-12-13 10:30:50,331 INFO L131 PetriNetUnfolder]: For 4237/4255 co-relation queries the response was YES. [2022-12-13 10:30:50,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2255 conditions, 386 events. 103/386 cut-off events. For 4237/4255 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2686 event pairs, 0 based on Foata normal form. 4/387 useless extension candidates. Maximal degree in co-relation 2025. Up to 103 conditions per place. [2022-12-13 10:30:50,334 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 163 transitions, 2553 flow [2022-12-13 10:30:50,335 INFO L226 LiptonReduction]: Number of co-enabled transitions 528 [2022-12-13 10:30:51,049 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [385] L42-1-->L42-1: Formula: (let ((.cse4 (+ v_~pos~0_399 2)) (.cse5 (* 2 (mod v_~N~0_133 2147483648)))) (and (let ((.cse0 (= (mod v_~d2~0_212 256) 0))) (let ((.cse1 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d2~0_210)) (.cse2 (< (mod v_~i2~0_197 4294967296) .cse5)) (.cse3 (= v_~i2~0_195 (+ v_~i2~0_197 1)))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_~pos~0_399 (+ v_~pos~0_400 2))) (and (= v_~pos~0_400 .cse4) .cse1 .cse2 .cse3 (not .cse0))))) (let ((.cse6 (= (mod v_~d1~0_214 256) 0))) (let ((.cse7 (= v_~d1~0_213 (ite (= (ite .cse6 1 0) 0) 0 1))) (.cse8 (= (+ v_~i1~0_211 1) v_~i1~0_210)) (.cse9 (< (mod v_~i1~0_211 4294967296) .cse5))) (or (and (= v_~pos~0_400 (+ v_~pos~0_397 1)) .cse6 (= |v_thread1Thread1of1ForFork0_#t~post1_119| |v_thread1Thread1of1ForFork0_#t~post1_118|) .cse7 .cse8 .cse9) (and (= v_~pos~0_397 (+ v_~pos~0_400 1)) .cse7 .cse8 (not .cse6) .cse9 (= |v_thread1Thread1of1ForFork0_#t~post2_119| |v_thread1Thread1of1ForFork0_#t~post2_118|))))) (let ((.cse11 (= (mod v_~d1~0_215 256) 0))) (let ((.cse10 (= (ite (= (ite .cse11 1 0) 0) 0 1) v_~d1~0_214)) (.cse12 (= (+ v_~i1~0_212 1) v_~i1~0_211)) (.cse13 (< (mod v_~i1~0_212 4294967296) .cse5))) (or (and .cse10 (not .cse11) .cse12 .cse13 (= |v_thread1Thread1of1ForFork0_#t~post2_119| |v_thread1Thread1of1ForFork0_#t~post2_120|) (= v_~pos~0_398 (+ v_~pos~0_401 1))) (and .cse10 (= v_~pos~0_401 (+ v_~pos~0_398 1)) .cse11 (= |v_thread1Thread1of1ForFork0_#t~post1_119| |v_thread1Thread1of1ForFork0_#t~post1_120|) .cse12 .cse13)))) (let ((.cse16 (= (mod v_~d2~0_211 256) 0))) (let ((.cse14 (< (mod v_~i2~0_196 4294967296) .cse5)) (.cse15 (= (+ v_~i2~0_196 1) v_~i2~0_197)) (.cse17 (= (ite (= (ite .cse16 1 0) 0) 0 1) v_~d2~0_212))) (or (and (= v_~pos~0_398 .cse4) .cse14 .cse15 .cse16 .cse17) (and .cse14 .cse15 (not .cse16) .cse17 (= v_~pos~0_399 (+ v_~pos~0_398 2)))))))) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_120|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_120|, ~i2~0=v_~i2~0_196, ~i1~0=v_~i1~0_212, ~pos~0=v_~pos~0_401, ~N~0=v_~N~0_133, ~d1~0=v_~d1~0_215, ~d2~0=v_~d2~0_211} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_100|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_118|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_118|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_85|, ~i2~0=v_~i2~0_195, ~i1~0=v_~i1~0_210, ~pos~0=v_~pos~0_397, ~N~0=v_~N~0_133, ~d1~0=v_~d1~0_213, ~d2~0=v_~d2~0_210} AuxVars[v_~pos~0_400, v_~i2~0_197, |v_thread1Thread1of1ForFork0_#t~post1_119|, v_~pos~0_398, v_~pos~0_399, v_~i1~0_211, v_~d1~0_214, v_~d2~0_212, |v_thread1Thread1of1ForFork0_#t~post2_119|] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~i1~0, ~pos~0, ~d1~0, ~d2~0] and [355] L61-1-->L61-1: Formula: (let ((.cse3 (= (mod v_~d2~0_In_1 256) 0))) (let ((.cse0 (= v_~i2~0_Out_6 (+ v_~i2~0_In_1 1))) (.cse1 (< (mod v_~i2~0_In_1 4294967296) (* (mod v_~N~0_In_5 2147483648) 2))) (.cse2 (= (ite (= (ite .cse3 1 0) 0) 0 1) v_~d2~0_Out_6))) (or (and .cse0 .cse1 (= (+ v_~pos~0_Out_10 2) v_~pos~0_In_5) .cse2 .cse3) (and .cse0 .cse1 .cse2 (= (+ 2 v_~pos~0_In_5) v_~pos~0_Out_10) (not .cse3))))) InVars {~i2~0=v_~i2~0_In_1, ~pos~0=v_~pos~0_In_5, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_In_1} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_Out_2|, ~i2~0=v_~i2~0_Out_6, ~pos~0=v_~pos~0_Out_10, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_Out_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~i2~0, ~pos~0, ~d2~0] [2022-12-13 10:30:52,833 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:30:52,834 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2543 [2022-12-13 10:30:52,834 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 163 transitions, 2574 flow [2022-12-13 10:30:52,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:52,834 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:52,834 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:30:52,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 10:30:53,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 10:30:53,035 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:30:53,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:53,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1437854753, now seen corresponding path program 1 times [2022-12-13 10:30:53,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:53,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560293951] [2022-12-13 10:30:53,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:53,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:53,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:30:53,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:53,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560293951] [2022-12-13 10:30:53,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560293951] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:30:53,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698632852] [2022-12-13 10:30:53,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:53,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:30:53,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:30:53,272 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:30:53,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 10:30:53,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:53,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 10:30:53,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:30:53,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:30:53,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:31:05,881 WARN L233 SmtUtils]: Spent 11.18s on a formula simplification. DAG size of input: 4100 DAG size of output: 4093 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)