/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-misc-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 01:42:43,321 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 01:42:43,323 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 01:42:43,376 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 01:42:43,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 01:42:43,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 01:42:43,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 01:42:43,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 01:42:43,394 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 01:42:43,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 01:42:43,397 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 01:42:43,398 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 01:42:43,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 01:42:43,399 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 01:42:43,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 01:42:43,401 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 01:42:43,402 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 01:42:43,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 01:42:43,404 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 01:42:43,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 01:42:43,406 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 01:42:43,415 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 01:42:43,417 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 01:42:43,418 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 01:42:43,426 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 01:42:43,426 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 01:42:43,426 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 01:42:43,427 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 01:42:43,428 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 01:42:43,428 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 01:42:43,428 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 01:42:43,429 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 01:42:43,430 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 01:42:43,430 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 01:42:43,431 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 01:42:43,431 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 01:42:43,432 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 01:42:43,432 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 01:42:43,432 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 01:42:43,433 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 01:42:43,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 01:42:43,440 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-RepeatedSemanticLbe.epf [2022-12-13 01:42:43,473 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 01:42:43,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 01:42:43,475 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 01:42:43,475 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 01:42:43,476 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 01:42:43,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 01:42:43,476 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 01:42:43,477 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 01:42:43,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 01:42:43,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 01:42:43,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 01:42:43,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 01:42:43,478 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 01:42:43,478 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 01:42:43,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 01:42:43,478 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 01:42:43,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 01:42:43,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 01:42:43,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 01:42:43,479 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 01:42:43,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 01:42:43,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:42:43,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 01:42:43,479 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 01:42:43,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 01:42:43,480 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 01:42:43,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 01:42:43,480 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 01:42:43,480 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 01:42:43,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 01:42:43,821 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 01:42:43,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 01:42:43,826 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 01:42:43,826 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 01:42:43,827 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-3.wvr.c [2022-12-13 01:42:44,881 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 01:42:45,089 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 01:42:45,090 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-3.wvr.c [2022-12-13 01:42:45,097 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dff571d5c/3607b7e250b9467ab5931003eee204e8/FLAGb282dca79 [2022-12-13 01:42:45,110 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dff571d5c/3607b7e250b9467ab5931003eee204e8 [2022-12-13 01:42:45,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 01:42:45,113 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 01:42:45,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 01:42:45,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 01:42:45,116 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 01:42:45,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:42:45" (1/1) ... [2022-12-13 01:42:45,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@518d5ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:45, skipping insertion in model container [2022-12-13 01:42:45,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:42:45" (1/1) ... [2022-12-13 01:42:45,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 01:42:45,139 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 01:42:45,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:45,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:45,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:45,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:45,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:45,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:45,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:45,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:45,301 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-3.wvr.c[2410,2423] [2022-12-13 01:42:45,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:42:45,316 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 01:42:45,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:45,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:45,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:45,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:45,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:45,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:45,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:45,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:45,338 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-3.wvr.c[2410,2423] [2022-12-13 01:42:45,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:42:45,352 INFO L208 MainTranslator]: Completed translation [2022-12-13 01:42:45,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:45 WrapperNode [2022-12-13 01:42:45,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 01:42:45,354 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 01:42:45,354 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 01:42:45,354 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 01:42:45,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:45" (1/1) ... [2022-12-13 01:42:45,368 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:45" (1/1) ... [2022-12-13 01:42:45,386 INFO L138 Inliner]: procedures = 21, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2022-12-13 01:42:45,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 01:42:45,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 01:42:45,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 01:42:45,387 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 01:42:45,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:45" (1/1) ... [2022-12-13 01:42:45,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:45" (1/1) ... [2022-12-13 01:42:45,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:45" (1/1) ... [2022-12-13 01:42:45,405 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:45" (1/1) ... [2022-12-13 01:42:45,408 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:45" (1/1) ... [2022-12-13 01:42:45,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:45" (1/1) ... [2022-12-13 01:42:45,420 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:45" (1/1) ... [2022-12-13 01:42:45,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:45" (1/1) ... [2022-12-13 01:42:45,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 01:42:45,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 01:42:45,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 01:42:45,424 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 01:42:45,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:45" (1/1) ... [2022-12-13 01:42:45,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:42:45,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:42:45,455 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 01:42:45,460 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 01:42:45,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 01:42:45,486 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 01:42:45,486 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 01:42:45,486 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 01:42:45,486 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 01:42:45,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 01:42:45,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 01:42:45,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 01:42:45,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 01:42:45,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 01:42:45,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 01:42:45,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 01:42:45,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 01:42:45,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 01:42:45,488 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 01:42:45,566 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 01:42:45,568 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 01:42:45,822 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 01:42:45,843 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 01:42:45,844 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 01:42:45,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:42:45 BoogieIcfgContainer [2022-12-13 01:42:45,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 01:42:45,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 01:42:45,861 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 01:42:45,864 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 01:42:45,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:42:45" (1/3) ... [2022-12-13 01:42:45,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6db0c2cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:42:45, skipping insertion in model container [2022-12-13 01:42:45,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:45" (2/3) ... [2022-12-13 01:42:45,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6db0c2cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:42:45, skipping insertion in model container [2022-12-13 01:42:45,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:42:45" (3/3) ... [2022-12-13 01:42:45,867 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-3.wvr.c [2022-12-13 01:42:45,894 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 01:42:45,894 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 01:42:45,894 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 01:42:45,994 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 01:42:46,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 90 transitions, 196 flow [2022-12-13 01:42:46,084 INFO L130 PetriNetUnfolder]: 11/88 cut-off events. [2022-12-13 01:42:46,085 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 01:42:46,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 88 events. 11/88 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 91 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 48. Up to 4 conditions per place. [2022-12-13 01:42:46,089 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 90 transitions, 196 flow [2022-12-13 01:42:46,093 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 80 transitions, 172 flow [2022-12-13 01:42:46,094 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:46,109 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 80 transitions, 172 flow [2022-12-13 01:42:46,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 80 transitions, 172 flow [2022-12-13 01:42:46,143 INFO L130 PetriNetUnfolder]: 11/80 cut-off events. [2022-12-13 01:42:46,143 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 01:42:46,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 80 events. 11/80 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 90 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 48. Up to 4 conditions per place. [2022-12-13 01:42:46,146 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 80 transitions, 172 flow [2022-12-13 01:42:46,146 INFO L226 LiptonReduction]: Number of co-enabled transitions 1088 [2022-12-13 01:42:48,836 INFO L241 LiptonReduction]: Total number of compositions: 65 [2022-12-13 01:42:48,850 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 01:42:48,857 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;@55302fce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 01:42:48,857 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 01:42:48,865 INFO L130 PetriNetUnfolder]: 2/12 cut-off events. [2022-12-13 01:42:48,865 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 01:42:48,865 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:48,866 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:42:48,866 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 01:42:48,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:48,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1161558226, now seen corresponding path program 1 times [2022-12-13 01:42:48,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:48,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055397760] [2022-12-13 01:42:48,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:48,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:49,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:42:49,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:49,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055397760] [2022-12-13 01:42:49,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055397760] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:49,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:42:49,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 01:42:49,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945775631] [2022-12-13 01:42:49,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:49,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:42:49,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:49,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:42:49,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:42:49,199 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-13 01:42:49,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 13 transitions, 38 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 01:42:49,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:49,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-13 01:42:49,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:49,260 INFO L130 PetriNetUnfolder]: 29/54 cut-off events. [2022-12-13 01:42:49,260 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-13 01:42:49,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 54 events. 29/54 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 93 event pairs, 1 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 90. Up to 45 conditions per place. [2022-12-13 01:42:49,263 INFO L137 encePairwiseOnDemand]: 10/13 looper letters, 17 selfloop transitions, 2 changer transitions 0/19 dead transitions. [2022-12-13 01:42:49,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 19 transitions, 91 flow [2022-12-13 01:42:49,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:42:49,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:42:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2022-12-13 01:42:49,273 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2022-12-13 01:42:49,275 INFO L175 Difference]: Start difference. First operand has 18 places, 13 transitions, 38 flow. Second operand 3 states and 20 transitions. [2022-12-13 01:42:49,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 19 transitions, 91 flow [2022-12-13 01:42:49,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 19 transitions, 81 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 01:42:49,281 INFO L231 Difference]: Finished difference. Result has 17 places, 14 transitions, 42 flow [2022-12-13 01:42:49,282 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=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=17, PETRI_TRANSITIONS=14} [2022-12-13 01:42:49,285 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, -1 predicate places. [2022-12-13 01:42:49,285 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:49,286 INFO L89 Accepts]: Start accepts. Operand has 17 places, 14 transitions, 42 flow [2022-12-13 01:42:49,289 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:49,289 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:49,289 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 17 places, 14 transitions, 42 flow [2022-12-13 01:42:49,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 17 places, 14 transitions, 42 flow [2022-12-13 01:42:49,297 INFO L130 PetriNetUnfolder]: 2/14 cut-off events. [2022-12-13 01:42:49,297 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:42:49,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 14 events. 2/14 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 6 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 14. Up to 4 conditions per place. [2022-12-13 01:42:49,299 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 17 places, 14 transitions, 42 flow [2022-12-13 01:42:49,300 INFO L226 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-13 01:42:49,300 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:42:49,301 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 01:42:49,302 INFO L495 AbstractCegarLoop]: Abstraction has has 17 places, 14 transitions, 42 flow [2022-12-13 01:42:49,302 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 01:42:49,302 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:49,302 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:42:49,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 01:42:49,303 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 01:42:49,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:49,303 INFO L85 PathProgramCache]: Analyzing trace with hash -824867760, now seen corresponding path program 1 times [2022-12-13 01:42:49,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:49,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803027163] [2022-12-13 01:42:49,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:49,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:49,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:42:49,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:49,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803027163] [2022-12-13 01:42:49,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803027163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:49,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:42:49,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 01:42:49,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891728713] [2022-12-13 01:42:49,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:49,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:42:49,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:49,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:42:49,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:42:49,404 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-13 01:42:49,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 14 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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 01:42:49,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:49,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-13 01:42:49,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:49,454 INFO L130 PetriNetUnfolder]: 40/73 cut-off events. [2022-12-13 01:42:49,454 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-13 01:42:49,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 73 events. 40/73 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 140 event pairs, 6 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 112. Up to 49 conditions per place. [2022-12-13 01:42:49,455 INFO L137 encePairwiseOnDemand]: 10/13 looper letters, 19 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2022-12-13 01:42:49,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 21 transitions, 106 flow [2022-12-13 01:42:49,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:42:49,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:42:49,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2022-12-13 01:42:49,456 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2022-12-13 01:42:49,457 INFO L175 Difference]: Start difference. First operand has 17 places, 14 transitions, 42 flow. Second operand 3 states and 20 transitions. [2022-12-13 01:42:49,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 21 transitions, 106 flow [2022-12-13 01:42:49,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 21 transitions, 103 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 01:42:49,458 INFO L231 Difference]: Finished difference. Result has 19 places, 15 transitions, 52 flow [2022-12-13 01:42:49,458 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=19, PETRI_TRANSITIONS=15} [2022-12-13 01:42:49,459 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 1 predicate places. [2022-12-13 01:42:49,459 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:49,459 INFO L89 Accepts]: Start accepts. Operand has 19 places, 15 transitions, 52 flow [2022-12-13 01:42:49,460 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:49,460 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:49,460 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 15 transitions, 52 flow [2022-12-13 01:42:49,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 15 transitions, 52 flow [2022-12-13 01:42:49,463 INFO L130 PetriNetUnfolder]: 2/15 cut-off events. [2022-12-13 01:42:49,464 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:42:49,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 15 events. 2/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 10 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 15. Up to 4 conditions per place. [2022-12-13 01:42:49,464 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 19 places, 15 transitions, 52 flow [2022-12-13 01:42:49,464 INFO L226 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-13 01:42:49,465 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:42:49,466 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 01:42:49,466 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 15 transitions, 52 flow [2022-12-13 01:42:49,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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 01:42:49,466 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:49,467 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:42:49,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 01:42:49,467 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 01:42:49,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:49,467 INFO L85 PathProgramCache]: Analyzing trace with hash 596881523, now seen corresponding path program 1 times [2022-12-13 01:42:49,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:49,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342906733] [2022-12-13 01:42:49,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:49,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:49,730 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 01:42:49,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:49,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342906733] [2022-12-13 01:42:49,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342906733] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:42:49,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386360577] [2022-12-13 01:42:49,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:49,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:42:49,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:42:49,735 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 01:42:49,766 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 01:42:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:49,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 01:42:49,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:42:49,956 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 01:42:49,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:42:50,280 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 01:42:50,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386360577] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:42:50,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:42:50,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 3] total 8 [2022-12-13 01:42:50,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451862560] [2022-12-13 01:42:50,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:42:50,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:42:50,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:50,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:42:50,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:42:50,283 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-13 01:42:50,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 15 transitions, 52 flow. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 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 01:42:50,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:50,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-13 01:42:50,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:50,488 INFO L130 PetriNetUnfolder]: 65/116 cut-off events. [2022-12-13 01:42:50,488 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-13 01:42:50,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 116 events. 65/116 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 264 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 100. Up to 41 conditions per place. [2022-12-13 01:42:50,490 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 40 selfloop transitions, 18 changer transitions 0/58 dead transitions. [2022-12-13 01:42:50,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 58 transitions, 305 flow [2022-12-13 01:42:50,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 01:42:50,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 01:42:50,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 65 transitions. [2022-12-13 01:42:50,505 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2022-12-13 01:42:50,505 INFO L175 Difference]: Start difference. First operand has 19 places, 15 transitions, 52 flow. Second operand 13 states and 65 transitions. [2022-12-13 01:42:50,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 58 transitions, 305 flow [2022-12-13 01:42:50,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 58 transitions, 301 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 01:42:50,508 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 184 flow [2022-12-13 01:42:50,508 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=184, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2022-12-13 01:42:50,508 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 18 predicate places. [2022-12-13 01:42:50,508 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:50,509 INFO L89 Accepts]: Start accepts. Operand has 36 places, 29 transitions, 184 flow [2022-12-13 01:42:50,510 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:50,510 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:50,510 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 184 flow [2022-12-13 01:42:50,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 184 flow [2022-12-13 01:42:50,518 INFO L130 PetriNetUnfolder]: 14/42 cut-off events. [2022-12-13 01:42:50,518 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-12-13 01:42:50,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 42 events. 14/42 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 88 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 125. Up to 16 conditions per place. [2022-12-13 01:42:50,525 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 184 flow [2022-12-13 01:42:50,525 INFO L226 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-13 01:42:51,338 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_3 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_3} OutVars{~g2~0=v_~g2~0_In_3, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 01:42:52,407 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_3 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_3} OutVars{~g2~0=v_~g2~0_In_3, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [347] L53-1-->L53-1: Formula: (let ((.cse7 (= (mod v_~d1~0_71 256) 0)) (.cse8 (+ v_~pos~0_85 1)) (.cse4 (= (mod v_~d1~0_70 256) 0))) (and (let ((.cse1 (= v_~g1~0_47 v_~g1~0_46)) (.cse0 (= (ite (= 0 (ite .cse4 1 0)) 0 1) v_~d1~0_69)) (.cse2 (= (mod v_~d1~0_69 256) 0)) (.cse3 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse3) (and (= v_~g1~0_46 0) .cse0 (not .cse2) (not .cse3)))) (let ((.cse5 (= v_~g1~0_48 v_~g1~0_47)) (.cse6 (= v_~d1~0_70 (ite (= (ite .cse7 1 0) 0) 0 1)))) (or (and (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_39| 256) 0) .cse5 .cse6) (and .cse4 .cse5 .cse6))) (or (and (= (+ v_~pos~0_86 1) v_~pos~0_85) (not .cse7) (= |v_thread1Thread1of1ForFork0_#t~post2_25| |v_thread1Thread1of1ForFork0_#t~post2_24|)) (and (= .cse8 v_~pos~0_86) (= |v_thread1Thread1of1ForFork0_#t~post1_25| |v_thread1Thread1of1ForFork0_#t~post1_24|) .cse7)) (let ((.cse9 (not (= (mod v_~g1~0_47 256) 0)))) (or (and (= .cse8 v_~pos~0_84) .cse9 (= |v_thread1Thread1of1ForFork0_#t~post2_24| |v_thread1Thread1of1ForFork0_#t~post2_23|) (not .cse4)) (and .cse9 .cse4 (= (+ v_~pos~0_84 1) v_~pos~0_85) (= |v_thread1Thread1of1ForFork0_#t~post1_24| |v_thread1Thread1of1ForFork0_#t~post1_23|)))))) InVars {~g1~0=v_~g1~0_48, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_39|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_25|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_25|, ~pos~0=v_~pos~0_86, ~d1~0=v_~d1~0_71} OutVars{~g1~0=v_~g1~0_46, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_23|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_23|, ~pos~0=v_~pos~0_84, ~d1~0=v_~d1~0_69} AuxVars[v_~pos~0_85, v_~g1~0_47, |v_thread1Thread1of1ForFork0_#t~post1_24|, v_~d1~0_70, |v_thread1Thread1of1ForFork0_#t~nondet3_38|, |v_thread1Thread1of1ForFork0_#t~post2_24|] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 01:42:53,751 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [345] L75-1-->L75-1: Formula: (let ((.cse0 (= (mod v_~d2~0_58 256) 0))) (and (let ((.cse1 (not (= (mod v_~g2~0_47 256) 0)))) (or (and .cse0 (= (+ 2 v_~pos~0_77) v_~pos~0_78) .cse1) (and (= (+ 2 v_~pos~0_78) v_~pos~0_77) .cse1 (not .cse0)))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0)) (.cse3 (= v_~d2~0_57 (ite (= 0 (ite .cse0 1 0)) 0 1))) (.cse4 (= v_~g2~0_46 v_~g2~0_47)) (.cse5 (= (mod v_~d2~0_57 256) 0))) (or (and .cse2 .cse3 .cse4) (and (= v_~g2~0_46 0) .cse3 (not .cse2) (not .cse5)) (and .cse3 .cse4 .cse5))))) InVars {~g2~0=v_~g2~0_47, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_78, ~d2~0=v_~d2~0_58} OutVars{~g2~0=v_~g2~0_46, ~pos~0=v_~pos~0_77, ~d2~0=v_~d2~0_57} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] and [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 01:42:54,268 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [345] L75-1-->L75-1: Formula: (let ((.cse0 (= (mod v_~d2~0_58 256) 0))) (and (let ((.cse1 (not (= (mod v_~g2~0_47 256) 0)))) (or (and .cse0 (= (+ 2 v_~pos~0_77) v_~pos~0_78) .cse1) (and (= (+ 2 v_~pos~0_78) v_~pos~0_77) .cse1 (not .cse0)))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0)) (.cse3 (= v_~d2~0_57 (ite (= 0 (ite .cse0 1 0)) 0 1))) (.cse4 (= v_~g2~0_46 v_~g2~0_47)) (.cse5 (= (mod v_~d2~0_57 256) 0))) (or (and .cse2 .cse3 .cse4) (and (= v_~g2~0_46 0) .cse3 (not .cse2) (not .cse5)) (and .cse3 .cse4 .cse5))))) InVars {~g2~0=v_~g2~0_47, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_78, ~d2~0=v_~d2~0_58} OutVars{~g2~0=v_~g2~0_46, ~pos~0=v_~pos~0_77, ~d2~0=v_~d2~0_57} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 01:42:55,369 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 01:42:55,370 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4862 [2022-12-13 01:42:55,370 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 187 flow [2022-12-13 01:42:55,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 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 01:42:55,371 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:55,371 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:42:55,379 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 01:42:55,576 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 01:42:55,577 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 01:42:55,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:55,577 INFO L85 PathProgramCache]: Analyzing trace with hash -124370473, now seen corresponding path program 1 times [2022-12-13 01:42:55,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:55,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855619558] [2022-12-13 01:42:55,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:55,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:56,201 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 01:42:56,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:56,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855619558] [2022-12-13 01:42:56,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855619558] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:42:56,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651113636] [2022-12-13 01:42:56,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:56,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:42:56,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:42:56,207 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 01:42:56,209 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 01:42:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:56,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 01:42:56,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:42:56,491 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 01:42:56,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:42:56,902 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 01:42:56,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651113636] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:42:56,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:42:56,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 10 [2022-12-13 01:42:56,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543394809] [2022-12-13 01:42:56,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:42:56,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 01:42:56,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:56,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 01:42:56,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2022-12-13 01:42:56,905 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 01:42:56,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 187 flow. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 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 01:42:56,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:56,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 01:42:56,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:57,225 INFO L130 PetriNetUnfolder]: 138/243 cut-off events. [2022-12-13 01:42:57,226 INFO L131 PetriNetUnfolder]: For 461/461 co-relation queries the response was YES. [2022-12-13 01:42:57,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1166 conditions, 243 events. 138/243 cut-off events. For 461/461 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 803 event pairs, 0 based on Foata normal form. 2/215 useless extension candidates. Maximal degree in co-relation 515. Up to 111 conditions per place. [2022-12-13 01:42:57,229 INFO L137 encePairwiseOnDemand]: 8/20 looper letters, 48 selfloop transitions, 31 changer transitions 6/85 dead transitions. [2022-12-13 01:42:57,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 85 transitions, 721 flow [2022-12-13 01:42:57,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 01:42:57,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 01:42:57,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2022-12-13 01:42:57,233 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2022-12-13 01:42:57,233 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 187 flow. Second operand 11 states and 80 transitions. [2022-12-13 01:42:57,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 85 transitions, 721 flow [2022-12-13 01:42:57,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 85 transitions, 573 flow, removed 65 selfloop flow, removed 4 redundant places. [2022-12-13 01:42:57,243 INFO L231 Difference]: Finished difference. Result has 41 places, 47 transitions, 360 flow [2022-12-13 01:42:57,243 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=360, PETRI_PLACES=41, PETRI_TRANSITIONS=47} [2022-12-13 01:42:57,245 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 23 predicate places. [2022-12-13 01:42:57,245 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:57,245 INFO L89 Accepts]: Start accepts. Operand has 41 places, 47 transitions, 360 flow [2022-12-13 01:42:57,248 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:57,248 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:57,250 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 47 transitions, 360 flow [2022-12-13 01:42:57,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 47 transitions, 360 flow [2022-12-13 01:42:57,263 INFO L130 PetriNetUnfolder]: 30/89 cut-off events. [2022-12-13 01:42:57,264 INFO L131 PetriNetUnfolder]: For 112/116 co-relation queries the response was YES. [2022-12-13 01:42:57,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 89 events. 30/89 cut-off events. For 112/116 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 316 event pairs, 1 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 283. Up to 36 conditions per place. [2022-12-13 01:42:57,266 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 47 transitions, 360 flow [2022-12-13 01:42:57,267 INFO L226 LiptonReduction]: Number of co-enabled transitions 152 [2022-12-13 01:42:57,961 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [345] L75-1-->L75-1: Formula: (let ((.cse0 (= (mod v_~d2~0_58 256) 0))) (and (let ((.cse1 (not (= (mod v_~g2~0_47 256) 0)))) (or (and .cse0 (= (+ 2 v_~pos~0_77) v_~pos~0_78) .cse1) (and (= (+ 2 v_~pos~0_78) v_~pos~0_77) .cse1 (not .cse0)))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0)) (.cse3 (= v_~d2~0_57 (ite (= 0 (ite .cse0 1 0)) 0 1))) (.cse4 (= v_~g2~0_46 v_~g2~0_47)) (.cse5 (= (mod v_~d2~0_57 256) 0))) (or (and .cse2 .cse3 .cse4) (and (= v_~g2~0_46 0) .cse3 (not .cse2) (not .cse5)) (and .cse3 .cse4 .cse5))))) InVars {~g2~0=v_~g2~0_47, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_78, ~d2~0=v_~d2~0_58} OutVars{~g2~0=v_~g2~0_46, ~pos~0=v_~pos~0_77, ~d2~0=v_~d2~0_57} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 01:42:58,462 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [348] L75-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_76 256) 0))) (and (= |v_thread2Thread1of1ForFork1_#res.offset_13| 0) (let ((.cse0 (= v_~g1~0_53 v_~g1~0_52)) (.cse3 (= (mod v_~d1~0_75 256) 0)) (.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_44| 256) 0)) (.cse2 (= v_~d1~0_75 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse3) (and (not .cse3) (not .cse1) (= v_~g1~0_52 0) .cse2))) (= (mod v_~g2~0_52 256) 0) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (not .cse4) (= (+ v_~pos~0_91 1) v_~pos~0_90) (= |v_thread1Thread1of1ForFork0_#t~post2_30| |v_thread1Thread1of1ForFork0_#t~post2_29|) .cse5) (and (= (+ v_~pos~0_90 1) v_~pos~0_91) (= |v_thread1Thread1of1ForFork0_#t~post1_29| |v_thread1Thread1of1ForFork0_#t~post1_30|) .cse4 .cse5))) (= |v_thread2Thread1of1ForFork1_#res.base_13| 0))) InVars {~g2~0=v_~g2~0_52, ~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_44|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_30|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_30|, ~pos~0=v_~pos~0_91, ~d1~0=v_~d1~0_76} OutVars{~g2~0=v_~g2~0_52, ~g1~0=v_~g1~0_52, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_13|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_29|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_29|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_13|, ~pos~0=v_~pos~0_90, ~d1~0=v_~d1~0_75} AuxVars[] AssignedVars[~g1~0, thread2Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork1_#res.base, ~pos~0, ~d1~0] [2022-12-13 01:42:59,125 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_3 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_3} OutVars{~g2~0=v_~g2~0_In_3, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 01:43:02,961 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [353] L75-1-->L75-1: Formula: (let ((.cse2 (+ v_~pos~0_117 2)) (.cse1 (= (mod v_~d2~0_77 256) 0)) (.cse3 (= (mod v_~d2~0_78 256) 0))) (and (let ((.cse0 (not (= (mod v_~g2~0_70 256) 0)))) (or (and (= v_~pos~0_117 (+ v_~pos~0_116 2)) .cse0 .cse1) (and (not .cse1) (= v_~pos~0_116 .cse2) .cse0))) (or (and (not .cse3) (= v_~pos~0_117 (+ v_~pos~0_118 2))) (and .cse3 (= v_~pos~0_118 .cse2))) (let ((.cse5 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_50| 256) 0)) (.cse7 (= (mod v_~d2~0_76 256) 0)) (.cse4 (= (ite (= (ite .cse1 1 0) 0) 0 1) v_~d2~0_76)) (.cse6 (= v_~g2~0_69 v_~g2~0_70))) (or (and .cse4 .cse5 .cse6) (and (not .cse5) .cse4 (= v_~g2~0_69 0) (not .cse7)) (and .cse7 .cse4 .cse6))) (let ((.cse8 (= v_~g2~0_71 v_~g2~0_70)) (.cse9 (= v_~d2~0_77 (ite (= (ite .cse3 1 0) 0) 0 1)))) (or (and .cse8 .cse1 .cse9) (and .cse8 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_51| 256) 0) .cse9))))) InVars {~g2~0=v_~g2~0_71, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_51|, ~pos~0=v_~pos~0_118, ~d2~0=v_~d2~0_78} OutVars{~g2~0=v_~g2~0_69, ~pos~0=v_~pos~0_116, ~d2~0=v_~d2~0_76} AuxVars[|v_thread2Thread1of1ForFork1_#t~nondet4_50|, v_~g2~0_70, v_~pos~0_117, v_~d2~0_77] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] and [359] L53-1-->L53-1: Formula: (let ((.cse2 (= (mod v_~d1~0_111 256) 0)) (.cse3 (= (mod v_~d1~0_112 256) 0)) (.cse8 (+ v_~pos~0_151 1))) (and (let ((.cse0 (= v_~g1~0_89 v_~g1~0_88)) (.cse1 (= v_~d1~0_111 (ite (= (ite .cse3 1 0) 0) 0 1)))) (or (and .cse0 .cse1 .cse2) (and (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_80| 256) 0) .cse0 .cse1))) (let ((.cse5 (= (mod v_~d1~0_110 256) 0)) (.cse6 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_79| 256) 0)) (.cse7 (= v_~g1~0_88 v_~g1~0_87)) (.cse4 (= v_~d1~0_110 (ite (= (ite .cse2 1 0) 0) 0 1)))) (or (and .cse4 (not .cse5) (not .cse6) (= v_~g1~0_87 0)) (and .cse7 .cse4 .cse5) (and .cse6 .cse7 .cse4))) (or (and (not (= (mod v_~g1~0_88 256) 0)) (not .cse2) (= v_~pos~0_150 .cse8) (= |v_thread1Thread1of1ForFork0_#t~post2_67| |v_thread1Thread1of1ForFork0_#t~post2_66|)) (and (= |v_thread1Thread1of1ForFork0_#t~post1_67| |v_thread1Thread1of1ForFork0_#t~post1_66|) (= v_~pos~0_151 (+ v_~pos~0_150 1)) .cse2)) (or (and (not .cse3) (not (= (mod v_~g1~0_89 256) 0)) (= v_~pos~0_151 (+ v_~pos~0_152 1)) (= |v_thread1Thread1of1ForFork0_#t~post2_68| |v_thread1Thread1of1ForFork0_#t~post2_67|)) (and .cse3 (= v_~pos~0_152 .cse8) (= |v_thread1Thread1of1ForFork0_#t~post1_68| |v_thread1Thread1of1ForFork0_#t~post1_67|))))) InVars {~g1~0=v_~g1~0_89, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_80|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_68|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_68|, ~pos~0=v_~pos~0_152, ~d1~0=v_~d1~0_112} OutVars{~g1~0=v_~g1~0_87, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_66|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_66|, ~pos~0=v_~pos~0_150, ~d1~0=v_~d1~0_110} AuxVars[v_~g1~0_88, v_~pos~0_151, v_~d1~0_111, |v_thread1Thread1of1ForFork0_#t~nondet3_79|, |v_thread1Thread1of1ForFork0_#t~post1_67|, |v_thread1Thread1of1ForFork0_#t~post2_67|] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 01:43:04,085 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [353] L75-1-->L75-1: Formula: (let ((.cse2 (+ v_~pos~0_117 2)) (.cse1 (= (mod v_~d2~0_77 256) 0)) (.cse3 (= (mod v_~d2~0_78 256) 0))) (and (let ((.cse0 (not (= (mod v_~g2~0_70 256) 0)))) (or (and (= v_~pos~0_117 (+ v_~pos~0_116 2)) .cse0 .cse1) (and (not .cse1) (= v_~pos~0_116 .cse2) .cse0))) (or (and (not .cse3) (= v_~pos~0_117 (+ v_~pos~0_118 2))) (and .cse3 (= v_~pos~0_118 .cse2))) (let ((.cse5 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_50| 256) 0)) (.cse7 (= (mod v_~d2~0_76 256) 0)) (.cse4 (= (ite (= (ite .cse1 1 0) 0) 0 1) v_~d2~0_76)) (.cse6 (= v_~g2~0_69 v_~g2~0_70))) (or (and .cse4 .cse5 .cse6) (and (not .cse5) .cse4 (= v_~g2~0_69 0) (not .cse7)) (and .cse7 .cse4 .cse6))) (let ((.cse8 (= v_~g2~0_71 v_~g2~0_70)) (.cse9 (= v_~d2~0_77 (ite (= (ite .cse3 1 0) 0) 0 1)))) (or (and .cse8 .cse1 .cse9) (and .cse8 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_51| 256) 0) .cse9))))) InVars {~g2~0=v_~g2~0_71, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_51|, ~pos~0=v_~pos~0_118, ~d2~0=v_~d2~0_78} OutVars{~g2~0=v_~g2~0_69, ~pos~0=v_~pos~0_116, ~d2~0=v_~d2~0_76} AuxVars[|v_thread2Thread1of1ForFork1_#t~nondet4_50|, v_~g2~0_70, v_~pos~0_117, v_~d2~0_77] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] and [360] L53-1-->L75-1: Formula: (let ((.cse4 (= (mod v_~d2~0_96 256) 0)) (.cse6 (= (mod v_~d1~0_117 256) 0))) (and (let ((.cse1 (= (mod v_~d2~0_95 256) 0)) (.cse3 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_69| 256) 0)) (.cse0 (= v_~d2~0_95 (ite (= (ite .cse4 1 0) 0) 0 1))) (.cse2 (= v_~g2~0_89 v_~g2~0_88))) (or (and .cse0 .cse1 .cse2) (and (not .cse1) .cse0 (not .cse3) (= v_~g2~0_88 0)) (and .cse3 .cse0 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_94 256) 0)))) (or (and .cse5 .cse6 (= v_~pos~0_158 (+ v_~pos~0_157 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_73| |v_thread1Thread1of1ForFork0_#t~post1_72|)) (and .cse5 (= v_~pos~0_157 (+ v_~pos~0_158 1)) (not .cse6) (= |v_thread1Thread1of1ForFork0_#t~post2_73| |v_thread1Thread1of1ForFork0_#t~post2_72|)))) (let ((.cse7 (not (= (mod v_~g2~0_89 256) 0)))) (or (and (not .cse4) (= v_~pos~0_156 (+ v_~pos~0_157 2)) .cse7) (and (= v_~pos~0_157 (+ v_~pos~0_156 2)) .cse4 .cse7))) (let ((.cse10 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_85| 256) 0)) (.cse8 (= (ite (= (ite .cse6 1 0) 0) 0 1) v_~d1~0_116)) (.cse11 (= (mod v_~d1~0_116 256) 0)) (.cse9 (= v_~g1~0_94 v_~g1~0_93))) (or (and .cse8 .cse9 .cse10) (and .cse8 (= v_~g1~0_93 0) (not .cse11) (not .cse10)) (and .cse8 .cse11 .cse9))))) InVars {~g2~0=v_~g2~0_89, ~g1~0=v_~g1~0_94, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_85|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_73|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_73|, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_69|, ~pos~0=v_~pos~0_158, ~d2~0=v_~d2~0_96, ~d1~0=v_~d1~0_117} OutVars{~g2~0=v_~g2~0_88, ~g1~0=v_~g1~0_93, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_72|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_72|, ~pos~0=v_~pos~0_156, ~d2~0=v_~d2~0_95, ~d1~0=v_~d1~0_116} AuxVars[v_~pos~0_157] AssignedVars[~g2~0, ~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0, ~d1~0] [2022-12-13 01:43:05,668 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [353] L75-1-->L75-1: Formula: (let ((.cse2 (+ v_~pos~0_117 2)) (.cse1 (= (mod v_~d2~0_77 256) 0)) (.cse3 (= (mod v_~d2~0_78 256) 0))) (and (let ((.cse0 (not (= (mod v_~g2~0_70 256) 0)))) (or (and (= v_~pos~0_117 (+ v_~pos~0_116 2)) .cse0 .cse1) (and (not .cse1) (= v_~pos~0_116 .cse2) .cse0))) (or (and (not .cse3) (= v_~pos~0_117 (+ v_~pos~0_118 2))) (and .cse3 (= v_~pos~0_118 .cse2))) (let ((.cse5 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_50| 256) 0)) (.cse7 (= (mod v_~d2~0_76 256) 0)) (.cse4 (= (ite (= (ite .cse1 1 0) 0) 0 1) v_~d2~0_76)) (.cse6 (= v_~g2~0_69 v_~g2~0_70))) (or (and .cse4 .cse5 .cse6) (and (not .cse5) .cse4 (= v_~g2~0_69 0) (not .cse7)) (and .cse7 .cse4 .cse6))) (let ((.cse8 (= v_~g2~0_71 v_~g2~0_70)) (.cse9 (= v_~d2~0_77 (ite (= (ite .cse3 1 0) 0) 0 1)))) (or (and .cse8 .cse1 .cse9) (and .cse8 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_51| 256) 0) .cse9))))) InVars {~g2~0=v_~g2~0_71, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_51|, ~pos~0=v_~pos~0_118, ~d2~0=v_~d2~0_78} OutVars{~g2~0=v_~g2~0_69, ~pos~0=v_~pos~0_116, ~d2~0=v_~d2~0_76} AuxVars[|v_thread2Thread1of1ForFork1_#t~nondet4_50|, v_~g2~0_70, v_~pos~0_117, v_~d2~0_77] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] and [362] L53-1-->L53-1: Formula: (let ((.cse6 (+ v_~pos~0_163 1)) (.cse4 (= (mod v_~d1~0_121 256) 0)) (.cse5 (= (mod v_~d1~0_122 256) 0))) (and (let ((.cse0 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_89| 256) 0)) (.cse3 (= (mod v_~d1~0_120 256) 0)) (.cse1 (= v_~g1~0_98 v_~g1~0_97)) (.cse2 (= (ite (= (ite .cse4 1 0) 0) 0 1) v_~d1~0_120))) (or (and .cse0 .cse1 .cse2) (and (not .cse0) .cse2 (not .cse3) (= v_~g1~0_97 0)) (and .cse3 .cse1 .cse2))) (= (mod v_~g2~0_92 256) 0) (or (and .cse5 (= v_~pos~0_164 .cse6) (= |v_thread1Thread1of1ForFork0_#t~post1_78| |v_thread1Thread1of1ForFork0_#t~post1_77|)) (and (not .cse5) (= v_~pos~0_163 (+ v_~pos~0_164 1)) (= |v_thread1Thread1of1ForFork0_#t~post2_78| |v_thread1Thread1of1ForFork0_#t~post2_77|))) (let ((.cse7 (not (= (mod v_~g1~0_98 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_77| |v_thread1Thread1of1ForFork0_#t~post1_76|) .cse7 .cse4 (= v_~pos~0_163 (+ v_~pos~0_162 1))) (and (not .cse4) .cse7 (= v_~pos~0_162 .cse6) (= |v_thread1Thread1of1ForFork0_#t~post2_77| |v_thread1Thread1of1ForFork0_#t~post2_76|)))) (= |v_thread2Thread1of1ForFork1_#res.base_19| 0) (let ((.cse8 (= v_~g1~0_99 v_~g1~0_98)) (.cse9 (= v_~d1~0_121 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse8 .cse9 .cse4) (and .cse8 .cse9 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_90| 256) 0)))) (= |v_thread2Thread1of1ForFork1_#res.offset_19| 0))) InVars {~g2~0=v_~g2~0_92, ~g1~0=v_~g1~0_99, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_90|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_78|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_78|, ~pos~0=v_~pos~0_164, ~d1~0=v_~d1~0_122} OutVars{~g2~0=v_~g2~0_92, ~g1~0=v_~g1~0_97, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_19|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_76|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_76|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_19|, ~pos~0=v_~pos~0_162, ~d1~0=v_~d1~0_120} AuxVars[|v_thread1Thread1of1ForFork0_#t~nondet3_89|, v_~pos~0_163, v_~d1~0_121, v_~g1~0_98, |v_thread1Thread1of1ForFork0_#t~post2_77|, |v_thread1Thread1of1ForFork0_#t~post1_77|] AssignedVars[~g1~0, thread2Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork1_#res.base, ~pos~0, ~d1~0] [2022-12-13 01:43:06,778 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [353] L75-1-->L75-1: Formula: (let ((.cse2 (+ v_~pos~0_117 2)) (.cse1 (= (mod v_~d2~0_77 256) 0)) (.cse3 (= (mod v_~d2~0_78 256) 0))) (and (let ((.cse0 (not (= (mod v_~g2~0_70 256) 0)))) (or (and (= v_~pos~0_117 (+ v_~pos~0_116 2)) .cse0 .cse1) (and (not .cse1) (= v_~pos~0_116 .cse2) .cse0))) (or (and (not .cse3) (= v_~pos~0_117 (+ v_~pos~0_118 2))) (and .cse3 (= v_~pos~0_118 .cse2))) (let ((.cse5 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_50| 256) 0)) (.cse7 (= (mod v_~d2~0_76 256) 0)) (.cse4 (= (ite (= (ite .cse1 1 0) 0) 0 1) v_~d2~0_76)) (.cse6 (= v_~g2~0_69 v_~g2~0_70))) (or (and .cse4 .cse5 .cse6) (and (not .cse5) .cse4 (= v_~g2~0_69 0) (not .cse7)) (and .cse7 .cse4 .cse6))) (let ((.cse8 (= v_~g2~0_71 v_~g2~0_70)) (.cse9 (= v_~d2~0_77 (ite (= (ite .cse3 1 0) 0) 0 1)))) (or (and .cse8 .cse1 .cse9) (and .cse8 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_51| 256) 0) .cse9))))) InVars {~g2~0=v_~g2~0_71, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_51|, ~pos~0=v_~pos~0_118, ~d2~0=v_~d2~0_78} OutVars{~g2~0=v_~g2~0_69, ~pos~0=v_~pos~0_116, ~d2~0=v_~d2~0_76} AuxVars[|v_thread2Thread1of1ForFork1_#t~nondet4_50|, v_~g2~0_70, v_~pos~0_117, v_~d2~0_77] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] and [365] L53-1-->L53-1: Formula: (let ((.cse5 (+ v_~pos~0_176 1)) (.cse3 (= (mod v_~d1~0_133 256) 0)) (.cse1 (= (mod v_~d1~0_134 256) 0)) (.cse4 (+ v_~pos~0_174 1)) (.cse8 (= (mod v_~d1~0_132 256) 0))) (and (let ((.cse0 (= (ite (= (ite .cse3 1 0) 0) 0 1) v_~d1~0_134)) (.cse2 (= v_~g1~0_111 v_~g1~0_110))) (or (and .cse0 .cse1 .cse2) (and .cse0 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_102| 256) 0) .cse2))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_88| |v_thread1Thread1of1ForFork0_#t~post1_90|) (= v_~pos~0_176 .cse4) .cse1) (and (= v_~pos~0_174 .cse5) (not .cse1) (= |v_thread1Thread1of1ForFork0_#t~post2_90| |v_thread1Thread1of1ForFork0_#t~post2_88|) (not (= (mod v_~g1~0_111 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_90| |v_thread1Thread1of1ForFork0_#t~post2_89|) (not .cse3) (= v_~pos~0_176 (+ v_~pos~0_175 1))) (and (= v_~pos~0_175 .cse5) .cse3 (= |v_thread1Thread1of1ForFork0_#t~post1_89| |v_thread1Thread1of1ForFork0_#t~post1_90|))) (= (mod v_~g2~0_96 256) 0) (let ((.cse6 (= v_~d1~0_132 (ite (= (ite .cse1 1 0) 0) 0 1))) (.cse7 (= v_~g1~0_109 v_~g1~0_111))) (or (and .cse6 .cse7 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_101| 256) 0)) (and .cse8 .cse6 .cse7))) (= |v_thread2Thread1of1ForFork1_#res.offset_23| 0) (= |v_thread2Thread1of1ForFork1_#res.base_23| 0) (or (and (= v_~pos~0_174 (+ v_~pos~0_173 1)) .cse8 (= |v_thread1Thread1of1ForFork0_#t~post1_88| |v_thread1Thread1of1ForFork0_#t~post1_87|)) (and (not (= (mod v_~g1~0_109 256) 0)) (= |v_thread1Thread1of1ForFork0_#t~post2_88| |v_thread1Thread1of1ForFork0_#t~post2_87|) (not .cse8) (= v_~pos~0_173 .cse4))) (let ((.cse10 (= v_~g1~0_109 v_~g1~0_108)) (.cse12 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_100| 256) 0)) (.cse9 (= (mod v_~d1~0_131 256) 0)) (.cse11 (= v_~d1~0_131 (ite (= (ite .cse8 1 0) 0) 0 1)))) (or (and .cse9 .cse10 .cse11) (and .cse12 .cse10 .cse11) (and (= v_~g1~0_108 0) (not .cse12) (not .cse9) .cse11))))) InVars {~g2~0=v_~g2~0_96, ~g1~0=v_~g1~0_110, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_102|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_89|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_89|, ~pos~0=v_~pos~0_175, ~d1~0=v_~d1~0_133} OutVars{~g2~0=v_~g2~0_96, ~g1~0=v_~g1~0_108, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_23|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_87|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_87|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_23|, ~pos~0=v_~pos~0_173, ~d1~0=v_~d1~0_131} AuxVars[|v_thread1Thread1of1ForFork0_#t~nondet3_100|, v_~pos~0_176, v_~g1~0_109, |v_thread1Thread1of1ForFork0_#t~nondet3_101|, |v_thread1Thread1of1ForFork0_#t~post2_90|, |v_thread1Thread1of1ForFork0_#t~post1_90|, v_~pos~0_174, v_~d1~0_132, v_~d1~0_134, v_~g1~0_111, |v_thread1Thread1of1ForFork0_#t~post2_88|, |v_thread1Thread1of1ForFork0_#t~post1_88|] AssignedVars[~g1~0, thread2Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork1_#res.base, ~pos~0, ~d1~0] [2022-12-13 01:43:09,812 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [353] L75-1-->L75-1: Formula: (let ((.cse2 (+ v_~pos~0_117 2)) (.cse1 (= (mod v_~d2~0_77 256) 0)) (.cse3 (= (mod v_~d2~0_78 256) 0))) (and (let ((.cse0 (not (= (mod v_~g2~0_70 256) 0)))) (or (and (= v_~pos~0_117 (+ v_~pos~0_116 2)) .cse0 .cse1) (and (not .cse1) (= v_~pos~0_116 .cse2) .cse0))) (or (and (not .cse3) (= v_~pos~0_117 (+ v_~pos~0_118 2))) (and .cse3 (= v_~pos~0_118 .cse2))) (let ((.cse5 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_50| 256) 0)) (.cse7 (= (mod v_~d2~0_76 256) 0)) (.cse4 (= (ite (= (ite .cse1 1 0) 0) 0 1) v_~d2~0_76)) (.cse6 (= v_~g2~0_69 v_~g2~0_70))) (or (and .cse4 .cse5 .cse6) (and (not .cse5) .cse4 (= v_~g2~0_69 0) (not .cse7)) (and .cse7 .cse4 .cse6))) (let ((.cse8 (= v_~g2~0_71 v_~g2~0_70)) (.cse9 (= v_~d2~0_77 (ite (= (ite .cse3 1 0) 0) 0 1)))) (or (and .cse8 .cse1 .cse9) (and .cse8 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_51| 256) 0) .cse9))))) InVars {~g2~0=v_~g2~0_71, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_51|, ~pos~0=v_~pos~0_118, ~d2~0=v_~d2~0_78} OutVars{~g2~0=v_~g2~0_69, ~pos~0=v_~pos~0_116, ~d2~0=v_~d2~0_76} AuxVars[|v_thread2Thread1of1ForFork1_#t~nondet4_50|, v_~g2~0_70, v_~pos~0_117, v_~d2~0_77] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] and [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 01:43:12,069 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_3 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_3} OutVars{~g2~0=v_~g2~0_In_3, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 01:43:15,873 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 01:43:15,874 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18629 [2022-12-13 01:43:15,875 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 46 transitions, 409 flow [2022-12-13 01:43:15,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 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 01:43:15,875 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:15,875 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:15,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 01:43:16,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-12-13 01:43:16,081 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 01:43:16,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:16,081 INFO L85 PathProgramCache]: Analyzing trace with hash 640332303, now seen corresponding path program 1 times [2022-12-13 01:43:16,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:16,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043460188] [2022-12-13 01:43:16,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:16,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:16,352 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 01:43:16,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:16,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043460188] [2022-12-13 01:43:16,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043460188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:16,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:16,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 01:43:16,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901478285] [2022-12-13 01:43:16,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:16,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:43:16,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:16,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:43:16,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:43:16,354 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 01:43:16,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 46 transitions, 409 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 01:43:16,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:16,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 01:43:16,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:16,509 INFO L130 PetriNetUnfolder]: 149/260 cut-off events. [2022-12-13 01:43:16,509 INFO L131 PetriNetUnfolder]: For 608/608 co-relation queries the response was YES. [2022-12-13 01:43:16,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1276 conditions, 260 events. 149/260 cut-off events. For 608/608 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 912 event pairs, 29 based on Foata normal form. 1/251 useless extension candidates. Maximal degree in co-relation 1220. Up to 171 conditions per place. [2022-12-13 01:43:16,512 INFO L137 encePairwiseOnDemand]: 21/33 looper letters, 38 selfloop transitions, 12 changer transitions 7/57 dead transitions. [2022-12-13 01:43:16,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 57 transitions, 591 flow [2022-12-13 01:43:16,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:43:16,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:43:16,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-13 01:43:16,514 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2022-12-13 01:43:16,514 INFO L175 Difference]: Start difference. First operand has 39 places, 46 transitions, 409 flow. Second operand 3 states and 45 transitions. [2022-12-13 01:43:16,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 57 transitions, 591 flow [2022-12-13 01:43:16,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 57 transitions, 501 flow, removed 38 selfloop flow, removed 3 redundant places. [2022-12-13 01:43:16,520 INFO L231 Difference]: Finished difference. Result has 39 places, 46 transitions, 380 flow [2022-12-13 01:43:16,520 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=380, PETRI_PLACES=39, PETRI_TRANSITIONS=46} [2022-12-13 01:43:16,523 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 21 predicate places. [2022-12-13 01:43:16,527 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:16,528 INFO L89 Accepts]: Start accepts. Operand has 39 places, 46 transitions, 380 flow [2022-12-13 01:43:16,528 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:16,528 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:16,528 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 46 transitions, 380 flow [2022-12-13 01:43:16,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 46 transitions, 380 flow [2022-12-13 01:43:16,542 INFO L130 PetriNetUnfolder]: 34/86 cut-off events. [2022-12-13 01:43:16,543 INFO L131 PetriNetUnfolder]: For 159/192 co-relation queries the response was YES. [2022-12-13 01:43:16,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 86 events. 34/86 cut-off events. For 159/192 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 273 event pairs, 1 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 307. Up to 41 conditions per place. [2022-12-13 01:43:16,544 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 46 transitions, 380 flow [2022-12-13 01:43:16,544 INFO L226 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-13 01:43:18,829 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [380] L75-1-->L75-1: Formula: (let ((.cse5 (= (mod v_~d2~0_141 256) 0)) (.cse11 (+ v_~pos~0_265 2)) (.cse6 (+ v_~pos~0_267 2)) (.cse4 (= (mod v_~d2~0_140 256) 0)) (.cse7 (= (mod v_~d2~0_142 256) 0))) (and (let ((.cse1 (= v_~g2~0_145 v_~g2~0_144)) (.cse0 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_113| 256) 0)) (.cse3 (= (mod v_~d2~0_139 256) 0)) (.cse2 (= v_~d2~0_139 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse2) (and (not .cse0) (= v_~g2~0_144 0) (not .cse3) .cse2))) (or (and (= v_~pos~0_267 (+ v_~pos~0_266 2)) (not .cse5)) (and (= v_~pos~0_266 .cse6) .cse5)) (let ((.cse8 (= (ite (= (ite .cse5 1 0) 0) 0 1) v_~d2~0_142)) (.cse9 (= v_~g2~0_147 v_~g2~0_146))) (or (and .cse7 .cse8 .cse9) (and (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_115| 256) 0) .cse8 .cse9))) (let ((.cse10 (not (= (mod v_~g2~0_145 256) 0)))) (or (and .cse4 (= v_~pos~0_265 (+ v_~pos~0_264 2)) .cse10) (and (not .cse4) (= v_~pos~0_264 .cse11) .cse10))) (or (and .cse7 (= v_~pos~0_267 .cse11)) (and (= v_~pos~0_265 .cse6) (not .cse7))) (let ((.cse12 (= v_~g2~0_147 v_~g2~0_145)) (.cse13 (= v_~d2~0_140 (ite (= (ite .cse7 1 0) 0) 0 1)))) (or (and .cse12 .cse13 .cse4) (and (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_114| 256) 0) .cse12 .cse13))))) InVars {~g2~0=v_~g2~0_146, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_115|, ~pos~0=v_~pos~0_266, ~d2~0=v_~d2~0_141} OutVars{~g2~0=v_~g2~0_144, ~pos~0=v_~pos~0_264, ~d2~0=v_~d2~0_139} AuxVars[v_~d2~0_142, v_~pos~0_267, |v_thread2Thread1of1ForFork1_#t~nondet4_113|, v_~g2~0_147, v_~pos~0_265, |v_thread2Thread1of1ForFork1_#t~nondet4_114|, v_~g2~0_145, v_~d2~0_140] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] and [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 01:43:19,875 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:43:19,876 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3349 [2022-12-13 01:43:19,876 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 46 transitions, 388 flow [2022-12-13 01:43:19,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 01:43:19,876 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:19,876 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:19,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 01:43:19,877 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 01:43:19,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:19,877 INFO L85 PathProgramCache]: Analyzing trace with hash 668961454, now seen corresponding path program 1 times [2022-12-13 01:43:19,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:19,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350007305] [2022-12-13 01:43:19,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:19,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:20,119 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 01:43:20,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:20,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350007305] [2022-12-13 01:43:20,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350007305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:20,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:20,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:43:20,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773117345] [2022-12-13 01:43:20,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:20,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:43:20,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:20,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:43:20,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:43:20,122 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 01:43:20,122 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 46 transitions, 388 flow. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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 01:43:20,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:20,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 01:43:20,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:20,260 INFO L130 PetriNetUnfolder]: 144/242 cut-off events. [2022-12-13 01:43:20,260 INFO L131 PetriNetUnfolder]: For 492/492 co-relation queries the response was YES. [2022-12-13 01:43:20,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1203 conditions, 242 events. 144/242 cut-off events. For 492/492 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 793 event pairs, 10 based on Foata normal form. 8/242 useless extension candidates. Maximal degree in co-relation 1001. Up to 192 conditions per place. [2022-12-13 01:43:20,262 INFO L137 encePairwiseOnDemand]: 13/31 looper letters, 37 selfloop transitions, 21 changer transitions 0/58 dead transitions. [2022-12-13 01:43:20,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 58 transitions, 580 flow [2022-12-13 01:43:20,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:43:20,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:43:20,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-13 01:43:20,264 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2022-12-13 01:43:20,264 INFO L175 Difference]: Start difference. First operand has 36 places, 46 transitions, 388 flow. Second operand 4 states and 44 transitions. [2022-12-13 01:43:20,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 58 transitions, 580 flow [2022-12-13 01:43:20,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 58 transitions, 556 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 01:43:20,268 INFO L231 Difference]: Finished difference. Result has 38 places, 48 transitions, 458 flow [2022-12-13 01:43:20,268 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=458, PETRI_PLACES=38, PETRI_TRANSITIONS=48} [2022-12-13 01:43:20,270 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 20 predicate places. [2022-12-13 01:43:20,270 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:20,270 INFO L89 Accepts]: Start accepts. Operand has 38 places, 48 transitions, 458 flow [2022-12-13 01:43:20,271 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:20,271 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:20,271 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 48 transitions, 458 flow [2022-12-13 01:43:20,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 48 transitions, 458 flow [2022-12-13 01:43:20,285 INFO L130 PetriNetUnfolder]: 36/89 cut-off events. [2022-12-13 01:43:20,285 INFO L131 PetriNetUnfolder]: For 223/238 co-relation queries the response was YES. [2022-12-13 01:43:20,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 89 events. 36/89 cut-off events. For 223/238 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 294 event pairs, 1 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 354. Up to 43 conditions per place. [2022-12-13 01:43:20,286 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 48 transitions, 458 flow [2022-12-13 01:43:20,286 INFO L226 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-13 01:43:20,319 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] L53-1-->L53-1: Formula: (let ((.cse5 (= (mod v_~d1~0_227 256) 0)) (.cse4 (= (mod v_~d1~0_226 256) 0)) (.cse12 (+ v_~pos~0_304 1)) (.cse6 (+ v_~pos~0_306 1)) (.cse9 (= (mod v_~d1~0_228 256) 0))) (and (let ((.cse1 (= v_~g1~0_203 v_~g1~0_202)) (.cse0 (= (mod v_~d1~0_225 256) 0)) (.cse2 (= (ite (= (ite .cse4 1 0) 0) 0 1) v_~d1~0_225)) (.cse3 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_194| 256) 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse2) (and (= v_~g1~0_202 0) (not .cse0) .cse2 (not .cse3)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_184| |v_thread1Thread1of1ForFork0_#t~post1_183|) .cse5 (= v_~pos~0_305 .cse6)) (and (not .cse5) (= v_~pos~0_306 (+ v_~pos~0_305 1)) (= |v_thread1Thread1of1ForFork0_#t~post2_184| |v_thread1Thread1of1ForFork0_#t~post2_183|))) (let ((.cse7 (= v_~g1~0_205 v_~g1~0_203)) (.cse8 (= v_~d1~0_226 (ite (= (ite .cse9 1 0) 0) 0 1)))) (or (and .cse7 .cse8 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_195| 256) 0)) (and .cse7 .cse8 .cse4))) (let ((.cse10 (= v_~g1~0_205 v_~g1~0_204)) (.cse11 (= v_~d1~0_228 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse10 .cse11 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_196| 256) 0)) (and .cse9 .cse10 .cse11))) (or (and (not (= 0 (mod v_~g1~0_203 256))) (not .cse4) (= v_~pos~0_303 .cse12) (= |v_thread1Thread1of1ForFork0_#t~post2_182| |v_thread1Thread1of1ForFork0_#t~post2_181|)) (and (= v_~pos~0_304 (+ v_~pos~0_303 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_182| |v_thread1Thread1of1ForFork0_#t~post1_181|) .cse4)) (or (and .cse9 (= v_~pos~0_306 .cse12) (= |v_thread1Thread1of1ForFork0_#t~post1_184| |v_thread1Thread1of1ForFork0_#t~post1_182|)) (and (= v_~pos~0_304 .cse6) (= |v_thread1Thread1of1ForFork0_#t~post2_184| |v_thread1Thread1of1ForFork0_#t~post2_182|) (not .cse9) (not (= (mod v_~g1~0_205 256) 0)))))) InVars {~g1~0=v_~g1~0_204, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_196|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_183|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_183|, ~pos~0=v_~pos~0_305, ~d1~0=v_~d1~0_227} OutVars{~g1~0=v_~g1~0_202, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_181|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_181|, ~pos~0=v_~pos~0_303, ~d1~0=v_~d1~0_225} AuxVars[v_~g1~0_205, v_~d1~0_228, v_~d1~0_226, |v_thread1Thread1of1ForFork0_#t~post2_184|, |v_thread1Thread1of1ForFork0_#t~post1_182|, |v_thread1Thread1of1ForFork0_#t~post2_182|, v_~pos~0_306, v_~g1~0_203, |v_thread1Thread1of1ForFork0_#t~nondet3_195|, |v_thread1Thread1of1ForFork0_#t~post1_184|, |v_thread1Thread1of1ForFork0_#t~nondet3_194|, v_~pos~0_304] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [350] L75-1-->L75-1: Formula: (let ((.cse4 (= (mod v_~d2~0_71 256) 0)) (.cse8 (= (mod v_~d2~0_72 256) 0)) (.cse5 (+ v_~pos~0_104 2))) (and (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_44| 256) 0)) (.cse0 (= (mod v_~d2~0_70 256) 0)) (.cse3 (= v_~g2~0_62 v_~g2~0_61)) (.cse1 (= v_~d2~0_70 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) .cse1 (not .cse2) (= v_~g2~0_61 0)) (and .cse3 .cse1 .cse2) (and .cse0 .cse3 .cse1))) (or (and .cse4 (= v_~pos~0_104 (+ v_~pos~0_103 2))) (and (not .cse4) (= v_~pos~0_103 .cse5))) (let ((.cse6 (= v_~g2~0_63 v_~g2~0_62)) (.cse7 (= v_~d2~0_71 (ite (= (ite .cse8 1 0) 0) 0 1)))) (or (and .cse6 .cse7 .cse4) (and .cse6 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_45| 256) 0) .cse7))) (let ((.cse9 (not (= (mod v_~g2~0_63 256) 0)))) (or (and (= v_~pos~0_104 (+ v_~pos~0_105 2)) .cse9 (not .cse8)) (and .cse8 (= v_~pos~0_105 .cse5) .cse9))))) InVars {~g2~0=v_~g2~0_63, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_45|, ~pos~0=v_~pos~0_105, ~d2~0=v_~d2~0_72} OutVars{~g2~0=v_~g2~0_61, ~pos~0=v_~pos~0_103, ~d2~0=v_~d2~0_70} AuxVars[v_~pos~0_104, v_~d2~0_71, |v_thread2Thread1of1ForFork1_#t~nondet4_44|, v_~g2~0_62] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 01:43:21,879 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:43:21,880 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1610 [2022-12-13 01:43:21,880 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 47 transitions, 454 flow [2022-12-13 01:43:21,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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 01:43:21,880 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:21,880 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:21,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 01:43:21,880 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 01:43:21,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:21,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1073101926, now seen corresponding path program 1 times [2022-12-13 01:43:21,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:21,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387472040] [2022-12-13 01:43:21,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:21,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:22,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:43:22,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:22,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387472040] [2022-12-13 01:43:22,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387472040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:22,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:22,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 01:43:22,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163722870] [2022-12-13 01:43:22,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:22,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:43:22,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:22,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:43:22,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:43:22,084 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 01:43:22,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 47 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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 01:43:22,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:22,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 01:43:22,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:22,200 INFO L130 PetriNetUnfolder]: 157/269 cut-off events. [2022-12-13 01:43:22,200 INFO L131 PetriNetUnfolder]: For 706/706 co-relation queries the response was YES. [2022-12-13 01:43:22,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1421 conditions, 269 events. 157/269 cut-off events. For 706/706 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 913 event pairs, 34 based on Foata normal form. 2/259 useless extension candidates. Maximal degree in co-relation 1159. Up to 144 conditions per place. [2022-12-13 01:43:22,202 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 48 selfloop transitions, 9 changer transitions 0/57 dead transitions. [2022-12-13 01:43:22,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 57 transitions, 662 flow [2022-12-13 01:43:22,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:43:22,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:43:22,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-13 01:43:22,203 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43010752688172044 [2022-12-13 01:43:22,203 INFO L175 Difference]: Start difference. First operand has 37 places, 47 transitions, 454 flow. Second operand 3 states and 40 transitions. [2022-12-13 01:43:22,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 57 transitions, 662 flow [2022-12-13 01:43:22,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 57 transitions, 619 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-13 01:43:22,208 INFO L231 Difference]: Finished difference. Result has 38 places, 47 transitions, 450 flow [2022-12-13 01:43:22,208 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=38, PETRI_TRANSITIONS=47} [2022-12-13 01:43:22,209 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 20 predicate places. [2022-12-13 01:43:22,209 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:22,209 INFO L89 Accepts]: Start accepts. Operand has 38 places, 47 transitions, 450 flow [2022-12-13 01:43:22,209 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:22,210 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:22,210 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 47 transitions, 450 flow [2022-12-13 01:43:22,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 47 transitions, 450 flow [2022-12-13 01:43:22,224 INFO L130 PetriNetUnfolder]: 40/102 cut-off events. [2022-12-13 01:43:22,224 INFO L131 PetriNetUnfolder]: For 233/242 co-relation queries the response was YES. [2022-12-13 01:43:22,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 102 events. 40/102 cut-off events. For 233/242 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 356 event pairs, 2 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 426. Up to 54 conditions per place. [2022-12-13 01:43:22,227 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 47 transitions, 450 flow [2022-12-13 01:43:22,227 INFO L226 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-13 01:43:22,229 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:43:22,229 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-13 01:43:22,229 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 47 transitions, 450 flow [2022-12-13 01:43:22,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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 01:43:22,230 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:22,230 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:22,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 01:43:22,230 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 01:43:22,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:22,230 INFO L85 PathProgramCache]: Analyzing trace with hash 675654869, now seen corresponding path program 1 times [2022-12-13 01:43:22,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:22,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339904206] [2022-12-13 01:43:22,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:22,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:22,577 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 01:43:22,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:22,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339904206] [2022-12-13 01:43:22,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339904206] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:43:22,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306956507] [2022-12-13 01:43:22,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:22,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:43:22,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:43:22,579 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 01:43:22,592 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 01:43:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:22,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 01:43:22,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:43:22,794 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 01:43:22,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:43:23,021 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 01:43:23,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306956507] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:43:23,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:43:23,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 01:43:23,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622774033] [2022-12-13 01:43:23,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:43:23,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:43:23,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:23,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:43:23,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:43:23,023 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 01:43:23,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 47 transitions, 450 flow. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 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 01:43:23,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:23,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 01:43:23,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:23,281 INFO L130 PetriNetUnfolder]: 189/337 cut-off events. [2022-12-13 01:43:23,281 INFO L131 PetriNetUnfolder]: For 884/884 co-relation queries the response was YES. [2022-12-13 01:43:23,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1841 conditions, 337 events. 189/337 cut-off events. For 884/884 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1298 event pairs, 4 based on Foata normal form. 14/339 useless extension candidates. Maximal degree in co-relation 1482. Up to 171 conditions per place. [2022-12-13 01:43:23,284 INFO L137 encePairwiseOnDemand]: 10/30 looper letters, 44 selfloop transitions, 39 changer transitions 13/96 dead transitions. [2022-12-13 01:43:23,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 96 transitions, 971 flow [2022-12-13 01:43:23,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 01:43:23,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 01:43:23,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 76 transitions. [2022-12-13 01:43:23,285 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23030303030303031 [2022-12-13 01:43:23,285 INFO L175 Difference]: Start difference. First operand has 38 places, 47 transitions, 450 flow. Second operand 11 states and 76 transitions. [2022-12-13 01:43:23,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 96 transitions, 971 flow [2022-12-13 01:43:23,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 96 transitions, 954 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-13 01:43:23,291 INFO L231 Difference]: Finished difference. Result has 48 places, 57 transitions, 661 flow [2022-12-13 01:43:23,291 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=661, PETRI_PLACES=48, PETRI_TRANSITIONS=57} [2022-12-13 01:43:23,291 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 30 predicate places. [2022-12-13 01:43:23,291 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:23,292 INFO L89 Accepts]: Start accepts. Operand has 48 places, 57 transitions, 661 flow [2022-12-13 01:43:23,292 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:23,292 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:23,292 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 57 transitions, 661 flow [2022-12-13 01:43:23,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 57 transitions, 661 flow [2022-12-13 01:43:23,309 INFO L130 PetriNetUnfolder]: 44/111 cut-off events. [2022-12-13 01:43:23,309 INFO L131 PetriNetUnfolder]: For 325/334 co-relation queries the response was YES. [2022-12-13 01:43:23,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 618 conditions, 111 events. 44/111 cut-off events. For 325/334 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 388 event pairs, 0 based on Foata normal form. 1/107 useless extension candidates. Maximal degree in co-relation 566. Up to 65 conditions per place. [2022-12-13 01:43:23,310 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 57 transitions, 661 flow [2022-12-13 01:43:23,310 INFO L226 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-13 01:43:23,339 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L53-1-->L53-1: Formula: (let ((.cse0 (= (mod v_~d1~0_102 256) 0)) (.cse3 (= (mod v_~d1~0_101 256) 0)) (.cse1 (+ v_~pos~0_135 1))) (and (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_56| |v_thread1Thread1of1ForFork0_#t~post1_55|) .cse0 (= v_~pos~0_136 .cse1)) (and (= |v_thread1Thread1of1ForFork0_#t~post2_56| |v_thread1Thread1of1ForFork0_#t~post2_55|) (not (= (mod v_~g1~0_79 256) 0)) (= v_~pos~0_135 (+ v_~pos~0_136 1)) (not .cse0))) (let ((.cse2 (= v_~g1~0_78 v_~g1~0_79)) (.cse4 (= v_~d1~0_101 (ite (= (ite .cse0 1 0) 0) 0 1)))) (or (and .cse2 .cse3 .cse4) (and .cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_70| 256) 0) .cse4))) (let ((.cse6 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_69| 256) 0)) (.cse8 (= v_~g1~0_78 v_~g1~0_77)) (.cse5 (= (mod v_~d1~0_100 256) 0)) (.cse7 (= (ite (= (ite .cse3 1 0) 0) 0 1) v_~d1~0_100))) (or (and (not .cse5) (= v_~g1~0_77 0) (not .cse6) .cse7) (and .cse8 .cse6 .cse7) (and .cse8 .cse5 .cse7))) (or (and (= v_~pos~0_135 (+ v_~pos~0_134 1)) .cse3 (= |v_thread1Thread1of1ForFork0_#t~post1_55| |v_thread1Thread1of1ForFork0_#t~post1_54|)) (and (not .cse3) (= |v_thread1Thread1of1ForFork0_#t~post2_55| |v_thread1Thread1of1ForFork0_#t~post2_54|) (not (= (mod v_~g1~0_78 256) 0)) (= v_~pos~0_134 .cse1))))) InVars {~g1~0=v_~g1~0_79, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_70|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_56|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_56|, ~pos~0=v_~pos~0_136, ~d1~0=v_~d1~0_102} OutVars{~g1~0=v_~g1~0_77, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_54|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_54|, ~pos~0=v_~pos~0_134, ~d1~0=v_~d1~0_100} AuxVars[v_~pos~0_135, v_~g1~0_78, v_~d1~0_101, |v_thread1Thread1of1ForFork0_#t~nondet3_69|, |v_thread1Thread1of1ForFork0_#t~post2_55|, |v_thread1Thread1of1ForFork0_#t~post1_55|] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [350] L75-1-->L75-1: Formula: (let ((.cse4 (= (mod v_~d2~0_71 256) 0)) (.cse8 (= (mod v_~d2~0_72 256) 0)) (.cse5 (+ v_~pos~0_104 2))) (and (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_44| 256) 0)) (.cse0 (= (mod v_~d2~0_70 256) 0)) (.cse3 (= v_~g2~0_62 v_~g2~0_61)) (.cse1 (= v_~d2~0_70 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) .cse1 (not .cse2) (= v_~g2~0_61 0)) (and .cse3 .cse1 .cse2) (and .cse0 .cse3 .cse1))) (or (and .cse4 (= v_~pos~0_104 (+ v_~pos~0_103 2))) (and (not .cse4) (= v_~pos~0_103 .cse5))) (let ((.cse6 (= v_~g2~0_63 v_~g2~0_62)) (.cse7 (= v_~d2~0_71 (ite (= (ite .cse8 1 0) 0) 0 1)))) (or (and .cse6 .cse7 .cse4) (and .cse6 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_45| 256) 0) .cse7))) (let ((.cse9 (not (= (mod v_~g2~0_63 256) 0)))) (or (and (= v_~pos~0_104 (+ v_~pos~0_105 2)) .cse9 (not .cse8)) (and .cse8 (= v_~pos~0_105 .cse5) .cse9))))) InVars {~g2~0=v_~g2~0_63, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_45|, ~pos~0=v_~pos~0_105, ~d2~0=v_~d2~0_72} OutVars{~g2~0=v_~g2~0_61, ~pos~0=v_~pos~0_103, ~d2~0=v_~d2~0_70} AuxVars[v_~pos~0_104, v_~d2~0_71, |v_thread2Thread1of1ForFork1_#t~nondet4_44|, v_~g2~0_62] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 01:43:24,457 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [387] L53-1-->L53-1: Formula: (let ((.cse2 (+ v_~pos~0_293 1)) (.cse1 (+ v_~pos~0_296 1)) (.cse0 (= (mod v_~d1~0_218 256) 0)) (.cse12 (= (mod v_~d1~0_217 256) 0)) (.cse5 (= (mod v_~d1~0_215 256) 0)) (.cse11 (+ v_~pos~0_294 1)) (.cse10 (= (mod v_~d1~0_216 256) 0))) (and (or (and (not .cse0) (= .cse1 v_~pos~0_293) (= |v_thread1Thread1of1ForFork0_#t~post2_174| |v_thread1Thread1of1ForFork0_#t~post2_171|)) (and (= v_~pos~0_296 .cse2) .cse0 (= |v_thread1Thread1of1ForFork0_#t~post1_174| |v_thread1Thread1of1ForFork0_#t~post1_171|))) (let ((.cse3 (= v_~g1~0_195 v_~g1~0_192)) (.cse4 (= v_~d1~0_215 (ite (= (ite .cse0 1 0) 0) 0 1)))) (or (and (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_185| 256) 0) .cse3 .cse4) (and .cse5 .cse3 .cse4))) (let ((.cse8 (= v_~g1~0_193 v_~g1~0_191)) (.cse6 (= (ite (= (ite .cse10 1 0) 0) 0 1) v_~d1~0_214)) (.cse7 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_182| 256) 0)) (.cse9 (= (mod v_~d1~0_214 256) 0))) (or (and .cse6 .cse7 .cse8) (and .cse6 .cse9 .cse8) (and .cse6 (not .cse7) (not .cse9) (= v_~g1~0_191 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_172| |v_thread1Thread1of1ForFork0_#t~post2_171|) (not .cse5) (= v_~pos~0_294 .cse2)) (and (= v_~pos~0_293 .cse11) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post1_172| |v_thread1Thread1of1ForFork0_#t~post1_171|))) (or (and (= v_~pos~0_296 (+ v_~pos~0_295 1)) (= |v_thread1Thread1of1ForFork0_#t~post2_174| |v_thread1Thread1of1ForFork0_#t~post2_173|) (not .cse12)) (and (= |v_thread1Thread1of1ForFork0_#t~post1_174| |v_thread1Thread1of1ForFork0_#t~post1_173|) (= .cse1 v_~pos~0_295) .cse12)) (let ((.cse13 (= (ite (= (ite .cse12 1 0) 0) 0 1) v_~d1~0_218)) (.cse14 (= v_~g1~0_195 v_~g1~0_194))) (or (and .cse13 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_186| 256) 0) .cse14) (and .cse13 .cse0 .cse14))) (let ((.cse15 (= v_~g1~0_193 v_~g1~0_192)) (.cse16 (= (ite (= (ite .cse5 1 0) 0) 0 1) v_~d1~0_216))) (or (and .cse15 .cse10 .cse16) (and .cse15 .cse16 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_184| 256) 0)))) (let ((.cse17 (not (= 0 (mod v_~g1~0_193 256))))) (or (and .cse10 .cse17 (= |v_thread1Thread1of1ForFork0_#t~post1_172| |v_thread1Thread1of1ForFork0_#t~post1_170|) (= v_~pos~0_294 (+ v_~pos~0_292 1))) (and (= |v_thread1Thread1of1ForFork0_#t~post2_172| |v_thread1Thread1of1ForFork0_#t~post2_170|) .cse17 (= v_~pos~0_292 .cse11) (not .cse10)))))) InVars {~g1~0=v_~g1~0_194, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_186|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_173|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_173|, ~pos~0=v_~pos~0_295, ~d1~0=v_~d1~0_217} OutVars{~g1~0=v_~g1~0_191, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_170|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_170|, ~pos~0=v_~pos~0_292, ~d1~0=v_~d1~0_214} AuxVars[v_~g1~0_193, v_~g1~0_192, v_~g1~0_195, v_~pos~0_293, v_~pos~0_294, |v_thread1Thread1of1ForFork0_#t~post1_174|, |v_thread1Thread1of1ForFork0_#t~post1_171|, |v_thread1Thread1of1ForFork0_#t~post1_172|, v_~d1~0_216, |v_thread1Thread1of1ForFork0_#t~nondet3_185|, v_~d1~0_218, v_~d1~0_215, v_~pos~0_296, |v_thread1Thread1of1ForFork0_#t~post2_174|, |v_thread1Thread1of1ForFork0_#t~nondet3_182|, |v_thread1Thread1of1ForFork0_#t~post2_172|, |v_thread1Thread1of1ForFork0_#t~post2_171|, |v_thread1Thread1of1ForFork0_#t~nondet3_184|] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [350] L75-1-->L75-1: Formula: (let ((.cse4 (= (mod v_~d2~0_71 256) 0)) (.cse8 (= (mod v_~d2~0_72 256) 0)) (.cse5 (+ v_~pos~0_104 2))) (and (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_44| 256) 0)) (.cse0 (= (mod v_~d2~0_70 256) 0)) (.cse3 (= v_~g2~0_62 v_~g2~0_61)) (.cse1 (= v_~d2~0_70 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) .cse1 (not .cse2) (= v_~g2~0_61 0)) (and .cse3 .cse1 .cse2) (and .cse0 .cse3 .cse1))) (or (and .cse4 (= v_~pos~0_104 (+ v_~pos~0_103 2))) (and (not .cse4) (= v_~pos~0_103 .cse5))) (let ((.cse6 (= v_~g2~0_63 v_~g2~0_62)) (.cse7 (= v_~d2~0_71 (ite (= (ite .cse8 1 0) 0) 0 1)))) (or (and .cse6 .cse7 .cse4) (and .cse6 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_45| 256) 0) .cse7))) (let ((.cse9 (not (= (mod v_~g2~0_63 256) 0)))) (or (and (= v_~pos~0_104 (+ v_~pos~0_105 2)) .cse9 (not .cse8)) (and .cse8 (= v_~pos~0_105 .cse5) .cse9))))) InVars {~g2~0=v_~g2~0_63, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_45|, ~pos~0=v_~pos~0_105, ~d2~0=v_~d2~0_72} OutVars{~g2~0=v_~g2~0_61, ~pos~0=v_~pos~0_103, ~d2~0=v_~d2~0_70} AuxVars[v_~pos~0_104, v_~d2~0_71, |v_thread2Thread1of1ForFork1_#t~nondet4_44|, v_~g2~0_62] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 01:43:28,677 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:43:28,678 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5387 [2022-12-13 01:43:28,678 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 55 transitions, 650 flow [2022-12-13 01:43:28,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 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 01:43:28,678 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:28,678 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:28,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 01:43:28,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:43:28,879 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 01:43:28,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:28,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1729788461, now seen corresponding path program 1 times [2022-12-13 01:43:28,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:28,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289877645] [2022-12-13 01:43:28,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:28,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:29,230 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 01:43:29,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:29,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289877645] [2022-12-13 01:43:29,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289877645] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:43:29,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759175822] [2022-12-13 01:43:29,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:29,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:43:29,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:43:29,232 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 01:43:29,255 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 01:43:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:29,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 01:43:29,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:43:29,507 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 01:43:29,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:43:29,880 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 01:43:29,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759175822] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:43:29,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:43:29,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 01:43:29,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225159059] [2022-12-13 01:43:29,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:43:29,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:43:29,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:29,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:43:29,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:43:29,881 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 01:43:29,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 55 transitions, 650 flow. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:43:29,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:29,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 01:43:29,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:30,169 INFO L130 PetriNetUnfolder]: 159/288 cut-off events. [2022-12-13 01:43:30,169 INFO L131 PetriNetUnfolder]: For 938/938 co-relation queries the response was YES. [2022-12-13 01:43:30,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1815 conditions, 288 events. 159/288 cut-off events. For 938/938 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1056 event pairs, 0 based on Foata normal form. 2/280 useless extension candidates. Maximal degree in co-relation 1587. Up to 159 conditions per place. [2022-12-13 01:43:30,171 INFO L137 encePairwiseOnDemand]: 10/31 looper letters, 44 selfloop transitions, 36 changer transitions 0/80 dead transitions. [2022-12-13 01:43:30,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 80 transitions, 995 flow [2022-12-13 01:43:30,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:43:30,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:43:30,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-12-13 01:43:30,173 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2488479262672811 [2022-12-13 01:43:30,173 INFO L175 Difference]: Start difference. First operand has 46 places, 55 transitions, 650 flow. Second operand 7 states and 54 transitions. [2022-12-13 01:43:30,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 80 transitions, 995 flow [2022-12-13 01:43:30,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 80 transitions, 794 flow, removed 92 selfloop flow, removed 3 redundant places. [2022-12-13 01:43:30,181 INFO L231 Difference]: Finished difference. Result has 52 places, 60 transitions, 660 flow [2022-12-13 01:43:30,181 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=660, PETRI_PLACES=52, PETRI_TRANSITIONS=60} [2022-12-13 01:43:30,182 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 34 predicate places. [2022-12-13 01:43:30,182 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:30,182 INFO L89 Accepts]: Start accepts. Operand has 52 places, 60 transitions, 660 flow [2022-12-13 01:43:30,183 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:30,183 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:30,183 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 60 transitions, 660 flow [2022-12-13 01:43:30,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 60 transitions, 660 flow [2022-12-13 01:43:30,202 INFO L130 PetriNetUnfolder]: 48/128 cut-off events. [2022-12-13 01:43:30,202 INFO L131 PetriNetUnfolder]: For 460/473 co-relation queries the response was YES. [2022-12-13 01:43:30,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 128 events. 48/128 cut-off events. For 460/473 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 490 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 554. Up to 66 conditions per place. [2022-12-13 01:43:30,203 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 60 transitions, 660 flow [2022-12-13 01:43:30,203 INFO L226 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-13 01:43:30,204 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:43:30,205 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-13 01:43:30,205 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 60 transitions, 660 flow [2022-12-13 01:43:30,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:43:30,205 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:30,205 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:30,213 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 01:43:30,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:43:30,414 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 01:43:30,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:30,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1245859305, now seen corresponding path program 1 times [2022-12-13 01:43:30,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:30,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736366699] [2022-12-13 01:43:30,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:30,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:30,953 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 01:43:30,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:30,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736366699] [2022-12-13 01:43:30,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736366699] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:43:30,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641129989] [2022-12-13 01:43:30,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:30,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:43:30,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:43:30,955 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 01:43:30,972 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 01:43:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:31,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 01:43:31,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:43:31,314 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 01:43:31,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:43:31,948 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 01:43:31,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641129989] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:43:31,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:43:31,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2022-12-13 01:43:31,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648600934] [2022-12-13 01:43:31,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:43:31,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:43:31,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:31,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:43:31,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:43:31,950 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 01:43:31,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 60 transitions, 660 flow. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:43:31,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:31,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 01:43:31,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:32,405 INFO L130 PetriNetUnfolder]: 219/386 cut-off events. [2022-12-13 01:43:32,405 INFO L131 PetriNetUnfolder]: For 1523/1523 co-relation queries the response was YES. [2022-12-13 01:43:32,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2231 conditions, 386 events. 219/386 cut-off events. For 1523/1523 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1503 event pairs, 0 based on Foata normal form. 14/394 useless extension candidates. Maximal degree in co-relation 1943. Up to 209 conditions per place. [2022-12-13 01:43:32,408 INFO L137 encePairwiseOnDemand]: 9/31 looper letters, 36 selfloop transitions, 61 changer transitions 31/128 dead transitions. [2022-12-13 01:43:32,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 128 transitions, 1521 flow [2022-12-13 01:43:32,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 01:43:32,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 01:43:32,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2022-12-13 01:43:32,409 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2404692082111437 [2022-12-13 01:43:32,410 INFO L175 Difference]: Start difference. First operand has 52 places, 60 transitions, 660 flow. Second operand 11 states and 82 transitions. [2022-12-13 01:43:32,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 128 transitions, 1521 flow [2022-12-13 01:43:32,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 128 transitions, 1462 flow, removed 15 selfloop flow, removed 3 redundant places. [2022-12-13 01:43:32,418 INFO L231 Difference]: Finished difference. Result has 63 places, 80 transitions, 1093 flow [2022-12-13 01:43:32,419 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1093, PETRI_PLACES=63, PETRI_TRANSITIONS=80} [2022-12-13 01:43:32,419 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 45 predicate places. [2022-12-13 01:43:32,420 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:32,420 INFO L89 Accepts]: Start accepts. Operand has 63 places, 80 transitions, 1093 flow [2022-12-13 01:43:32,422 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:32,422 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:32,422 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 80 transitions, 1093 flow [2022-12-13 01:43:32,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 80 transitions, 1093 flow [2022-12-13 01:43:32,441 INFO L130 PetriNetUnfolder]: 55/119 cut-off events. [2022-12-13 01:43:32,441 INFO L131 PetriNetUnfolder]: For 496/506 co-relation queries the response was YES. [2022-12-13 01:43:32,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 119 events. 55/119 cut-off events. For 496/506 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 357 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 769. Up to 81 conditions per place. [2022-12-13 01:43:32,442 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 80 transitions, 1093 flow [2022-12-13 01:43:32,443 INFO L226 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-13 01:43:34,932 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [393] L53-1-->L75-1: Formula: (let ((.cse6 (= (mod v_~d1~0_267 256) 0)) (.cse1 (+ v_~pos~0_367 2)) (.cse14 (+ v_~pos~0_369 1)) (.cse13 (= (mod v_~d1~0_266 256) 0)) (.cse0 (= (mod v_~d2~0_177 256) 0)) (.cse15 (= (mod v_~d2~0_176 256) 0))) (and (or (and .cse0 (= v_~pos~0_367 (+ v_~pos~0_365 2))) (and (= .cse1 v_~pos~0_365) (not .cse0))) (let ((.cse4 (= (mod v_~d1~0_265 256) 0)) (.cse2 (= v_~g1~0_244 v_~g1~0_242)) (.cse5 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_232| 256) 0)) (.cse3 (= (ite (= (ite .cse6 1 0) 0) 0 1) v_~d1~0_265))) (or (and .cse2 .cse3 .cse4) (and (= v_~g1~0_242 0) (not .cse5) .cse3 (not .cse4)) (and .cse2 .cse5 .cse3))) (let ((.cse8 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_151| 256) 0)) (.cse10 (= v_~g2~0_186 v_~g2~0_184)) (.cse7 (= 0 (mod v_~d2~0_175 256))) (.cse9 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d2~0_175))) (or (and (= v_~g2~0_184 0) (not .cse7) (not .cse8) .cse9) (and .cse10 .cse9 .cse8) (and .cse10 .cse7 .cse9))) (let ((.cse11 (= (ite (= 0 (ite .cse13 1 0)) 0 1) v_~d1~0_267)) (.cse12 (= v_~g1~0_244 v_~g1~0_243))) (or (and .cse11 .cse12 .cse6) (and .cse11 .cse12 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_234| 256) 0)))) (or (and (= v_~pos~0_366 .cse14) (= |v_thread1Thread1of1ForFork0_#t~post2_220| |v_thread1Thread1of1ForFork0_#t~post2_222|) (not .cse6) (not (= (mod v_~g1~0_244 256) 0))) (and (= |v_thread1Thread1of1ForFork0_#t~post1_220| |v_thread1Thread1of1ForFork0_#t~post1_222|) (= v_~pos~0_369 (+ v_~pos~0_366 1)) .cse6)) (let ((.cse16 (not (= (mod v_~g2~0_185 256) 0)))) (or (and (= v_~pos~0_367 (+ v_~pos~0_366 2)) (not .cse15) .cse16) (and .cse15 (= .cse1 v_~pos~0_366) .cse16))) (or (and (not (= (mod v_~g1~0_243 256) 0)) (not .cse13) (= v_~pos~0_369 (+ v_~pos~0_368 1)) (= |v_thread1Thread1of1ForFork0_#t~post2_222| |v_thread1Thread1of1ForFork0_#t~post2_221|)) (and (= v_~pos~0_368 .cse14) .cse13 (= |v_thread1Thread1of1ForFork0_#t~post1_221| |v_thread1Thread1of1ForFork0_#t~post1_222|))) (let ((.cse17 (= v_~d2~0_177 (ite (= (ite .cse15 1 0) 0) 0 1))) (.cse18 (= v_~g2~0_186 v_~g2~0_185))) (or (and .cse0 .cse17 .cse18) (and (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_153| 256) 0) .cse17 .cse18))))) InVars {~g2~0=v_~g2~0_185, ~g1~0=v_~g1~0_243, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_234|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_221|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_221|, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_153|, ~pos~0=v_~pos~0_368, ~d2~0=v_~d2~0_176, ~d1~0=v_~d1~0_266} OutVars{~g2~0=v_~g2~0_184, ~g1~0=v_~g1~0_242, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_220|, ~pos~0=v_~pos~0_365, ~d2~0=v_~d2~0_175, ~d1~0=v_~d1~0_265} AuxVars[v_~pos~0_367, v_~g2~0_186, |v_thread1Thread1of1ForFork0_#t~nondet3_232|, v_~d2~0_177, v_~pos~0_366, v_~d1~0_267, |v_thread1Thread1of1ForFork0_#t~post1_222|, |v_thread1Thread1of1ForFork0_#t~post2_222|, v_~g1~0_244, |v_thread2Thread1of1ForFork1_#t~nondet4_151|, v_~pos~0_369] AssignedVars[~g2~0, ~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0, ~d1~0] and [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 01:43:37,231 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:43:37,232 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4812 [2022-12-13 01:43:37,232 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 80 transitions, 1105 flow [2022-12-13 01:43:37,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:43:37,232 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:37,232 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:37,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 01:43:37,438 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,SelfDestructingSolverStorable9 [2022-12-13 01:43:37,438 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 01:43:37,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:37,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1839469420, now seen corresponding path program 1 times [2022-12-13 01:43:37,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:37,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485474132] [2022-12-13 01:43:37,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:37,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:37,752 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 01:43:37,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:37,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485474132] [2022-12-13 01:43:37,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485474132] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:43:37,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969564159] [2022-12-13 01:43:37,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:37,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:43:37,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:43:37,754 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 01:43:37,756 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 01:43:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:37,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 01:43:37,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:43:38,025 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 01:43:38,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:43:38,206 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 01:43:38,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969564159] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:43:38,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:43:38,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 8 [2022-12-13 01:43:38,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882636075] [2022-12-13 01:43:38,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:43:38,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:43:38,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:38,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:43:38,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:43:38,208 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 01:43:38,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 80 transitions, 1105 flow. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:43:38,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:38,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 01:43:38,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:38,413 INFO L130 PetriNetUnfolder]: 153/270 cut-off events. [2022-12-13 01:43:38,413 INFO L131 PetriNetUnfolder]: For 1382/1382 co-relation queries the response was YES. [2022-12-13 01:43:38,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1840 conditions, 270 events. 153/270 cut-off events. For 1382/1382 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 910 event pairs, 0 based on Foata normal form. 20/284 useless extension candidates. Maximal degree in co-relation 1807. Up to 163 conditions per place. [2022-12-13 01:43:38,416 INFO L137 encePairwiseOnDemand]: 10/30 looper letters, 51 selfloop transitions, 30 changer transitions 8/89 dead transitions. [2022-12-13 01:43:38,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 89 transitions, 1222 flow [2022-12-13 01:43:38,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:43:38,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:43:38,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-12-13 01:43:38,417 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24285714285714285 [2022-12-13 01:43:38,417 INFO L175 Difference]: Start difference. First operand has 62 places, 80 transitions, 1105 flow. Second operand 7 states and 51 transitions. [2022-12-13 01:43:38,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 89 transitions, 1222 flow [2022-12-13 01:43:38,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 89 transitions, 1017 flow, removed 74 selfloop flow, removed 6 redundant places. [2022-12-13 01:43:38,426 INFO L231 Difference]: Finished difference. Result has 63 places, 69 transitions, 802 flow [2022-12-13 01:43:38,426 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=802, PETRI_PLACES=63, PETRI_TRANSITIONS=69} [2022-12-13 01:43:38,427 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 45 predicate places. [2022-12-13 01:43:38,427 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:38,427 INFO L89 Accepts]: Start accepts. Operand has 63 places, 69 transitions, 802 flow [2022-12-13 01:43:38,428 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:38,428 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:38,428 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 69 transitions, 802 flow [2022-12-13 01:43:38,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 69 transitions, 802 flow [2022-12-13 01:43:38,450 INFO L130 PetriNetUnfolder]: 47/112 cut-off events. [2022-12-13 01:43:38,450 INFO L131 PetriNetUnfolder]: For 440/450 co-relation queries the response was YES. [2022-12-13 01:43:38,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 112 events. 47/112 cut-off events. For 440/450 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 336 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 584. Up to 73 conditions per place. [2022-12-13 01:43:38,452 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 69 transitions, 802 flow [2022-12-13 01:43:38,452 INFO L226 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-13 01:43:38,452 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:43:38,453 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-13 01:43:38,453 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 69 transitions, 802 flow [2022-12-13 01:43:38,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:43:38,453 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:38,453 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:38,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 01:43:38,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:43:38,660 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 01:43:38,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:38,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1233453495, now seen corresponding path program 2 times [2022-12-13 01:43:38,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:38,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472058560] [2022-12-13 01:43:38,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:38,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:39,673 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 01:43:39,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:39,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472058560] [2022-12-13 01:43:39,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472058560] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:43:39,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206130929] [2022-12-13 01:43:39,674 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 01:43:39,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:43:39,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:43:39,676 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:43:39,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 01:43:39,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 01:43:39,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 01:43:39,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 01:43:39,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:43:40,248 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 01:43:40,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:43:41,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:43:41,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206130929] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:43:41,142 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:43:41,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2022-12-13 01:43:41,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184346630] [2022-12-13 01:43:41,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:43:41,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 01:43:41,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:41,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 01:43:41,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-12-13 01:43:41,144 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 01:43:41,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 69 transitions, 802 flow. Second operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 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 01:43:41,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:41,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 01:43:41,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:42,756 INFO L130 PetriNetUnfolder]: 372/685 cut-off events. [2022-12-13 01:43:42,756 INFO L131 PetriNetUnfolder]: For 2324/2324 co-relation queries the response was YES. [2022-12-13 01:43:42,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4044 conditions, 685 events. 372/685 cut-off events. For 2324/2324 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3200 event pairs, 0 based on Foata normal form. 34/713 useless extension candidates. Maximal degree in co-relation 3739. Up to 383 conditions per place. [2022-12-13 01:43:42,762 INFO L137 encePairwiseOnDemand]: 8/27 looper letters, 53 selfloop transitions, 122 changer transitions 68/243 dead transitions. [2022-12-13 01:43:42,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 243 transitions, 2951 flow [2022-12-13 01:43:42,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-13 01:43:42,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-13 01:43:42,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 176 transitions. [2022-12-13 01:43:42,764 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21728395061728395 [2022-12-13 01:43:42,764 INFO L175 Difference]: Start difference. First operand has 62 places, 69 transitions, 802 flow. Second operand 30 states and 176 transitions. [2022-12-13 01:43:42,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 243 transitions, 2951 flow [2022-12-13 01:43:42,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 243 transitions, 2827 flow, removed 40 selfloop flow, removed 4 redundant places. [2022-12-13 01:43:42,780 INFO L231 Difference]: Finished difference. Result has 93 places, 140 transitions, 1965 flow [2022-12-13 01:43:42,780 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1965, PETRI_PLACES=93, PETRI_TRANSITIONS=140} [2022-12-13 01:43:42,781 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 75 predicate places. [2022-12-13 01:43:42,781 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:42,781 INFO L89 Accepts]: Start accepts. Operand has 93 places, 140 transitions, 1965 flow [2022-12-13 01:43:42,782 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:42,782 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:42,782 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 140 transitions, 1965 flow [2022-12-13 01:43:42,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 140 transitions, 1965 flow [2022-12-13 01:43:42,818 INFO L130 PetriNetUnfolder]: 94/191 cut-off events. [2022-12-13 01:43:42,819 INFO L131 PetriNetUnfolder]: For 696/706 co-relation queries the response was YES. [2022-12-13 01:43:42,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1332 conditions, 191 events. 94/191 cut-off events. For 696/706 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 673 event pairs, 0 based on Foata normal form. 0/187 useless extension candidates. Maximal degree in co-relation 1292. Up to 155 conditions per place. [2022-12-13 01:43:42,821 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 140 transitions, 1965 flow [2022-12-13 01:43:42,821 INFO L226 LiptonReduction]: Number of co-enabled transitions 286 [2022-12-13 01:43:42,822 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [345] L75-1-->L75-1: Formula: (let ((.cse0 (= (mod v_~d2~0_58 256) 0))) (and (let ((.cse1 (not (= (mod v_~g2~0_47 256) 0)))) (or (and .cse0 (= (+ 2 v_~pos~0_77) v_~pos~0_78) .cse1) (and (= (+ 2 v_~pos~0_78) v_~pos~0_77) .cse1 (not .cse0)))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0)) (.cse3 (= v_~d2~0_57 (ite (= 0 (ite .cse0 1 0)) 0 1))) (.cse4 (= v_~g2~0_46 v_~g2~0_47)) (.cse5 (= (mod v_~d2~0_57 256) 0))) (or (and .cse2 .cse3 .cse4) (and (= v_~g2~0_46 0) .cse3 (not .cse2) (not .cse5)) (and .cse3 .cse4 .cse5))))) InVars {~g2~0=v_~g2~0_47, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_78, ~d2~0=v_~d2~0_58} OutVars{~g2~0=v_~g2~0_46, ~pos~0=v_~pos~0_77, ~d2~0=v_~d2~0_57} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 01:43:43,386 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [345] L75-1-->L75-1: Formula: (let ((.cse0 (= (mod v_~d2~0_58 256) 0))) (and (let ((.cse1 (not (= (mod v_~g2~0_47 256) 0)))) (or (and .cse0 (= (+ 2 v_~pos~0_77) v_~pos~0_78) .cse1) (and (= (+ 2 v_~pos~0_78) v_~pos~0_77) .cse1 (not .cse0)))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0)) (.cse3 (= v_~d2~0_57 (ite (= 0 (ite .cse0 1 0)) 0 1))) (.cse4 (= v_~g2~0_46 v_~g2~0_47)) (.cse5 (= (mod v_~d2~0_57 256) 0))) (or (and .cse2 .cse3 .cse4) (and (= v_~g2~0_46 0) .cse3 (not .cse2) (not .cse5)) (and .cse3 .cse4 .cse5))))) InVars {~g2~0=v_~g2~0_47, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_78, ~d2~0=v_~d2~0_58} OutVars{~g2~0=v_~g2~0_46, ~pos~0=v_~pos~0_77, ~d2~0=v_~d2~0_57} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 01:43:43,956 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [363] L75-1-->L53-1: Formula: (let ((.cse1 (= (mod v_~d1~0_127 256) 0))) (and (= |v_thread2Thread1of1ForFork1_#res.offset_21| 0) (= 0 (mod v_~g2~0_94 256)) (let ((.cse0 (not (= (mod v_~g1~0_104 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_83| |v_thread1Thread1of1ForFork0_#t~post2_82|) .cse0 (= v_~pos~0_168 (+ v_~pos~0_169 1)) (not .cse1)) (and (= |v_thread1Thread1of1ForFork0_#t~post1_83| |v_thread1Thread1of1ForFork0_#t~post1_82|) (= v_~pos~0_169 (+ v_~pos~0_168 1)) .cse1 .cse0))) (= |v_thread2Thread1of1ForFork1_#res.base_21| 0) (let ((.cse3 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_95| 256) 0)) (.cse2 (= (mod v_~d1~0_126 256) 0)) (.cse5 (= v_~g1~0_104 v_~g1~0_103)) (.cse4 (= v_~d1~0_126 (ite (= (ite .cse1 1 0) 0) 0 1)))) (or (and (not .cse2) (= v_~g1~0_103 0) (not .cse3) .cse4) (and .cse5 .cse3 .cse4) (and .cse2 .cse5 .cse4))))) InVars {~g2~0=v_~g2~0_94, ~g1~0=v_~g1~0_104, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_95|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_83|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_83|, ~pos~0=v_~pos~0_169, ~d1~0=v_~d1~0_127} OutVars{~g2~0=v_~g2~0_94, ~g1~0=v_~g1~0_103, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_21|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_82|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_82|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_21|, ~pos~0=v_~pos~0_168, ~d1~0=v_~d1~0_126} AuxVars[] AssignedVars[~g1~0, thread2Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork1_#res.base, ~pos~0, ~d1~0] [2022-12-13 01:43:44,597 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [345] L75-1-->L75-1: Formula: (let ((.cse0 (= (mod v_~d2~0_58 256) 0))) (and (let ((.cse1 (not (= (mod v_~g2~0_47 256) 0)))) (or (and .cse0 (= (+ 2 v_~pos~0_77) v_~pos~0_78) .cse1) (and (= (+ 2 v_~pos~0_78) v_~pos~0_77) .cse1 (not .cse0)))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0)) (.cse3 (= v_~d2~0_57 (ite (= 0 (ite .cse0 1 0)) 0 1))) (.cse4 (= v_~g2~0_46 v_~g2~0_47)) (.cse5 (= (mod v_~d2~0_57 256) 0))) (or (and .cse2 .cse3 .cse4) (and (= v_~g2~0_46 0) .cse3 (not .cse2) (not .cse5)) (and .cse3 .cse4 .cse5))))) InVars {~g2~0=v_~g2~0_47, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_78, ~d2~0=v_~d2~0_58} OutVars{~g2~0=v_~g2~0_46, ~pos~0=v_~pos~0_77, ~d2~0=v_~d2~0_57} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 01:43:45,032 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [345] L75-1-->L75-1: Formula: (let ((.cse0 (= (mod v_~d2~0_58 256) 0))) (and (let ((.cse1 (not (= (mod v_~g2~0_47 256) 0)))) (or (and .cse0 (= (+ 2 v_~pos~0_77) v_~pos~0_78) .cse1) (and (= (+ 2 v_~pos~0_78) v_~pos~0_77) .cse1 (not .cse0)))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0)) (.cse3 (= v_~d2~0_57 (ite (= 0 (ite .cse0 1 0)) 0 1))) (.cse4 (= v_~g2~0_46 v_~g2~0_47)) (.cse5 (= (mod v_~d2~0_57 256) 0))) (or (and .cse2 .cse3 .cse4) (and (= v_~g2~0_46 0) .cse3 (not .cse2) (not .cse5)) (and .cse3 .cse4 .cse5))))) InVars {~g2~0=v_~g2~0_47, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_78, ~d2~0=v_~d2~0_58} OutVars{~g2~0=v_~g2~0_46, ~pos~0=v_~pos~0_77, ~d2~0=v_~d2~0_57} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 01:43:46,038 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:43:46,039 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3258 [2022-12-13 01:43:46,039 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 139 transitions, 1990 flow [2022-12-13 01:43:46,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 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 01:43:46,039 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:46,040 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:46,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 01:43:46,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:43:46,246 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:43:46,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:46,246 INFO L85 PathProgramCache]: Analyzing trace with hash -942035180, now seen corresponding path program 1 times [2022-12-13 01:43:46,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:46,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78672577] [2022-12-13 01:43:46,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:46,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:47,046 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 01:43:47,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:47,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78672577] [2022-12-13 01:43:47,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78672577] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:43:47,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141816137] [2022-12-13 01:43:47,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:47,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:43:47,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:43:47,052 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:43:47,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 01:43:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:47,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 01:43:47,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:43:47,603 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 01:43:47,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:43:48,800 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 01:43:48,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141816137] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:43:48,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:43:48,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2022-12-13 01:43:48,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409590351] [2022-12-13 01:43:48,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:43:48,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 01:43:48,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:48,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 01:43:48,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-12-13 01:43:48,802 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 01:43:48,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 139 transitions, 1990 flow. Second operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 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 01:43:48,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:48,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 01:43:48,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:49,785 INFO L130 PetriNetUnfolder]: 376/631 cut-off events. [2022-12-13 01:43:49,786 INFO L131 PetriNetUnfolder]: For 2045/2045 co-relation queries the response was YES. [2022-12-13 01:43:49,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4417 conditions, 631 events. 376/631 cut-off events. For 2045/2045 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2616 event pairs, 0 based on Foata normal form. 8/629 useless extension candidates. Maximal degree in co-relation 4373. Up to 423 conditions per place. [2022-12-13 01:43:49,791 INFO L137 encePairwiseOnDemand]: 11/33 looper letters, 82 selfloop transitions, 107 changer transitions 32/221 dead transitions. [2022-12-13 01:43:49,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 221 transitions, 3384 flow [2022-12-13 01:43:49,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 01:43:49,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 01:43:49,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 94 transitions. [2022-12-13 01:43:49,794 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17803030303030304 [2022-12-13 01:43:49,794 INFO L175 Difference]: Start difference. First operand has 85 places, 139 transitions, 1990 flow. Second operand 16 states and 94 transitions. [2022-12-13 01:43:49,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 221 transitions, 3384 flow [2022-12-13 01:43:49,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 221 transitions, 2424 flow, removed 449 selfloop flow, removed 7 redundant places. [2022-12-13 01:43:49,826 INFO L231 Difference]: Finished difference. Result has 101 places, 172 transitions, 2020 flow [2022-12-13 01:43:49,826 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1374, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2020, PETRI_PLACES=101, PETRI_TRANSITIONS=172} [2022-12-13 01:43:49,827 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 83 predicate places. [2022-12-13 01:43:49,827 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:49,827 INFO L89 Accepts]: Start accepts. Operand has 101 places, 172 transitions, 2020 flow [2022-12-13 01:43:49,829 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:49,829 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:49,829 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 172 transitions, 2020 flow [2022-12-13 01:43:49,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 172 transitions, 2020 flow [2022-12-13 01:43:49,867 INFO L130 PetriNetUnfolder]: 117/229 cut-off events. [2022-12-13 01:43:49,867 INFO L131 PetriNetUnfolder]: For 779/789 co-relation queries the response was YES. [2022-12-13 01:43:49,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1331 conditions, 229 events. 117/229 cut-off events. For 779/789 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 842 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 1293. Up to 108 conditions per place. [2022-12-13 01:43:49,870 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 172 transitions, 2020 flow [2022-12-13 01:43:49,870 INFO L226 LiptonReduction]: Number of co-enabled transitions 350 [2022-12-13 01:43:49,871 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:43:49,872 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-13 01:43:49,872 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 172 transitions, 2020 flow [2022-12-13 01:43:49,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 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 01:43:49,872 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:49,872 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:49,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 01:43:50,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 01:43:50,079 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:43:50,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:50,080 INFO L85 PathProgramCache]: Analyzing trace with hash -936088720, now seen corresponding path program 2 times [2022-12-13 01:43:50,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:50,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232881684] [2022-12-13 01:43:50,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:50,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:50,896 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 01:43:50,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:50,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232881684] [2022-12-13 01:43:50,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232881684] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:43:50,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796451151] [2022-12-13 01:43:50,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 01:43:50,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:43:50,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:43:50,898 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:43:50,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 01:43:51,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 01:43:51,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 01:43:51,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 01:43:51,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:43:51,492 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 01:43:51,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:43:52,416 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 01:43:52,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796451151] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:43:52,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:43:52,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-12-13 01:43:52,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491112603] [2022-12-13 01:43:52,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:43:52,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 01:43:52,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:52,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 01:43:52,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-12-13 01:43:52,417 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 01:43:52,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 172 transitions, 2020 flow. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 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 01:43:52,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:52,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 01:43:52,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:54,325 INFO L130 PetriNetUnfolder]: 720/1139 cut-off events. [2022-12-13 01:43:54,325 INFO L131 PetriNetUnfolder]: For 4186/4186 co-relation queries the response was YES. [2022-12-13 01:43:54,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6233 conditions, 1139 events. 720/1139 cut-off events. For 4186/4186 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5008 event pairs, 0 based on Foata normal form. 8/1091 useless extension candidates. Maximal degree in co-relation 6191. Up to 365 conditions per place. [2022-12-13 01:43:54,333 INFO L137 encePairwiseOnDemand]: 9/33 looper letters, 80 selfloop transitions, 334 changer transitions 30/444 dead transitions. [2022-12-13 01:43:54,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 444 transitions, 5282 flow [2022-12-13 01:43:54,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 01:43:54,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-13 01:43:54,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 162 transitions. [2022-12-13 01:43:54,334 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15835777126099707 [2022-12-13 01:43:54,334 INFO L175 Difference]: Start difference. First operand has 98 places, 172 transitions, 2020 flow. Second operand 31 states and 162 transitions. [2022-12-13 01:43:54,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 444 transitions, 5282 flow [2022-12-13 01:43:54,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 444 transitions, 5108 flow, removed 75 selfloop flow, removed 5 redundant places. [2022-12-13 01:43:54,378 INFO L231 Difference]: Finished difference. Result has 128 places, 374 transitions, 4664 flow [2022-12-13 01:43:54,379 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1902, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=4664, PETRI_PLACES=128, PETRI_TRANSITIONS=374} [2022-12-13 01:43:54,379 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 110 predicate places. [2022-12-13 01:43:54,380 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:54,380 INFO L89 Accepts]: Start accepts. Operand has 128 places, 374 transitions, 4664 flow [2022-12-13 01:43:54,383 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:54,383 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:54,383 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 374 transitions, 4664 flow [2022-12-13 01:43:54,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 374 transitions, 4664 flow [2022-12-13 01:43:54,447 INFO L130 PetriNetUnfolder]: 247/445 cut-off events. [2022-12-13 01:43:54,447 INFO L131 PetriNetUnfolder]: For 2047/2057 co-relation queries the response was YES. [2022-12-13 01:43:54,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2683 conditions, 445 events. 247/445 cut-off events. For 2047/2057 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1833 event pairs, 0 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 2646. Up to 176 conditions per place. [2022-12-13 01:43:54,451 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 374 transitions, 4664 flow [2022-12-13 01:43:54,451 INFO L226 LiptonReduction]: Number of co-enabled transitions 754 [2022-12-13 01:43:54,497 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [345] L75-1-->L75-1: Formula: (let ((.cse0 (= (mod v_~d2~0_58 256) 0))) (and (let ((.cse1 (not (= (mod v_~g2~0_47 256) 0)))) (or (and .cse0 (= (+ 2 v_~pos~0_77) v_~pos~0_78) .cse1) (and (= (+ 2 v_~pos~0_78) v_~pos~0_77) .cse1 (not .cse0)))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0)) (.cse3 (= v_~d2~0_57 (ite (= 0 (ite .cse0 1 0)) 0 1))) (.cse4 (= v_~g2~0_46 v_~g2~0_47)) (.cse5 (= (mod v_~d2~0_57 256) 0))) (or (and .cse2 .cse3 .cse4) (and (= v_~g2~0_46 0) .cse3 (not .cse2) (not .cse5)) (and .cse3 .cse4 .cse5))))) InVars {~g2~0=v_~g2~0_47, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_78, ~d2~0=v_~d2~0_58} OutVars{~g2~0=v_~g2~0_46, ~pos~0=v_~pos~0_77, ~d2~0=v_~d2~0_57} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] and [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 01:44:03,560 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 01:44:03,561 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9181 [2022-12-13 01:44:03,561 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 369 transitions, 4632 flow [2022-12-13 01:44:03,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 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 01:44:03,561 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:03,561 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:44:03,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 01:44:03,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 01:44:03,767 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:44:03,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:03,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1376409915, now seen corresponding path program 3 times [2022-12-13 01:44:03,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:03,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468570711] [2022-12-13 01:44:03,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:03,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:04,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:44:04,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:04,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468570711] [2022-12-13 01:44:04,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468570711] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:44:04,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305553053] [2022-12-13 01:44:04,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 01:44:04,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:44:04,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:44:04,251 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:44:04,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 01:44:04,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 01:44:04,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 01:44:04,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 01:44:04,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:44:04,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:44:04,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:44:04,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:44:04,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305553053] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:44:04,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:44:04,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 11 [2022-12-13 01:44:04,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313630027] [2022-12-13 01:44:04,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:44:04,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 01:44:04,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:04,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 01:44:04,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-13 01:44:04,928 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 01:44:04,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 369 transitions, 4632 flow. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 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 01:44:04,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:04,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 01:44:04,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:05,385 INFO L130 PetriNetUnfolder]: 689/1098 cut-off events. [2022-12-13 01:44:05,385 INFO L131 PetriNetUnfolder]: For 5387/5387 co-relation queries the response was YES. [2022-12-13 01:44:05,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6439 conditions, 1098 events. 689/1098 cut-off events. For 5387/5387 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4749 event pairs, 0 based on Foata normal form. 106/1144 useless extension candidates. Maximal degree in co-relation 6399. Up to 482 conditions per place. [2022-12-13 01:44:05,392 INFO L137 encePairwiseOnDemand]: 12/41 looper letters, 192 selfloop transitions, 199 changer transitions 0/391 dead transitions. [2022-12-13 01:44:05,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 391 transitions, 5224 flow [2022-12-13 01:44:05,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:44:05,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:44:05,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-12-13 01:44:05,394 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1916376306620209 [2022-12-13 01:44:05,394 INFO L175 Difference]: Start difference. First operand has 120 places, 369 transitions, 4632 flow. Second operand 7 states and 55 transitions. [2022-12-13 01:44:05,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 391 transitions, 5224 flow [2022-12-13 01:44:05,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 391 transitions, 4137 flow, removed 444 selfloop flow, removed 11 redundant places. [2022-12-13 01:44:05,430 INFO L231 Difference]: Finished difference. Result has 114 places, 359 transitions, 3584 flow [2022-12-13 01:44:05,430 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3068, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3584, PETRI_PLACES=114, PETRI_TRANSITIONS=359} [2022-12-13 01:44:05,430 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 96 predicate places. [2022-12-13 01:44:05,431 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:05,431 INFO L89 Accepts]: Start accepts. Operand has 114 places, 359 transitions, 3584 flow [2022-12-13 01:44:05,432 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:05,432 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:05,432 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 359 transitions, 3584 flow [2022-12-13 01:44:05,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 359 transitions, 3584 flow [2022-12-13 01:44:05,485 INFO L130 PetriNetUnfolder]: 242/448 cut-off events. [2022-12-13 01:44:05,485 INFO L131 PetriNetUnfolder]: For 1328/1338 co-relation queries the response was YES. [2022-12-13 01:44:05,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2153 conditions, 448 events. 242/448 cut-off events. For 1328/1338 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1865 event pairs, 0 based on Foata normal form. 0/430 useless extension candidates. Maximal degree in co-relation 2111. Up to 116 conditions per place. [2022-12-13 01:44:05,490 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 359 transitions, 3584 flow [2022-12-13 01:44:05,490 INFO L226 LiptonReduction]: Number of co-enabled transitions 724 [2022-12-13 01:44:05,491 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:44:05,492 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-13 01:44:05,492 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 359 transitions, 3584 flow [2022-12-13 01:44:05,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 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 01:44:05,492 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:05,492 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:44:05,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 01:44:05,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 01:44:05,698 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:44:05,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:05,699 INFO L85 PathProgramCache]: Analyzing trace with hash -87507347, now seen corresponding path program 1 times [2022-12-13 01:44:05,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:05,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161941935] [2022-12-13 01:44:05,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:05,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:06,626 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:44:06,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:06,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161941935] [2022-12-13 01:44:06,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161941935] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:44:06,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75211861] [2022-12-13 01:44:06,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:06,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:44:06,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:44:06,628 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:44:06,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 01:44:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:06,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 01:44:06,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:44:07,311 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:44:07,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:44:08,755 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:44:08,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75211861] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:44:08,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:44:08,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2022-12-13 01:44:08,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374414744] [2022-12-13 01:44:08,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:44:08,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 01:44:08,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:08,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 01:44:08,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-12-13 01:44:08,757 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-13 01:44:08,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 359 transitions, 3584 flow. Second operand has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 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 01:44:08,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:08,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-13 01:44:08,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:10,033 INFO L130 PetriNetUnfolder]: 888/1397 cut-off events. [2022-12-13 01:44:10,033 INFO L131 PetriNetUnfolder]: For 3923/3923 co-relation queries the response was YES. [2022-12-13 01:44:10,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6907 conditions, 1397 events. 888/1397 cut-off events. For 3923/3923 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 6273 event pairs, 0 based on Foata normal form. 6/1357 useless extension candidates. Maximal degree in co-relation 6559. Up to 367 conditions per place. [2022-12-13 01:44:10,039 INFO L137 encePairwiseOnDemand]: 10/35 looper letters, 0 selfloop transitions, 0 changer transitions 522/522 dead transitions. [2022-12-13 01:44:10,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 522 transitions, 5762 flow [2022-12-13 01:44:10,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 01:44:10,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 01:44:10,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 93 transitions. [2022-12-13 01:44:10,040 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.16607142857142856 [2022-12-13 01:44:10,040 INFO L175 Difference]: Start difference. First operand has 114 places, 359 transitions, 3584 flow. Second operand 16 states and 93 transitions. [2022-12-13 01:44:10,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 522 transitions, 5762 flow [2022-12-13 01:44:10,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 522 transitions, 5678 flow, removed 33 selfloop flow, removed 3 redundant places. [2022-12-13 01:44:10,073 INFO L231 Difference]: Finished difference. Result has 125 places, 0 transitions, 0 flow [2022-12-13 01:44:10,073 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3531, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=0, PETRI_PLACES=125, PETRI_TRANSITIONS=0} [2022-12-13 01:44:10,073 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 107 predicate places. [2022-12-13 01:44:10,073 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:10,074 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 0 transitions, 0 flow [2022-12-13 01:44:10,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 01:44:10,074 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 01:44:10,074 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:44:10,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-13 01:44:10,074 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 01:44:10,074 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 01:44:10,074 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:44:10,075 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 01:44:10,075 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 01:44:10,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 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 01:44:10,077 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 01:44:10,078 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 01:44:10,078 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 01:44:10,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 01:44:10,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 01:44:10,281 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:44:10,284 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 01:44:10,284 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 01:44:10,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:44:10 BasicIcfg [2022-12-13 01:44:10,287 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 01:44:10,287 INFO L158 Benchmark]: Toolchain (without parser) took 85174.38ms. Allocated memory was 179.3MB in the beginning and 350.2MB in the end (delta: 170.9MB). Free memory was 155.2MB in the beginning and 211.3MB in the end (delta: -56.1MB). Peak memory consumption was 115.8MB. Max. memory is 8.0GB. [2022-12-13 01:44:10,287 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 179.3MB. Free memory is still 155.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 01:44:10,287 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.71ms. Allocated memory is still 179.3MB. Free memory was 155.2MB in the beginning and 143.1MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 01:44:10,288 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.63ms. Allocated memory is still 179.3MB. Free memory was 143.1MB in the beginning and 141.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 01:44:10,288 INFO L158 Benchmark]: Boogie Preprocessor took 35.50ms. Allocated memory is still 179.3MB. Free memory was 141.5MB in the beginning and 140.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 01:44:10,288 INFO L158 Benchmark]: RCFGBuilder took 422.54ms. Allocated memory is still 179.3MB. Free memory was 140.1MB in the beginning and 126.4MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 01:44:10,288 INFO L158 Benchmark]: TraceAbstraction took 84425.49ms. Allocated memory was 179.3MB in the beginning and 350.2MB in the end (delta: 170.9MB). Free memory was 125.4MB in the beginning and 211.3MB in the end (delta: -85.9MB). Peak memory consumption was 86.4MB. Max. memory is 8.0GB. [2022-12-13 01:44:10,290 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 179.3MB. Free memory is still 155.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 239.71ms. Allocated memory is still 179.3MB. Free memory was 155.2MB in the beginning and 143.1MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.63ms. Allocated memory is still 179.3MB. Free memory was 143.1MB in the beginning and 141.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.50ms. Allocated memory is still 179.3MB. Free memory was 141.5MB in the beginning and 140.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 422.54ms. Allocated memory is still 179.3MB. Free memory was 140.1MB in the beginning and 126.4MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 84425.49ms. Allocated memory was 179.3MB in the beginning and 350.2MB in the end (delta: 170.9MB). Free memory was 125.4MB in the beginning and 211.3MB in the end (delta: -85.9MB). Peak memory consumption was 86.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 76 PlacesBefore, 18 PlacesAfterwards, 80 TransitionsBefore, 13 TransitionsAfterwards, 1088 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 29 TrivialYvCompositions, 29 ConcurrentYvCompositions, 7 ChoiceCompositions, 65 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 592, independent: 592, independent conditional: 592, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 592, independent: 592, independent conditional: 0, independent unconditional: 592, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 592, independent: 592, independent conditional: 0, independent unconditional: 592, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 592, independent: 592, independent conditional: 0, independent unconditional: 592, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 499, independent: 499, independent conditional: 0, independent unconditional: 499, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 499, independent: 497, independent conditional: 0, independent unconditional: 497, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 592, independent: 93, independent conditional: 0, independent unconditional: 93, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 499, unknown conditional: 0, unknown unconditional: 499] , Statistics on independence cache: Total cache size (in pairs): 901, Positive cache size: 901, Positive conditional cache size: 0, Positive unconditional cache size: 901, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 17 PlacesBefore, 17 PlacesAfterwards, 14 TransitionsBefore, 14 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 19 PlacesBefore, 19 PlacesAfterwards, 15 TransitionsBefore, 15 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 36 PlacesBefore, 33 PlacesAfterwards, 29 TransitionsBefore, 26 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 16, independent conditional: 14, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 14, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 10, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 10, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 31, Positive conditional cache size: 30, Positive unconditional cache size: 1, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.6s, 40 PlacesBefore, 39 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 152 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 32, independent: 32, independent conditional: 28, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32, independent: 32, independent conditional: 28, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32, independent: 32, independent conditional: 28, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 7, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, independent: 22, independent conditional: 21, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 7, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 92, Positive conditional cache size: 88, Positive unconditional cache size: 4, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 36 PlacesBefore, 36 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 94, Positive conditional cache size: 90, Positive unconditional cache size: 4, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 38 PlacesBefore, 37 PlacesAfterwards, 48 TransitionsBefore, 47 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 97, Positive conditional cache size: 93, Positive unconditional cache size: 4, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 97, Positive conditional cache size: 93, Positive unconditional cache size: 4, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 48 PlacesBefore, 46 PlacesAfterwards, 57 TransitionsBefore, 55 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 111, Positive conditional cache size: 107, Positive unconditional cache size: 4, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 111, Positive conditional cache size: 107, Positive unconditional cache size: 4, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 62 PlacesBefore, 62 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 112, Positive conditional cache size: 108, Positive unconditional cache size: 4, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 112, Positive conditional cache size: 108, Positive unconditional cache size: 4, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 86 PlacesBefore, 85 PlacesAfterwards, 140 TransitionsBefore, 139 TransitionsAfterwards, 286 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 132, Positive conditional cache size: 128, Positive unconditional cache size: 4, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 98 PlacesBefore, 98 PlacesAfterwards, 172 TransitionsBefore, 172 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 132, Positive conditional cache size: 128, Positive unconditional cache size: 4, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.1s, 125 PlacesBefore, 120 PlacesAfterwards, 374 TransitionsBefore, 369 TransitionsAfterwards, 754 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 155, Positive conditional cache size: 151, Positive unconditional cache size: 4, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 114 PlacesBefore, 114 PlacesAfterwards, 359 TransitionsBefore, 359 TransitionsAfterwards, 724 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 155, Positive conditional cache size: 151, Positive unconditional cache size: 4, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 155, Positive conditional cache size: 151, Positive unconditional cache size: 4, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 101]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 108 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 84.3s, OverallIterations: 16, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 975 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 975 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3010 IncrementalHoareTripleChecker+Invalid, 4112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1102 mSolverCounterUnsat, 0 mSDtfsCounter, 3010 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 419 GetRequests, 187 SyntacticMatches, 20 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4664occurred in iteration=14, InterpolantAutomatonStates: 176, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 17.1s InterpolantComputationTime, 353 NumberOfCodeBlocks, 353 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 463 ConstructedInterpolants, 0 QuantifiedInterpolants, 5485 SizeOfPredicates, 93 NumberOfNonLiveVariables, 1356 ConjunctsInSsa, 227 ConjunctsInUnsatCore, 38 InterpolantComputations, 5 PerfectInterpolantSequences, 15/110 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 01:44:10,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...