/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/pthread/fib_unsafe-10.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:17:09,000 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:17:09,002 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:17:09,083 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:17:09,083 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:17:09,086 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:17:09,090 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:17:09,094 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:17:09,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:17:09,105 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:17:09,106 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:17:09,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:17:09,108 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:17:09,110 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:17:09,111 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:17:09,112 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:17:09,113 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:17:09,114 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:17:09,116 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:17:09,122 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:17:09,124 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:17:09,125 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:17:09,125 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:17:09,126 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:17:09,129 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:17:09,129 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:17:09,129 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:17:09,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:17:09,131 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:17:09,132 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:17:09,132 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:17:09,138 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:17:09,139 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:17:09,140 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:17:09,140 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:17:09,141 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:17:09,141 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:17:09,141 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:17:09,141 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:17:09,142 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:17:09,143 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:17:09,144 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 00:17:09,184 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:17:09,184 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:17:09,201 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:17:09,201 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:17:09,201 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:17:09,202 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:17:09,202 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:17:09,202 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:17:09,202 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:17:09,202 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:17:09,203 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:17:09,203 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:17:09,203 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:17:09,204 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:17:09,204 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:17:09,204 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:17:09,204 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:17:09,204 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:17:09,204 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:17:09,204 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:17:09,204 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:17:09,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:17:09,205 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:17:09,205 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:17:09,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:17:09,205 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:17:09,205 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:17:09,205 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:17:09,206 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 00:17:09,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:17:09,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:17:09,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:17:09,817 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:17:09,818 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:17:09,819 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-10.i [2022-12-13 00:17:11,664 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:17:12,164 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:17:12,165 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-10.i [2022-12-13 00:17:12,197 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c54c43023/ff8079d9b3f3448e82a1eff546052190/FLAG1539089c6 [2022-12-13 00:17:12,229 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c54c43023/ff8079d9b3f3448e82a1eff546052190 [2022-12-13 00:17:12,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:17:12,239 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:17:12,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:17:12,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:17:12,242 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:17:12,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:17:12" (1/1) ... [2022-12-13 00:17:12,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@578b3d67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:12, skipping insertion in model container [2022-12-13 00:17:12,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:17:12" (1/1) ... [2022-12-13 00:17:12,266 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:17:12,334 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:17:12,793 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-10.i[30243,30256] [2022-12-13 00:17:12,800 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:17:12,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:17:12,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:17:12,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:17:12,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:17:12,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:17:12,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:17:12,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:17:12,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:17:12,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:17:12,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:17:12,825 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:17:12,865 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-10.i[30243,30256] [2022-12-13 00:17:12,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:17:12,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:17:12,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:17:12,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:17:12,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:17:12,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:17:12,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:17:12,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:17:12,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:17:12,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:17:12,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:17:12,952 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:17:12,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:12 WrapperNode [2022-12-13 00:17:12,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:17:12,954 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:17:12,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:17:12,954 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:17:12,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:12" (1/1) ... [2022-12-13 00:17:13,013 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:12" (1/1) ... [2022-12-13 00:17:13,053 INFO L138 Inliner]: procedures = 165, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2022-12-13 00:17:13,055 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:17:13,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:17:13,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:17:13,057 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:17:13,064 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:12" (1/1) ... [2022-12-13 00:17:13,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:12" (1/1) ... [2022-12-13 00:17:13,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:12" (1/1) ... [2022-12-13 00:17:13,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:12" (1/1) ... [2022-12-13 00:17:13,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:12" (1/1) ... [2022-12-13 00:17:13,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:12" (1/1) ... [2022-12-13 00:17:13,110 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:12" (1/1) ... [2022-12-13 00:17:13,111 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:12" (1/1) ... [2022-12-13 00:17:13,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:17:13,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:17:13,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:17:13,113 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:17:13,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:12" (1/1) ... [2022-12-13 00:17:13,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:17:13,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:17:13,181 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 00:17:13,251 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 00:17:13,283 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-13 00:17:13,284 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-13 00:17:13,284 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-13 00:17:13,284 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-13 00:17:13,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:17:13,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:17:13,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:17:13,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:17:13,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:17:13,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:17:13,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:17:13,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:17:13,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:17:13,287 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 00:17:13,506 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:17:13,508 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:17:13,745 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:17:13,753 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:17:13,753 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 00:17:13,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:17:13 BoogieIcfgContainer [2022-12-13 00:17:13,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:17:13,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:17:13,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:17:13,760 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:17:13,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:17:12" (1/3) ... [2022-12-13 00:17:13,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66067d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:17:13, skipping insertion in model container [2022-12-13 00:17:13,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:12" (2/3) ... [2022-12-13 00:17:13,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66067d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:17:13, skipping insertion in model container [2022-12-13 00:17:13,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:17:13" (3/3) ... [2022-12-13 00:17:13,763 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-10.i [2022-12-13 00:17:13,783 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:17:13,783 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 00:17:13,783 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:17:13,851 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:17:13,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 93 transitions, 196 flow [2022-12-13 00:17:13,964 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-13 00:17:13,965 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:17:13,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 7/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-13 00:17:13,971 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 93 transitions, 196 flow [2022-12-13 00:17:13,977 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 91 transitions, 188 flow [2022-12-13 00:17:13,978 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:17:14,001 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-13 00:17:14,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 91 transitions, 188 flow [2022-12-13 00:17:14,042 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-13 00:17:14,042 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:17:14,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 7/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-13 00:17:14,052 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-13 00:17:14,052 INFO L226 LiptonReduction]: Number of co-enabled transitions 1914 [2022-12-13 00:17:18,657 INFO L241 LiptonReduction]: Total number of compositions: 79 [2022-12-13 00:17:18,682 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:17:18,690 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;@747bd6d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:17:18,690 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 00:17:18,712 INFO L130 PetriNetUnfolder]: 3/26 cut-off events. [2022-12-13 00:17:18,713 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:17:18,713 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:17:18,714 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 00:17:18,715 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 00:17:18,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:17:18,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1807783243, now seen corresponding path program 1 times [2022-12-13 00:17:18,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:17:18,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733319093] [2022-12-13 00:17:18,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:18,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:17:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:19,166 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 00:17:19,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:17:19,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733319093] [2022-12-13 00:17:19,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733319093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:17:19,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:17:19,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:17:19,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034967218] [2022-12-13 00:17:19,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:17:19,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:17:19,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:17:19,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:17:19,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:17:19,213 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 00:17:19,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 00:17:19,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:17:19,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 00:17:19,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:17:19,541 INFO L130 PetriNetUnfolder]: 657/1007 cut-off events. [2022-12-13 00:17:19,541 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 00:17:19,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2023 conditions, 1007 events. 657/1007 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4231 event pairs, 175 based on Foata normal form. 0/387 useless extension candidates. Maximal degree in co-relation 2013. Up to 641 conditions per place. [2022-12-13 00:17:19,554 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 38 selfloop transitions, 2 changer transitions 1/45 dead transitions. [2022-12-13 00:17:19,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 45 transitions, 178 flow [2022-12-13 00:17:19,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:17:19,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:17:19,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-13 00:17:19,587 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2022-12-13 00:17:19,589 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 62 flow. Second operand 3 states and 55 transitions. [2022-12-13 00:17:19,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 45 transitions, 178 flow [2022-12-13 00:17:19,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 45 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:17:19,595 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 70 flow [2022-12-13 00:17:19,596 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2022-12-13 00:17:19,601 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2022-12-13 00:17:19,601 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:17:19,602 INFO L89 Accepts]: Start accepts. Operand has 33 places, 28 transitions, 70 flow [2022-12-13 00:17:19,605 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:17:19,605 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:17:19,605 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 28 transitions, 70 flow [2022-12-13 00:17:19,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 28 transitions, 70 flow [2022-12-13 00:17:19,610 INFO L130 PetriNetUnfolder]: 3/28 cut-off events. [2022-12-13 00:17:19,610 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:17:19,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 28 events. 3/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 32. Up to 4 conditions per place. [2022-12-13 00:17:19,632 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 28 transitions, 70 flow [2022-12-13 00:17:19,633 INFO L226 LiptonReduction]: Number of co-enabled transitions 400 [2022-12-13 00:17:19,634 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:17:19,636 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-13 00:17:19,639 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 70 flow [2022-12-13 00:17:19,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 00:17:19,645 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:17:19,645 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:17:19,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:17:19,645 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 00:17:19,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:17:19,646 INFO L85 PathProgramCache]: Analyzing trace with hash 206704716, now seen corresponding path program 1 times [2022-12-13 00:17:19,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:17:19,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177570567] [2022-12-13 00:17:19,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:19,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:17:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:19,821 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 00:17:19,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:17:19,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177570567] [2022-12-13 00:17:19,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177570567] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:17:19,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870827342] [2022-12-13 00:17:19,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:19,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:19,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:17:19,830 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 00:17:19,831 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 00:17:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:20,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 00:17:20,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:17:20,071 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 00:17:20,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:17:20,111 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 00:17:20,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870827342] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:17:20,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:17:20,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 00:17:20,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460780098] [2022-12-13 00:17:20,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:17:20,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:17:20,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:17:20,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:17:20,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:17:20,114 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-13 00:17:20,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 70 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 00:17:20,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:17:20,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-13 00:17:20,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:17:20,504 INFO L130 PetriNetUnfolder]: 913/1391 cut-off events. [2022-12-13 00:17:20,505 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-12-13 00:17:20,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3240 conditions, 1391 events. 913/1391 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5791 event pairs, 175 based on Foata normal form. 0/643 useless extension candidates. Maximal degree in co-relation 3229. Up to 449 conditions per place. [2022-12-13 00:17:20,526 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 86 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2022-12-13 00:17:20,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 95 transitions, 392 flow [2022-12-13 00:17:20,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:17:20,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:17:20,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2022-12-13 00:17:20,537 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7283950617283951 [2022-12-13 00:17:20,537 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 70 flow. Second operand 6 states and 118 transitions. [2022-12-13 00:17:20,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 95 transitions, 392 flow [2022-12-13 00:17:20,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 95 transitions, 390 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:17:20,541 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:20,541 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=104, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2022-12-13 00:17:20,542 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2022-12-13 00:17:20,542 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:17:20,543 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:20,544 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:17:20,544 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:17:20,544 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:20,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:20,547 INFO L130 PetriNetUnfolder]: 3/31 cut-off events. [2022-12-13 00:17:20,547 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 00:17:20,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 31 events. 3/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 48. Up to 7 conditions per place. [2022-12-13 00:17:20,565 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:20,565 INFO L226 LiptonReduction]: Number of co-enabled transitions 520 [2022-12-13 00:17:20,823 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:17:20,825 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 283 [2022-12-13 00:17:20,825 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 86 flow [2022-12-13 00:17:20,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 00:17:20,825 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:17:20,825 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:17:20,834 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 00:17:21,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:21,027 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 00:17:21,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:17:21,027 INFO L85 PathProgramCache]: Analyzing trace with hash 206706204, now seen corresponding path program 1 times [2022-12-13 00:17:21,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:17:21,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524611964] [2022-12-13 00:17:21,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:21,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:17:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:21,158 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 00:17:21,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:17:21,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524611964] [2022-12-13 00:17:21,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524611964] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:17:21,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361490718] [2022-12-13 00:17:21,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:21,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:21,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:17:21,174 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 00:17:21,204 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 00:17:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:21,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 00:17:21,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:17:21,293 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 00:17:21,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:17:21,355 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 00:17:21,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361490718] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:17:21,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:17:21,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 00:17:21,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127547401] [2022-12-13 00:17:21,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:17:21,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:17:21,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:17:21,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:17:21,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:17:21,358 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 00:17:21,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 86 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 00:17:21,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:17:21,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 00:17:21,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:17:21,614 INFO L130 PetriNetUnfolder]: 913/1391 cut-off events. [2022-12-13 00:17:21,614 INFO L131 PetriNetUnfolder]: For 1456/1456 co-relation queries the response was YES. [2022-12-13 00:17:21,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3884 conditions, 1391 events. 913/1391 cut-off events. For 1456/1456 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5791 event pairs, 175 based on Foata normal form. 192/899 useless extension candidates. Maximal degree in co-relation 3869. Up to 449 conditions per place. [2022-12-13 00:17:21,648 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 86 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2022-12-13 00:17:21,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 95 transitions, 414 flow [2022-12-13 00:17:21,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:17:21,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:17:21,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2022-12-13 00:17:21,665 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7023809523809523 [2022-12-13 00:17:21,665 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 86 flow. Second operand 6 states and 118 transitions. [2022-12-13 00:17:21,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 95 transitions, 414 flow [2022-12-13 00:17:21,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 95 transitions, 390 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-13 00:17:21,699 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:21,700 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=104, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2022-12-13 00:17:21,702 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2022-12-13 00:17:21,702 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:17:21,702 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:21,703 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:17:21,704 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:17:21,704 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:21,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:21,707 INFO L130 PetriNetUnfolder]: 3/31 cut-off events. [2022-12-13 00:17:21,708 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 00:17:21,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 31 events. 3/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 48. Up to 7 conditions per place. [2022-12-13 00:17:21,709 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:21,709 INFO L226 LiptonReduction]: Number of co-enabled transitions 520 [2022-12-13 00:17:22,070 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:17:22,072 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 370 [2022-12-13 00:17:22,072 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 86 flow [2022-12-13 00:17:22,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 00:17:22,072 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:17:22,072 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:17:22,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 00:17:22,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-12-13 00:17:22,273 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 00:17:22,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:17:22,273 INFO L85 PathProgramCache]: Analyzing trace with hash 206706297, now seen corresponding path program 1 times [2022-12-13 00:17:22,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:17:22,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101168492] [2022-12-13 00:17:22,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:22,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:17:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:22,371 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 00:17:22,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:17:22,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101168492] [2022-12-13 00:17:22,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101168492] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:17:22,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648728459] [2022-12-13 00:17:22,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:22,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:22,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:17:22,387 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 00:17:22,483 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 00:17:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:22,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 00:17:22,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:17:22,607 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 00:17:22,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:17:22,618 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 00:17:22,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648728459] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:17:22,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:17:22,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 00:17:22,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776726804] [2022-12-13 00:17:22,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:17:22,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:17:22,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:17:22,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:17:22,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:17:22,619 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 00:17:22,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 86 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 00:17:22,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:17:22,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 00:17:22,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:17:23,028 INFO L130 PetriNetUnfolder]: 913/1391 cut-off events. [2022-12-13 00:17:23,028 INFO L131 PetriNetUnfolder]: For 1456/1456 co-relation queries the response was YES. [2022-12-13 00:17:23,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3884 conditions, 1391 events. 913/1391 cut-off events. For 1456/1456 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5791 event pairs, 175 based on Foata normal form. 192/899 useless extension candidates. Maximal degree in co-relation 3869. Up to 449 conditions per place. [2022-12-13 00:17:23,060 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 86 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2022-12-13 00:17:23,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 95 transitions, 414 flow [2022-12-13 00:17:23,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:17:23,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:17:23,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2022-12-13 00:17:23,064 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7023809523809523 [2022-12-13 00:17:23,064 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 86 flow. Second operand 6 states and 118 transitions. [2022-12-13 00:17:23,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 95 transitions, 414 flow [2022-12-13 00:17:23,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 95 transitions, 390 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-13 00:17:23,070 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:23,070 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=104, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2022-12-13 00:17:23,074 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2022-12-13 00:17:23,074 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:17:23,074 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:23,076 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:17:23,076 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:17:23,076 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:23,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:23,085 INFO L130 PetriNetUnfolder]: 3/31 cut-off events. [2022-12-13 00:17:23,085 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 00:17:23,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 31 events. 3/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 48. Up to 7 conditions per place. [2022-12-13 00:17:23,086 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:23,086 INFO L226 LiptonReduction]: Number of co-enabled transitions 520 [2022-12-13 00:17:23,558 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:17:23,559 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 485 [2022-12-13 00:17:23,559 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 86 flow [2022-12-13 00:17:23,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 00:17:23,559 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:17:23,559 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:17:23,571 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 00:17:23,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:23,760 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 00:17:23,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:17:23,761 INFO L85 PathProgramCache]: Analyzing trace with hash 206706390, now seen corresponding path program 1 times [2022-12-13 00:17:23,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:17:23,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930519882] [2022-12-13 00:17:23,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:23,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:17:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:23,850 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 00:17:23,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:17:23,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930519882] [2022-12-13 00:17:23,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930519882] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:17:23,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420002161] [2022-12-13 00:17:23,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:23,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:23,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:17:23,868 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 00:17:23,911 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 00:17:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:23,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 00:17:23,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:17:23,998 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 00:17:23,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:17:24,014 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 00:17:24,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420002161] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:17:24,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:17:24,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 00:17:24,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543187272] [2022-12-13 00:17:24,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:17:24,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:17:24,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:17:24,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:17:24,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:17:24,026 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 00:17:24,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 86 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 00:17:24,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:17:24,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 00:17:24,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:17:24,313 INFO L130 PetriNetUnfolder]: 913/1391 cut-off events. [2022-12-13 00:17:24,314 INFO L131 PetriNetUnfolder]: For 1456/1456 co-relation queries the response was YES. [2022-12-13 00:17:24,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3884 conditions, 1391 events. 913/1391 cut-off events. For 1456/1456 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5791 event pairs, 175 based on Foata normal form. 192/899 useless extension candidates. Maximal degree in co-relation 3869. Up to 449 conditions per place. [2022-12-13 00:17:24,339 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 86 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2022-12-13 00:17:24,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 95 transitions, 414 flow [2022-12-13 00:17:24,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:17:24,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:17:24,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2022-12-13 00:17:24,341 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7023809523809523 [2022-12-13 00:17:24,341 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 86 flow. Second operand 6 states and 118 transitions. [2022-12-13 00:17:24,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 95 transitions, 414 flow [2022-12-13 00:17:24,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 95 transitions, 390 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-13 00:17:24,347 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:24,347 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=104, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2022-12-13 00:17:24,363 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2022-12-13 00:17:24,363 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:17:24,363 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:24,365 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:17:24,365 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:17:24,365 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:24,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:24,369 INFO L130 PetriNetUnfolder]: 3/31 cut-off events. [2022-12-13 00:17:24,369 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 00:17:24,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 31 events. 3/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 48. Up to 7 conditions per place. [2022-12-13 00:17:24,369 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:24,370 INFO L226 LiptonReduction]: Number of co-enabled transitions 520 [2022-12-13 00:17:24,626 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:17:24,627 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 264 [2022-12-13 00:17:24,627 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 86 flow [2022-12-13 00:17:24,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 00:17:24,627 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:17:24,628 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:17:24,640 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 00:17:24,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:24,828 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 00:17:24,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:17:24,829 INFO L85 PathProgramCache]: Analyzing trace with hash 206706483, now seen corresponding path program 1 times [2022-12-13 00:17:24,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:17:24,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739972299] [2022-12-13 00:17:24,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:24,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:17:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:24,870 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 00:17:24,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:17:24,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739972299] [2022-12-13 00:17:24,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739972299] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:17:24,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396840555] [2022-12-13 00:17:24,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:24,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:24,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:17:24,872 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 00:17:24,889 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 00:17:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:24,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 00:17:24,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:17:24,963 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 00:17:24,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:17:24,975 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 00:17:24,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396840555] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:17:24,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:17:24,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 00:17:24,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298412091] [2022-12-13 00:17:24,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:17:24,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:17:24,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:17:24,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:17:24,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:17:24,977 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 00:17:24,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 86 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 00:17:24,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:17:24,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 00:17:24,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:17:25,134 INFO L130 PetriNetUnfolder]: 785/1199 cut-off events. [2022-12-13 00:17:25,134 INFO L131 PetriNetUnfolder]: For 1264/1264 co-relation queries the response was YES. [2022-12-13 00:17:25,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3372 conditions, 1199 events. 785/1199 cut-off events. For 1264/1264 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4960 event pairs, 175 based on Foata normal form. 128/739 useless extension candidates. Maximal degree in co-relation 3357. Up to 449 conditions per place. [2022-12-13 00:17:25,143 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 70 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2022-12-13 00:17:25,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 78 transitions, 342 flow [2022-12-13 00:17:25,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:17:25,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:17:25,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-13 00:17:25,145 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2022-12-13 00:17:25,145 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 86 flow. Second operand 5 states and 96 transitions. [2022-12-13 00:17:25,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 78 transitions, 342 flow [2022-12-13 00:17:25,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 78 transitions, 320 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-13 00:17:25,150 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:25,150 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2022-12-13 00:17:25,152 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2022-12-13 00:17:25,152 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:17:25,152 INFO L89 Accepts]: Start accepts. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:25,152 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:17:25,153 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:17:25,153 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:25,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:25,156 INFO L130 PetriNetUnfolder]: 3/30 cut-off events. [2022-12-13 00:17:25,157 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 00:17:25,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 30 events. 3/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 43. Up to 6 conditions per place. [2022-12-13 00:17:25,157 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:25,157 INFO L226 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-13 00:17:25,317 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:17:25,317 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-13 00:17:25,317 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 82 flow [2022-12-13 00:17:25,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 00:17:25,318 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:17:25,318 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:17:25,330 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 00:17:25,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:25,519 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 00:17:25,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:17:25,519 INFO L85 PathProgramCache]: Analyzing trace with hash 206706545, now seen corresponding path program 1 times [2022-12-13 00:17:25,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:17:25,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42318875] [2022-12-13 00:17:25,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:25,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:17:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:25,570 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 00:17:25,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:17:25,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42318875] [2022-12-13 00:17:25,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42318875] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:17:25,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173377998] [2022-12-13 00:17:25,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:25,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:25,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:17:25,576 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 00:17:25,578 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 00:17:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:25,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 00:17:25,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:17:25,652 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 00:17:25,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:17:25,670 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 00:17:25,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173377998] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:17:25,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:17:25,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 00:17:25,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161160932] [2022-12-13 00:17:25,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:17:25,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:17:25,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:17:25,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:17:25,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:17:25,672 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 00:17:25,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 82 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 00:17:25,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:17:25,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 00:17:25,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:17:25,817 INFO L130 PetriNetUnfolder]: 785/1199 cut-off events. [2022-12-13 00:17:25,817 INFO L131 PetriNetUnfolder]: For 704/704 co-relation queries the response was YES. [2022-12-13 00:17:25,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3243 conditions, 1199 events. 785/1199 cut-off events. For 704/704 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4960 event pairs, 175 based on Foata normal form. 128/739 useless extension candidates. Maximal degree in co-relation 3229. Up to 449 conditions per place. [2022-12-13 00:17:25,824 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 70 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2022-12-13 00:17:25,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 78 transitions, 338 flow [2022-12-13 00:17:25,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:17:25,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:17:25,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-13 00:17:25,826 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2022-12-13 00:17:25,826 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 82 flow. Second operand 5 states and 96 transitions. [2022-12-13 00:17:25,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 78 transitions, 338 flow [2022-12-13 00:17:25,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 78 transitions, 320 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-13 00:17:25,830 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:25,830 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2022-12-13 00:17:25,831 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2022-12-13 00:17:25,831 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:17:25,831 INFO L89 Accepts]: Start accepts. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:25,832 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:17:25,832 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:17:25,832 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:25,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:25,836 INFO L130 PetriNetUnfolder]: 3/30 cut-off events. [2022-12-13 00:17:25,836 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 00:17:25,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 30 events. 3/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 43. Up to 6 conditions per place. [2022-12-13 00:17:25,837 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:25,838 INFO L226 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-13 00:17:26,013 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:17:26,014 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-13 00:17:26,014 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 82 flow [2022-12-13 00:17:26,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 00:17:26,015 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:17:26,015 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:17:26,028 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 00:17:26,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:26,221 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 00:17:26,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:17:26,222 INFO L85 PathProgramCache]: Analyzing trace with hash 206706607, now seen corresponding path program 1 times [2022-12-13 00:17:26,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:17:26,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819659513] [2022-12-13 00:17:26,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:26,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:17:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:26,372 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 00:17:26,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:17:26,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819659513] [2022-12-13 00:17:26,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819659513] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:17:26,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362937734] [2022-12-13 00:17:26,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:26,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:26,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:17:26,387 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 00:17:26,415 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 00:17:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:26,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 00:17:26,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:17:26,532 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 00:17:26,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:17:26,544 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 00:17:26,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362937734] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:17:26,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:17:26,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 00:17:26,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476559299] [2022-12-13 00:17:26,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:17:26,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:17:26,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:17:26,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:17:26,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:17:26,546 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 00:17:26,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 82 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 00:17:26,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:17:26,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 00:17:26,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:17:26,736 INFO L130 PetriNetUnfolder]: 785/1199 cut-off events. [2022-12-13 00:17:26,736 INFO L131 PetriNetUnfolder]: For 704/704 co-relation queries the response was YES. [2022-12-13 00:17:26,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3243 conditions, 1199 events. 785/1199 cut-off events. For 704/704 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4960 event pairs, 175 based on Foata normal form. 128/739 useless extension candidates. Maximal degree in co-relation 3229. Up to 449 conditions per place. [2022-12-13 00:17:26,743 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 70 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2022-12-13 00:17:26,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 78 transitions, 338 flow [2022-12-13 00:17:26,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:17:26,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:17:26,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-13 00:17:26,745 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2022-12-13 00:17:26,746 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 82 flow. Second operand 5 states and 96 transitions. [2022-12-13 00:17:26,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 78 transitions, 338 flow [2022-12-13 00:17:26,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 78 transitions, 320 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-13 00:17:26,749 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:26,749 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2022-12-13 00:17:26,764 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2022-12-13 00:17:26,765 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:17:26,765 INFO L89 Accepts]: Start accepts. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:26,766 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:17:26,766 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:17:26,766 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:26,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:26,771 INFO L130 PetriNetUnfolder]: 3/30 cut-off events. [2022-12-13 00:17:26,771 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 00:17:26,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 30 events. 3/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 43. Up to 6 conditions per place. [2022-12-13 00:17:26,772 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:26,772 INFO L226 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-13 00:17:26,927 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:17:26,927 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-13 00:17:26,928 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 82 flow [2022-12-13 00:17:26,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 00:17:26,928 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:17:26,928 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:17:26,937 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 00:17:27,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:27,129 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 00:17:27,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:17:27,129 INFO L85 PathProgramCache]: Analyzing trace with hash 206706669, now seen corresponding path program 1 times [2022-12-13 00:17:27,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:17:27,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447193600] [2022-12-13 00:17:27,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:27,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:17:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:27,166 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 00:17:27,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:17:27,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447193600] [2022-12-13 00:17:27,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447193600] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:17:27,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759839178] [2022-12-13 00:17:27,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:27,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:27,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:17:27,169 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 00:17:27,180 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 00:17:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:27,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 00:17:27,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:17:27,250 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 00:17:27,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:17:27,261 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 00:17:27,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759839178] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:17:27,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:17:27,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 00:17:27,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997066059] [2022-12-13 00:17:27,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:17:27,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:17:27,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:17:27,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:17:27,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:17:27,266 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 00:17:27,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 82 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 00:17:27,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:17:27,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 00:17:27,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:17:27,400 INFO L130 PetriNetUnfolder]: 785/1199 cut-off events. [2022-12-13 00:17:27,400 INFO L131 PetriNetUnfolder]: For 704/704 co-relation queries the response was YES. [2022-12-13 00:17:27,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3243 conditions, 1199 events. 785/1199 cut-off events. For 704/704 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4956 event pairs, 175 based on Foata normal form. 128/739 useless extension candidates. Maximal degree in co-relation 3229. Up to 449 conditions per place. [2022-12-13 00:17:27,408 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 70 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2022-12-13 00:17:27,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 78 transitions, 338 flow [2022-12-13 00:17:27,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:17:27,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:17:27,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-13 00:17:27,409 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2022-12-13 00:17:27,409 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 82 flow. Second operand 5 states and 96 transitions. [2022-12-13 00:17:27,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 78 transitions, 338 flow [2022-12-13 00:17:27,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 78 transitions, 320 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-13 00:17:27,412 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:27,412 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2022-12-13 00:17:27,413 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2022-12-13 00:17:27,413 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:17:27,413 INFO L89 Accepts]: Start accepts. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:27,414 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:17:27,414 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:17:27,414 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:27,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:27,417 INFO L130 PetriNetUnfolder]: 3/30 cut-off events. [2022-12-13 00:17:27,417 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 00:17:27,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 30 events. 3/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 43. Up to 6 conditions per place. [2022-12-13 00:17:27,418 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:27,418 INFO L226 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-13 00:17:27,581 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:17:27,582 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-13 00:17:27,582 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 82 flow [2022-12-13 00:17:27,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 00:17:27,582 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:17:27,582 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:17:27,592 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 00:17:27,782 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,SelfDestructingSolverStorable8 [2022-12-13 00:17:27,783 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 00:17:27,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:17:27,783 INFO L85 PathProgramCache]: Analyzing trace with hash 206706731, now seen corresponding path program 1 times [2022-12-13 00:17:27,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:17:27,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320478981] [2022-12-13 00:17:27,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:27,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:17:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:27,819 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 00:17:27,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:17:27,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320478981] [2022-12-13 00:17:27,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320478981] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:17:27,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607282067] [2022-12-13 00:17:27,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:27,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:27,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:17:27,821 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 00:17:27,824 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 00:17:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:27,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 00:17:27,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:17:27,896 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 00:17:27,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:17:27,903 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 00:17:27,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607282067] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:17:27,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:17:27,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-12-13 00:17:27,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350052212] [2022-12-13 00:17:27,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:17:27,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:17:27,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:17:27,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:17:27,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:17:27,905 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 00:17:27,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:27,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:17:27,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 00:17:27,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:17:28,000 INFO L130 PetriNetUnfolder]: 657/1007 cut-off events. [2022-12-13 00:17:28,001 INFO L131 PetriNetUnfolder]: For 640/640 co-relation queries the response was YES. [2022-12-13 00:17:28,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2731 conditions, 1007 events. 657/1007 cut-off events. For 640/640 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4123 event pairs, 175 based on Foata normal form. 64/579 useless extension candidates. Maximal degree in co-relation 2717. Up to 449 conditions per place. [2022-12-13 00:17:28,006 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 54 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2022-12-13 00:17:28,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 61 transitions, 266 flow [2022-12-13 00:17:28,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:17:28,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:17:28,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-13 00:17:28,008 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6607142857142857 [2022-12-13 00:17:28,008 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 82 flow. Second operand 4 states and 74 transitions. [2022-12-13 00:17:28,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 61 transitions, 266 flow [2022-12-13 00:17:28,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 61 transitions, 250 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-13 00:17:28,012 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 84 flow [2022-12-13 00:17:28,013 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2022-12-13 00:17:28,013 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2022-12-13 00:17:28,013 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:17:28,013 INFO L89 Accepts]: Start accepts. Operand has 35 places, 29 transitions, 84 flow [2022-12-13 00:17:28,014 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:17:28,014 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:17:28,014 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 29 transitions, 84 flow [2022-12-13 00:17:28,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 29 transitions, 84 flow [2022-12-13 00:17:28,017 INFO L130 PetriNetUnfolder]: 3/29 cut-off events. [2022-12-13 00:17:28,017 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 00:17:28,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 38. Up to 5 conditions per place. [2022-12-13 00:17:28,018 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 29 transitions, 84 flow [2022-12-13 00:17:28,018 INFO L226 LiptonReduction]: Number of co-enabled transitions 440 [2022-12-13 00:17:28,092 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:17:28,094 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-13 00:17:28,094 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 78 flow [2022-12-13 00:17:28,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:28,094 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:17:28,094 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:17:28,101 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 00:17:28,295 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,SelfDestructingSolverStorable9 [2022-12-13 00:17:28,295 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 00:17:28,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:17:28,295 INFO L85 PathProgramCache]: Analyzing trace with hash 206706762, now seen corresponding path program 1 times [2022-12-13 00:17:28,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:17:28,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933751575] [2022-12-13 00:17:28,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:28,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:17:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:28,424 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 00:17:28,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:17:28,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933751575] [2022-12-13 00:17:28,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933751575] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:17:28,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184935748] [2022-12-13 00:17:28,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:28,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:28,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:17:28,426 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 00:17:28,429 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 00:17:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:28,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 00:17:28,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:17:28,549 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 00:17:28,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:17:28,821 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 00:17:28,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184935748] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:17:28,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:17:28,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2022-12-13 00:17:28,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256449305] [2022-12-13 00:17:28,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:17:28,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 00:17:28,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:17:28,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 00:17:28,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 00:17:28,824 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 00:17:28,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 78 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 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 00:17:28,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:17:28,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 00:17:28,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:17:29,392 INFO L130 PetriNetUnfolder]: 1705/2520 cut-off events. [2022-12-13 00:17:29,393 INFO L131 PetriNetUnfolder]: For 1146/1146 co-relation queries the response was YES. [2022-12-13 00:17:29,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6272 conditions, 2520 events. 1705/2520 cut-off events. For 1146/1146 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 12006 event pairs, 96 based on Foata normal form. 0/1082 useless extension candidates. Maximal degree in co-relation 6259. Up to 1339 conditions per place. [2022-12-13 00:17:29,407 INFO L137 encePairwiseOnDemand]: 16/28 looper letters, 80 selfloop transitions, 55 changer transitions 0/139 dead transitions. [2022-12-13 00:17:29,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 139 transitions, 614 flow [2022-12-13 00:17:29,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 00:17:29,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 00:17:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions. [2022-12-13 00:17:29,409 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7589285714285714 [2022-12-13 00:17:29,409 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 78 flow. Second operand 8 states and 170 transitions. [2022-12-13 00:17:29,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 139 transitions, 614 flow [2022-12-13 00:17:29,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 139 transitions, 582 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-13 00:17:29,412 INFO L231 Difference]: Finished difference. Result has 41 places, 83 transitions, 367 flow [2022-12-13 00:17:29,412 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=367, PETRI_PLACES=41, PETRI_TRANSITIONS=83} [2022-12-13 00:17:29,413 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2022-12-13 00:17:29,413 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:17:29,413 INFO L89 Accepts]: Start accepts. Operand has 41 places, 83 transitions, 367 flow [2022-12-13 00:17:29,413 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:17:29,413 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:17:29,414 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 83 transitions, 367 flow [2022-12-13 00:17:29,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 83 transitions, 367 flow [2022-12-13 00:17:29,438 INFO L130 PetriNetUnfolder]: 329/501 cut-off events. [2022-12-13 00:17:29,438 INFO L131 PetriNetUnfolder]: For 147/155 co-relation queries the response was YES. [2022-12-13 00:17:29,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1212 conditions, 501 events. 329/501 cut-off events. For 147/155 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 1919 event pairs, 0 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 1200. Up to 377 conditions per place. [2022-12-13 00:17:29,442 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 83 transitions, 367 flow [2022-12-13 00:17:29,442 INFO L226 LiptonReduction]: Number of co-enabled transitions 1176 [2022-12-13 00:17:29,464 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [279] L687-5-->L687-3: Formula: (and (= v_~i~0_33 (+ v_~i~0_34 v_~j~0_39)) (< v_~p~0_23 10) (= v_~p~0_23 |v_t1Thread1of1ForFork1_#t~post1_15|)) InVars {~j~0=v_~j~0_39, ~i~0=v_~i~0_34, ~p~0=v_~p~0_23} OutVars{~j~0=v_~j~0_39, ~i~0=v_~i~0_33, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_15|, ~p~0=v_~p~0_23} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1] [2022-12-13 00:17:29,512 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_25 (+ v_~q~0_26 1)) (< v_~q~0_26 10) (= v_~j~0_75 (+ v_~i~0_71 v_~j~0_76))) InVars {~j~0=v_~j~0_76, ~i~0=v_~i~0_71, ~q~0=v_~q~0_26} OutVars{~j~0=v_~j~0_75, ~i~0=v_~i~0_71, ~q~0=v_~q~0_25, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:17:29,562 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [282] L695-5-->L698: Formula: (and (< v_~q~0_17 10) (= v_~j~0_43 (+ v_~i~0_37 v_~j~0_44))) InVars {~j~0=v_~j~0_44, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} OutVars{~j~0=v_~j~0_43, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} AuxVars[] AssignedVars[~j~0] [2022-12-13 00:17:29,605 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [322] L687-5-->L687-4: Formula: (and (< v_~p~0_44 10) (= v_~p~0_44 |v_t1Thread1of1ForFork1_#t~post1_19|) (= v_~p~0_43 (+ |v_t1Thread1of1ForFork1_#t~post1_19| 1)) (= (+ v_~j~0_107 v_~i~0_108) v_~i~0_107)) InVars {~j~0=v_~j~0_107, ~i~0=v_~i~0_108, ~p~0=v_~p~0_44} OutVars{~j~0=v_~j~0_107, ~i~0=v_~i~0_107, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_19|, ~p~0=v_~p~0_43} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:17:29,661 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [278] L687-5-->L690: Formula: (and (= v_~i~0_29 (+ v_~i~0_30 v_~j~0_37)) (< v_~p~0_21 10)) InVars {~j~0=v_~j~0_37, ~i~0=v_~i~0_30, ~p~0=v_~p~0_21} OutVars{~j~0=v_~j~0_37, ~i~0=v_~i~0_29, ~p~0=v_~p~0_21} AuxVars[] AssignedVars[~i~0] [2022-12-13 00:17:29,703 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [304] L695-5-->L695-4: Formula: (and (< v_~q~0_30 10) (= v_~q~0_29 (+ |v_t2Thread1of1ForFork0_#t~post2_23| 1)) (= v_~q~0_30 |v_t2Thread1of1ForFork0_#t~post2_23|) (= v_~j~0_79 (+ v_~i~0_73 v_~j~0_80))) InVars {~j~0=v_~j~0_80, ~i~0=v_~i~0_73, ~q~0=v_~q~0_30} OutVars{~j~0=v_~j~0_79, ~i~0=v_~i~0_73, ~q~0=v_~q~0_29, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_23|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:17:29,760 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [283] L695-5-->L695-3: Formula: (and (< v_~q~0_19 10) (= v_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|)) InVars {~j~0=v_~j~0_48, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19} OutVars{~j~0=v_~j~0_47, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_11|} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:17:29,910 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [323] L687-5-->L687-5: Formula: (and (< v_~p~0_48 10) (= v_~p~0_47 (+ v_~p~0_48 1)) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:17:29,984 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [323] L687-5-->L687-5: Formula: (and (< v_~p~0_48 10) (= v_~p~0_47 (+ v_~p~0_48 1)) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:17:30,035 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [279] L687-5-->L687-3: Formula: (and (= v_~i~0_33 (+ v_~i~0_34 v_~j~0_39)) (< v_~p~0_23 10) (= v_~p~0_23 |v_t1Thread1of1ForFork1_#t~post1_15|)) InVars {~j~0=v_~j~0_39, ~i~0=v_~i~0_34, ~p~0=v_~p~0_23} OutVars{~j~0=v_~j~0_39, ~i~0=v_~i~0_33, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_15|, ~p~0=v_~p~0_23} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1] [2022-12-13 00:17:30,083 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_25 (+ v_~q~0_26 1)) (< v_~q~0_26 10) (= v_~j~0_75 (+ v_~i~0_71 v_~j~0_76))) InVars {~j~0=v_~j~0_76, ~i~0=v_~i~0_71, ~q~0=v_~q~0_26} OutVars{~j~0=v_~j~0_75, ~i~0=v_~i~0_71, ~q~0=v_~q~0_25, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:17:30,132 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [282] L695-5-->L698: Formula: (and (< v_~q~0_17 10) (= v_~j~0_43 (+ v_~i~0_37 v_~j~0_44))) InVars {~j~0=v_~j~0_44, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} OutVars{~j~0=v_~j~0_43, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} AuxVars[] AssignedVars[~j~0] [2022-12-13 00:17:30,177 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [322] L687-5-->L687-4: Formula: (and (< v_~p~0_44 10) (= v_~p~0_44 |v_t1Thread1of1ForFork1_#t~post1_19|) (= v_~p~0_43 (+ |v_t1Thread1of1ForFork1_#t~post1_19| 1)) (= (+ v_~j~0_107 v_~i~0_108) v_~i~0_107)) InVars {~j~0=v_~j~0_107, ~i~0=v_~i~0_108, ~p~0=v_~p~0_44} OutVars{~j~0=v_~j~0_107, ~i~0=v_~i~0_107, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_19|, ~p~0=v_~p~0_43} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:17:30,234 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [278] L687-5-->L690: Formula: (and (= v_~i~0_29 (+ v_~i~0_30 v_~j~0_37)) (< v_~p~0_21 10)) InVars {~j~0=v_~j~0_37, ~i~0=v_~i~0_30, ~p~0=v_~p~0_21} OutVars{~j~0=v_~j~0_37, ~i~0=v_~i~0_29, ~p~0=v_~p~0_21} AuxVars[] AssignedVars[~i~0] [2022-12-13 00:17:30,277 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [304] L695-5-->L695-4: Formula: (and (< v_~q~0_30 10) (= v_~q~0_29 (+ |v_t2Thread1of1ForFork0_#t~post2_23| 1)) (= v_~q~0_30 |v_t2Thread1of1ForFork0_#t~post2_23|) (= v_~j~0_79 (+ v_~i~0_73 v_~j~0_80))) InVars {~j~0=v_~j~0_80, ~i~0=v_~i~0_73, ~q~0=v_~q~0_30} OutVars{~j~0=v_~j~0_79, ~i~0=v_~i~0_73, ~q~0=v_~q~0_29, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_23|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:17:30,332 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [283] L695-5-->L695-3: Formula: (and (< v_~q~0_19 10) (= v_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|)) InVars {~j~0=v_~j~0_48, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19} OutVars{~j~0=v_~j~0_47, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_11|} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:17:30,453 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:17:30,453 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1040 [2022-12-13 00:17:30,453 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 82 transitions, 442 flow [2022-12-13 00:17:30,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 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 00:17:30,454 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:17:30,454 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:17:30,460 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 00:17:30,654 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,SelfDestructingSolverStorable10 [2022-12-13 00:17:30,654 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 00:17:30,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:17:30,655 INFO L85 PathProgramCache]: Analyzing trace with hash 206707010, now seen corresponding path program 1 times [2022-12-13 00:17:30,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:17:30,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025256809] [2022-12-13 00:17:30,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:30,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:17:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:30,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:17:30,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:17:30,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025256809] [2022-12-13 00:17:30,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025256809] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:17:30,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:17:30,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:17:30,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112227260] [2022-12-13 00:17:30,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:17:30,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:17:30,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:17:30,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:17:30,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:17:30,681 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 46 [2022-12-13 00:17:30,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 82 transitions, 442 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:30,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:17:30,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 46 [2022-12-13 00:17:30,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:17:30,821 INFO L130 PetriNetUnfolder]: 1152/1737 cut-off events. [2022-12-13 00:17:30,822 INFO L131 PetriNetUnfolder]: For 1152/1152 co-relation queries the response was YES. [2022-12-13 00:17:30,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5214 conditions, 1737 events. 1152/1737 cut-off events. For 1152/1152 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 8146 event pairs, 363 based on Foata normal form. 54/1003 useless extension candidates. Maximal degree in co-relation 5199. Up to 890 conditions per place. [2022-12-13 00:17:30,830 INFO L137 encePairwiseOnDemand]: 26/46 looper letters, 63 selfloop transitions, 18 changer transitions 1/86 dead transitions. [2022-12-13 00:17:30,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 86 transitions, 594 flow [2022-12-13 00:17:30,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:17:30,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:17:30,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-13 00:17:30,831 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5072463768115942 [2022-12-13 00:17:30,831 INFO L175 Difference]: Start difference. First operand has 40 places, 82 transitions, 442 flow. Second operand 3 states and 70 transitions. [2022-12-13 00:17:30,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 86 transitions, 594 flow [2022-12-13 00:17:30,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 86 transitions, 556 flow, removed 19 selfloop flow, removed 1 redundant places. [2022-12-13 00:17:30,841 INFO L231 Difference]: Finished difference. Result has 40 places, 69 transitions, 373 flow [2022-12-13 00:17:30,841 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=373, PETRI_PLACES=40, PETRI_TRANSITIONS=69} [2022-12-13 00:17:30,841 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2022-12-13 00:17:30,841 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:17:30,841 INFO L89 Accepts]: Start accepts. Operand has 40 places, 69 transitions, 373 flow [2022-12-13 00:17:30,842 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:17:30,842 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:17:30,842 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 69 transitions, 373 flow [2022-12-13 00:17:30,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 69 transitions, 373 flow [2022-12-13 00:17:30,863 INFO L130 PetriNetUnfolder]: 272/441 cut-off events. [2022-12-13 00:17:30,863 INFO L131 PetriNetUnfolder]: For 175/183 co-relation queries the response was YES. [2022-12-13 00:17:30,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1118 conditions, 441 events. 272/441 cut-off events. For 175/183 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 1793 event pairs, 0 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 1105. Up to 321 conditions per place. [2022-12-13 00:17:30,866 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 69 transitions, 373 flow [2022-12-13 00:17:30,866 INFO L226 LiptonReduction]: Number of co-enabled transitions 904 [2022-12-13 00:17:30,867 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:17:30,868 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-13 00:17:30,868 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 69 transitions, 373 flow [2022-12-13 00:17:30,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:30,868 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:17:30,868 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:17:30,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 00:17:30,868 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 00:17:30,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:17:30,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1349048446, now seen corresponding path program 1 times [2022-12-13 00:17:30,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:17:30,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750733294] [2022-12-13 00:17:30,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:30,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:17:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:31,041 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 00:17:31,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:17:31,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750733294] [2022-12-13 00:17:31,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750733294] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:17:31,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071108211] [2022-12-13 00:17:31,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:31,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:31,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:17:31,043 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 00:17:31,045 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 00:17:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:31,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 00:17:31,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:17:31,196 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 00:17:31,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:17:31,439 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 00:17:31,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071108211] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:17:31,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:17:31,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-13 00:17:31,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36171492] [2022-12-13 00:17:31,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:17:31,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 00:17:31,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:17:31,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 00:17:31,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 00:17:31,442 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 44 [2022-12-13 00:17:31,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 69 transitions, 373 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:31,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:17:31,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 44 [2022-12-13 00:17:31,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:17:37,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:17:40,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:17:42,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:17:45,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:17:47,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:17:49,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:17:51,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:17:52,023 INFO L130 PetriNetUnfolder]: 2780/4203 cut-off events. [2022-12-13 00:17:52,023 INFO L131 PetriNetUnfolder]: For 3088/3088 co-relation queries the response was YES. [2022-12-13 00:17:52,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12395 conditions, 4203 events. 2780/4203 cut-off events. For 3088/3088 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 23748 event pairs, 100 based on Foata normal form. 168/2459 useless extension candidates. Maximal degree in co-relation 12379. Up to 2080 conditions per place. [2022-12-13 00:17:52,061 INFO L137 encePairwiseOnDemand]: 16/44 looper letters, 110 selfloop transitions, 131 changer transitions 0/245 dead transitions. [2022-12-13 00:17:52,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 245 transitions, 1490 flow [2022-12-13 00:17:52,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 00:17:52,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 00:17:52,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 276 transitions. [2022-12-13 00:17:52,063 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2022-12-13 00:17:52,063 INFO L175 Difference]: Start difference. First operand has 39 places, 69 transitions, 373 flow. Second operand 12 states and 276 transitions. [2022-12-13 00:17:52,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 245 transitions, 1490 flow [2022-12-13 00:17:52,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 245 transitions, 1426 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 00:17:52,120 INFO L231 Difference]: Finished difference. Result has 51 places, 159 transitions, 1121 flow [2022-12-13 00:17:52,120 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1121, PETRI_PLACES=51, PETRI_TRANSITIONS=159} [2022-12-13 00:17:52,121 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 19 predicate places. [2022-12-13 00:17:52,121 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:17:52,121 INFO L89 Accepts]: Start accepts. Operand has 51 places, 159 transitions, 1121 flow [2022-12-13 00:17:52,122 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:17:52,122 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:17:52,122 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 159 transitions, 1121 flow [2022-12-13 00:17:52,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 159 transitions, 1121 flow [2022-12-13 00:17:52,225 INFO L130 PetriNetUnfolder]: 604/1017 cut-off events. [2022-12-13 00:17:52,225 INFO L131 PetriNetUnfolder]: For 688/743 co-relation queries the response was YES. [2022-12-13 00:17:52,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3357 conditions, 1017 events. 604/1017 cut-off events. For 688/743 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 5591 event pairs, 0 based on Foata normal form. 0/421 useless extension candidates. Maximal degree in co-relation 3341. Up to 777 conditions per place. [2022-12-13 00:17:52,232 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 159 transitions, 1121 flow [2022-12-13 00:17:52,232 INFO L226 LiptonReduction]: Number of co-enabled transitions 1940 [2022-12-13 00:17:52,245 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:17:52,246 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 00:17:52,246 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 159 transitions, 1121 flow [2022-12-13 00:17:52,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:52,246 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:17:52,246 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:17:52,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 00:17:52,447 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,SelfDestructingSolverStorable12 [2022-12-13 00:17:52,447 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 00:17:52,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:17:52,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1348906621, now seen corresponding path program 1 times [2022-12-13 00:17:52,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:17:52,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110146391] [2022-12-13 00:17:52,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:52,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:17:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:52,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:17:52,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:17:52,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110146391] [2022-12-13 00:17:52,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110146391] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:17:52,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676552008] [2022-12-13 00:17:52,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:52,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:52,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:17:52,484 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:17:52,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 00:17:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:52,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 00:17:52,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:17:52,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:17:52,565 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 00:17:52,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676552008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:17:52,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 00:17:52,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-13 00:17:52,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155144299] [2022-12-13 00:17:52,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:17:52,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:17:52,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:17:52,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:17:52,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:17:52,568 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 44 [2022-12-13 00:17:52,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 159 transitions, 1121 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 00:17:52,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:17:52,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 44 [2022-12-13 00:17:52,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:17:52,871 INFO L130 PetriNetUnfolder]: 1996/3191 cut-off events. [2022-12-13 00:17:52,871 INFO L131 PetriNetUnfolder]: For 3541/3541 co-relation queries the response was YES. [2022-12-13 00:17:52,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10878 conditions, 3191 events. 1996/3191 cut-off events. For 3541/3541 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 19028 event pairs, 703 based on Foata normal form. 350/1909 useless extension candidates. Maximal degree in co-relation 10859. Up to 1634 conditions per place. [2022-12-13 00:17:52,883 INFO L137 encePairwiseOnDemand]: 25/44 looper letters, 133 selfloop transitions, 28 changer transitions 0/165 dead transitions. [2022-12-13 00:17:52,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 165 transitions, 1428 flow [2022-12-13 00:17:52,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:17:52,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:17:52,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-13 00:17:52,884 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2022-12-13 00:17:52,884 INFO L175 Difference]: Start difference. First operand has 51 places, 159 transitions, 1121 flow. Second operand 4 states and 72 transitions. [2022-12-13 00:17:52,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 165 transitions, 1428 flow [2022-12-13 00:17:52,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 165 transitions, 1295 flow, removed 58 selfloop flow, removed 1 redundant places. [2022-12-13 00:17:52,914 INFO L231 Difference]: Finished difference. Result has 52 places, 141 transitions, 949 flow [2022-12-13 00:17:52,914 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=949, PETRI_PLACES=52, PETRI_TRANSITIONS=141} [2022-12-13 00:17:52,915 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2022-12-13 00:17:52,915 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:17:52,915 INFO L89 Accepts]: Start accepts. Operand has 52 places, 141 transitions, 949 flow [2022-12-13 00:17:52,915 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:17:52,915 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:17:52,916 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 141 transitions, 949 flow [2022-12-13 00:17:52,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 141 transitions, 949 flow [2022-12-13 00:17:52,951 INFO L130 PetriNetUnfolder]: 424/781 cut-off events. [2022-12-13 00:17:52,951 INFO L131 PetriNetUnfolder]: For 749/784 co-relation queries the response was YES. [2022-12-13 00:17:52,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2298 conditions, 781 events. 424/781 cut-off events. For 749/784 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 4601 event pairs, 0 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 2281. Up to 405 conditions per place. [2022-12-13 00:17:52,956 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 141 transitions, 949 flow [2022-12-13 00:17:52,956 INFO L226 LiptonReduction]: Number of co-enabled transitions 1632 [2022-12-13 00:17:52,957 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:17:52,958 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-13 00:17:52,958 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 141 transitions, 949 flow [2022-12-13 00:17:52,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 00:17:52,958 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:17:52,958 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:17:52,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 00:17:53,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 00:17:53,163 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 00:17:53,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:17:53,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1025623865, now seen corresponding path program 1 times [2022-12-13 00:17:53,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:17:53,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746765838] [2022-12-13 00:17:53,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:53,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:17:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:53,320 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 00:17:53,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:17:53,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746765838] [2022-12-13 00:17:53,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746765838] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:17:53,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440245575] [2022-12-13 00:17:53,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:53,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:53,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:17:53,322 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:17:53,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 00:17:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:53,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 00:17:53,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:17:53,488 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 00:17:53,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:17:53,748 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 00:17:53,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440245575] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:17:53,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:17:53,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-13 00:17:53,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756067990] [2022-12-13 00:17:53,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:17:53,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 00:17:53,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:17:53,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 00:17:53,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 00:17:53,749 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2022-12-13 00:17:53,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 141 transitions, 949 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:53,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:17:53,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2022-12-13 00:17:53,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:17:59,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:01,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:03,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:05,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:07,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:09,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:10,015 INFO L130 PetriNetUnfolder]: 3207/5195 cut-off events. [2022-12-13 00:18:10,016 INFO L131 PetriNetUnfolder]: For 7682/7682 co-relation queries the response was YES. [2022-12-13 00:18:10,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16260 conditions, 5195 events. 3207/5195 cut-off events. For 7682/7682 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 34507 event pairs, 163 based on Foata normal form. 168/2671 useless extension candidates. Maximal degree in co-relation 16240. Up to 2896 conditions per place. [2022-12-13 00:18:10,039 INFO L137 encePairwiseOnDemand]: 16/43 looper letters, 137 selfloop transitions, 157 changer transitions 0/298 dead transitions. [2022-12-13 00:18:10,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 298 transitions, 2101 flow [2022-12-13 00:18:10,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 00:18:10,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 00:18:10,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 242 transitions. [2022-12-13 00:18:10,042 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5116279069767442 [2022-12-13 00:18:10,042 INFO L175 Difference]: Start difference. First operand has 52 places, 141 transitions, 949 flow. Second operand 11 states and 242 transitions. [2022-12-13 00:18:10,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 298 transitions, 2101 flow [2022-12-13 00:18:10,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 298 transitions, 2068 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:18:10,092 INFO L231 Difference]: Finished difference. Result has 66 places, 225 transitions, 1894 flow [2022-12-13 00:18:10,092 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1894, PETRI_PLACES=66, PETRI_TRANSITIONS=225} [2022-12-13 00:18:10,092 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 34 predicate places. [2022-12-13 00:18:10,092 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:18:10,092 INFO L89 Accepts]: Start accepts. Operand has 66 places, 225 transitions, 1894 flow [2022-12-13 00:18:10,101 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:18:10,101 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:18:10,101 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 225 transitions, 1894 flow [2022-12-13 00:18:10,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 225 transitions, 1894 flow [2022-12-13 00:18:10,152 INFO L130 PetriNetUnfolder]: 640/1265 cut-off events. [2022-12-13 00:18:10,152 INFO L131 PetriNetUnfolder]: For 2468/2539 co-relation queries the response was YES. [2022-12-13 00:18:10,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5000 conditions, 1265 events. 640/1265 cut-off events. For 2468/2539 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 8884 event pairs, 0 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 4977. Up to 733 conditions per place. [2022-12-13 00:18:10,159 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 225 transitions, 1894 flow [2022-12-13 00:18:10,159 INFO L226 LiptonReduction]: Number of co-enabled transitions 2488 [2022-12-13 00:18:10,160 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:18:10,160 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-13 00:18:10,160 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 225 transitions, 1894 flow [2022-12-13 00:18:10,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:18:10,161 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:18:10,161 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:18:10,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 00:18:10,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 00:18:10,364 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 00:18:10,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:18:10,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1134579526, now seen corresponding path program 1 times [2022-12-13 00:18:10,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:18:10,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406217322] [2022-12-13 00:18:10,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:18:10,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:18:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:18:10,543 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 00:18:10,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:18:10,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406217322] [2022-12-13 00:18:10,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406217322] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:18:10,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215406763] [2022-12-13 00:18:10,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:18:10,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:18:10,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:18:10,545 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:18:10,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 00:18:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:18:10,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 00:18:10,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:18:10,723 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 00:18:10,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:18:11,058 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 00:18:11,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215406763] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:18:11,059 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:18:11,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-13 00:18:11,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419302889] [2022-12-13 00:18:11,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:18:11,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 00:18:11,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:18:11,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 00:18:11,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-12-13 00:18:11,060 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2022-12-13 00:18:11,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 225 transitions, 1894 flow. Second operand has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 0 states have call successors, (0), 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 00:18:11,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:18:11,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2022-12-13 00:18:11,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:18:12,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:14,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:16,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:17,443 INFO L130 PetriNetUnfolder]: 4901/7977 cut-off events. [2022-12-13 00:18:17,444 INFO L131 PetriNetUnfolder]: For 25012/25012 co-relation queries the response was YES. [2022-12-13 00:18:17,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31145 conditions, 7977 events. 4901/7977 cut-off events. For 25012/25012 co-relation queries the response was YES. Maximal size of possible extension queue 935. Compared 56921 event pairs, 205 based on Foata normal form. 154/4044 useless extension candidates. Maximal degree in co-relation 31119. Up to 3237 conditions per place. [2022-12-13 00:18:17,474 INFO L137 encePairwiseOnDemand]: 16/43 looper letters, 142 selfloop transitions, 251 changer transitions 0/397 dead transitions. [2022-12-13 00:18:17,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 397 transitions, 3424 flow [2022-12-13 00:18:17,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 00:18:17,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 00:18:17,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 277 transitions. [2022-12-13 00:18:17,479 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5368217054263565 [2022-12-13 00:18:17,479 INFO L175 Difference]: Start difference. First operand has 66 places, 225 transitions, 1894 flow. Second operand 12 states and 277 transitions. [2022-12-13 00:18:17,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 397 transitions, 3424 flow [2022-12-13 00:18:17,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 397 transitions, 3245 flow, removed 49 selfloop flow, removed 3 redundant places. [2022-12-13 00:18:17,696 INFO L231 Difference]: Finished difference. Result has 78 places, 302 transitions, 3010 flow [2022-12-13 00:18:17,696 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1731, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3010, PETRI_PLACES=78, PETRI_TRANSITIONS=302} [2022-12-13 00:18:17,697 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 46 predicate places. [2022-12-13 00:18:17,697 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:18:17,697 INFO L89 Accepts]: Start accepts. Operand has 78 places, 302 transitions, 3010 flow [2022-12-13 00:18:17,698 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:18:17,698 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:18:17,698 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 302 transitions, 3010 flow [2022-12-13 00:18:17,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 302 transitions, 3010 flow [2022-12-13 00:18:17,823 INFO L130 PetriNetUnfolder]: 968/1965 cut-off events. [2022-12-13 00:18:17,823 INFO L131 PetriNetUnfolder]: For 7558/7638 co-relation queries the response was YES. [2022-12-13 00:18:17,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9477 conditions, 1965 events. 968/1965 cut-off events. For 7558/7638 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 15185 event pairs, 0 based on Foata normal form. 0/691 useless extension candidates. Maximal degree in co-relation 9449. Up to 1165 conditions per place. [2022-12-13 00:18:17,840 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 302 transitions, 3010 flow [2022-12-13 00:18:17,840 INFO L226 LiptonReduction]: Number of co-enabled transitions 3424 [2022-12-13 00:18:17,842 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:18:17,842 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 00:18:17,842 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 302 transitions, 3010 flow [2022-12-13 00:18:17,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 0 states have call successors, (0), 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 00:18:17,843 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:18:17,843 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:18:17,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 00:18:18,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:18:18,048 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:18:18,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:18:18,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1929954349, now seen corresponding path program 1 times [2022-12-13 00:18:18,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:18:18,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620233813] [2022-12-13 00:18:18,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:18:18,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:18:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:18:18,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 00:18:18,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:18:18,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620233813] [2022-12-13 00:18:18,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620233813] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:18:18,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576808322] [2022-12-13 00:18:18,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:18:18,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:18:18,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:18:18,318 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:18:18,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 00:18:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:18:18,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 00:18:18,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:18:18,686 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 00:18:18,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:18:19,108 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 00:18:19,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576808322] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:18:19,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:18:19,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-13 00:18:19,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484422461] [2022-12-13 00:18:19,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:18:19,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 00:18:19,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:18:19,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 00:18:19,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-13 00:18:19,109 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2022-12-13 00:18:19,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 302 transitions, 3010 flow. Second operand has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 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 00:18:19,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:18:19,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2022-12-13 00:18:19,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:18:26,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:28,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:30,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:32,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:34,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:35,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:38,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:40,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:42,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:44,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:46,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:48,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:50,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:52,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:54,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:56,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:58,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:00,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:01,553 INFO L130 PetriNetUnfolder]: 5111/8493 cut-off events. [2022-12-13 00:19:01,553 INFO L131 PetriNetUnfolder]: For 48243/48243 co-relation queries the response was YES. [2022-12-13 00:19:01,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37425 conditions, 8493 events. 5111/8493 cut-off events. For 48243/48243 co-relation queries the response was YES. Maximal size of possible extension queue 1046. Compared 63162 event pairs, 302 based on Foata normal form. 301/4307 useless extension candidates. Maximal degree in co-relation 37394. Up to 4787 conditions per place. [2022-12-13 00:19:01,627 INFO L137 encePairwiseOnDemand]: 16/43 looper letters, 210 selfloop transitions, 278 changer transitions 0/492 dead transitions. [2022-12-13 00:19:01,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 492 transitions, 4882 flow [2022-12-13 00:19:01,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 00:19:01,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 00:19:01,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 339 transitions. [2022-12-13 00:19:01,641 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49273255813953487 [2022-12-13 00:19:01,641 INFO L175 Difference]: Start difference. First operand has 78 places, 302 transitions, 3010 flow. Second operand 16 states and 339 transitions. [2022-12-13 00:19:01,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 492 transitions, 4882 flow [2022-12-13 00:19:02,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 492 transitions, 4475 flow, removed 89 selfloop flow, removed 8 redundant places. [2022-12-13 00:19:02,254 INFO L231 Difference]: Finished difference. Result has 90 places, 382 transitions, 4157 flow [2022-12-13 00:19:02,254 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2659, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=214, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4157, PETRI_PLACES=90, PETRI_TRANSITIONS=382} [2022-12-13 00:19:02,254 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 58 predicate places. [2022-12-13 00:19:02,254 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:19:02,254 INFO L89 Accepts]: Start accepts. Operand has 90 places, 382 transitions, 4157 flow [2022-12-13 00:19:02,255 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:19:02,256 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:19:02,256 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 382 transitions, 4157 flow [2022-12-13 00:19:02,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 382 transitions, 4157 flow [2022-12-13 00:19:02,413 INFO L130 PetriNetUnfolder]: 1096/2265 cut-off events. [2022-12-13 00:19:02,417 INFO L131 PetriNetUnfolder]: For 6656/6727 co-relation queries the response was YES. [2022-12-13 00:19:02,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11158 conditions, 2265 events. 1096/2265 cut-off events. For 6656/6727 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 18441 event pairs, 0 based on Foata normal form. 0/742 useless extension candidates. Maximal degree in co-relation 11129. Up to 1301 conditions per place. [2022-12-13 00:19:02,437 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 382 transitions, 4157 flow [2022-12-13 00:19:02,437 INFO L226 LiptonReduction]: Number of co-enabled transitions 4064 [2022-12-13 00:19:02,439 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:19:02,440 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-13 00:19:02,440 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 382 transitions, 4157 flow [2022-12-13 00:19:02,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 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 00:19:02,440 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:19:02,440 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:19:02,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 00:19:02,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 00:19:02,646 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:19:02,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:19:02,646 INFO L85 PathProgramCache]: Analyzing trace with hash -810920358, now seen corresponding path program 1 times [2022-12-13 00:19:02,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:19:02,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216809121] [2022-12-13 00:19:02,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:19:02,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:19:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:19:02,915 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 00:19:02,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:19:02,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216809121] [2022-12-13 00:19:02,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216809121] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:19:02,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204590177] [2022-12-13 00:19:02,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:19:02,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:19:02,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:19:02,924 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:19:02,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 00:19:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:19:03,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 00:19:03,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:19:03,217 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 00:19:03,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:19:03,531 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 00:19:03,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204590177] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:19:03,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:19:03,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 00:19:03,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725071746] [2022-12-13 00:19:03,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:19:03,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 00:19:03,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:19:03,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 00:19:03,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-13 00:19:03,533 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2022-12-13 00:19:03,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 382 transitions, 4157 flow. Second operand has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 0 states have call successors, (0), 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 00:19:03,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:19:03,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2022-12-13 00:19:03,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:19:11,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:13,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:18,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:21,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:23,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:25,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:27,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:29,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:31,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:34,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:36,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:38,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:40,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:42,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:44,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:46,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:48,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:50,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:52,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:54,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:56,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:58,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:20:01,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:20:03,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:20:05,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:20:07,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:20:08,074 INFO L130 PetriNetUnfolder]: 5678/9617 cut-off events. [2022-12-13 00:20:08,074 INFO L131 PetriNetUnfolder]: For 61609/61609 co-relation queries the response was YES. [2022-12-13 00:20:08,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44159 conditions, 9617 events. 5678/9617 cut-off events. For 61609/61609 co-relation queries the response was YES. Maximal size of possible extension queue 1098. Compared 73601 event pairs, 287 based on Foata normal form. 301/4726 useless extension candidates. Maximal degree in co-relation 44127. Up to 5719 conditions per place. [2022-12-13 00:20:08,145 INFO L137 encePairwiseOnDemand]: 16/43 looper letters, 295 selfloop transitions, 271 changer transitions 0/570 dead transitions. [2022-12-13 00:20:08,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 570 transitions, 6181 flow [2022-12-13 00:20:08,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 00:20:08,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 00:20:08,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 377 transitions. [2022-12-13 00:20:08,147 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4870801033591731 [2022-12-13 00:20:08,147 INFO L175 Difference]: Start difference. First operand has 90 places, 382 transitions, 4157 flow. Second operand 18 states and 377 transitions. [2022-12-13 00:20:08,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 570 transitions, 6181 flow [2022-12-13 00:20:08,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 570 transitions, 5875 flow, removed 40 selfloop flow, removed 8 redundant places. [2022-12-13 00:20:08,769 INFO L231 Difference]: Finished difference. Result has 104 places, 447 transitions, 5278 flow [2022-12-13 00:20:08,769 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3851, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=230, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=5278, PETRI_PLACES=104, PETRI_TRANSITIONS=447} [2022-12-13 00:20:08,770 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 72 predicate places. [2022-12-13 00:20:08,770 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:20:08,770 INFO L89 Accepts]: Start accepts. Operand has 104 places, 447 transitions, 5278 flow [2022-12-13 00:20:08,775 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:20:08,775 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:20:08,776 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 447 transitions, 5278 flow [2022-12-13 00:20:08,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 447 transitions, 5278 flow [2022-12-13 00:20:09,015 INFO L130 PetriNetUnfolder]: 1320/2785 cut-off events. [2022-12-13 00:20:09,021 INFO L131 PetriNetUnfolder]: For 14533/14604 co-relation queries the response was YES. [2022-12-13 00:20:09,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15308 conditions, 2785 events. 1320/2785 cut-off events. For 14533/14604 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 23032 event pairs, 0 based on Foata normal form. 0/884 useless extension candidates. Maximal degree in co-relation 15273. Up to 1637 conditions per place. [2022-12-13 00:20:09,045 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 447 transitions, 5278 flow [2022-12-13 00:20:09,045 INFO L226 LiptonReduction]: Number of co-enabled transitions 4656 [2022-12-13 00:20:09,050 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (not (< v_~x~0_35 22)) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [283] L695-5-->L695-3: Formula: (and (< v_~q~0_19 10) (= v_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|)) InVars {~j~0=v_~j~0_48, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19} OutVars{~j~0=v_~j~0_47, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_11|} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:20:09,140 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (not (< v_~x~0_35 22)) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [282] L695-5-->L698: Formula: (and (< v_~q~0_17 10) (= v_~j~0_43 (+ v_~i~0_37 v_~j~0_44))) InVars {~j~0=v_~j~0_44, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} OutVars{~j~0=v_~j~0_43, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} AuxVars[] AssignedVars[~j~0] [2022-12-13 00:20:09,222 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (not (< v_~x~0_35 22)) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [279] L687-5-->L687-3: Formula: (and (= v_~i~0_33 (+ v_~i~0_34 v_~j~0_39)) (< v_~p~0_23 10) (= v_~p~0_23 |v_t1Thread1of1ForFork1_#t~post1_15|)) InVars {~j~0=v_~j~0_39, ~i~0=v_~i~0_34, ~p~0=v_~p~0_23} OutVars{~j~0=v_~j~0_39, ~i~0=v_~i~0_33, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_15|, ~p~0=v_~p~0_23} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1] [2022-12-13 00:20:09,329 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (not (< v_~x~0_35 22)) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [304] L695-5-->L695-4: Formula: (and (< v_~q~0_30 10) (= v_~q~0_29 (+ |v_t2Thread1of1ForFork0_#t~post2_23| 1)) (= v_~q~0_30 |v_t2Thread1of1ForFork0_#t~post2_23|) (= v_~j~0_79 (+ v_~i~0_73 v_~j~0_80))) InVars {~j~0=v_~j~0_80, ~i~0=v_~i~0_73, ~q~0=v_~q~0_30} OutVars{~j~0=v_~j~0_79, ~i~0=v_~i~0_73, ~q~0=v_~q~0_29, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_23|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:20:09,432 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (not (< v_~x~0_35 22)) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [322] L687-5-->L687-4: Formula: (and (< v_~p~0_44 10) (= v_~p~0_44 |v_t1Thread1of1ForFork1_#t~post1_19|) (= v_~p~0_43 (+ |v_t1Thread1of1ForFork1_#t~post1_19| 1)) (= (+ v_~j~0_107 v_~i~0_108) v_~i~0_107)) InVars {~j~0=v_~j~0_107, ~i~0=v_~i~0_108, ~p~0=v_~p~0_44} OutVars{~j~0=v_~j~0_107, ~i~0=v_~i~0_107, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_19|, ~p~0=v_~p~0_43} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:20:09,531 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (not (< v_~x~0_35 22)) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [278] L687-5-->L690: Formula: (and (= v_~i~0_29 (+ v_~i~0_30 v_~j~0_37)) (< v_~p~0_21 10)) InVars {~j~0=v_~j~0_37, ~i~0=v_~i~0_30, ~p~0=v_~p~0_21} OutVars{~j~0=v_~j~0_37, ~i~0=v_~i~0_29, ~p~0=v_~p~0_21} AuxVars[] AssignedVars[~i~0] [2022-12-13 00:20:09,615 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (not (< v_~x~0_35 22)) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_25 (+ v_~q~0_26 1)) (< v_~q~0_26 10) (= v_~j~0_75 (+ v_~i~0_71 v_~j~0_76))) InVars {~j~0=v_~j~0_76, ~i~0=v_~i~0_71, ~q~0=v_~q~0_26} OutVars{~j~0=v_~j~0_75, ~i~0=v_~i~0_71, ~q~0=v_~q~0_25, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:20:09,714 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (not (< v_~x~0_35 22)) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [323] L687-5-->L687-5: Formula: (and (< v_~p~0_48 10) (= v_~p~0_47 (+ v_~p~0_48 1)) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:20:09,810 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:20:09,811 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1041 [2022-12-13 00:20:09,811 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 447 transitions, 5526 flow [2022-12-13 00:20:09,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 0 states have call successors, (0), 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 00:20:09,811 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:20:09,812 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:20:09,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-13 00:20:10,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 00:20:10,019 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:20:10,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:20:10,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1930072862, now seen corresponding path program 1 times [2022-12-13 00:20:10,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:20:10,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877313771] [2022-12-13 00:20:10,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:20:10,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:20:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:20:10,262 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 00:20:10,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:20:10,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877313771] [2022-12-13 00:20:10,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877313771] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:20:10,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558293145] [2022-12-13 00:20:10,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:20:10,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:20:10,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:20:10,264 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:20:10,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 00:20:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:20:10,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 00:20:10,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:20:10,463 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 00:20:10,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:20:10,831 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 00:20:10,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558293145] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:20:10,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:20:10,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-13 00:20:10,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520453369] [2022-12-13 00:20:10,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:20:10,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 00:20:10,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:20:10,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 00:20:10,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-13 00:20:10,837 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 51 [2022-12-13 00:20:10,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 447 transitions, 5526 flow. Second operand has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 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 00:20:10,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:20:10,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 51 [2022-12-13 00:20:10,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:20:18,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:20:20,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:20:22,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:20:24,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:20:26,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:20:34,319 WARN L233 SmtUtils]: Spent 6.47s on a formula simplification. DAG size of input: 50 DAG size of output: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 00:20:36,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:20:38,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:20:41,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:20:43,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:20:45,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:20:47,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:20:49,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:20:51,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:20:53,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:20:55,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:20:56,908 INFO L130 PetriNetUnfolder]: 6091/10542 cut-off events. [2022-12-13 00:20:56,909 INFO L131 PetriNetUnfolder]: For 72381/72381 co-relation queries the response was YES. [2022-12-13 00:20:56,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51899 conditions, 10542 events. 6091/10542 cut-off events. For 72381/72381 co-relation queries the response was YES. Maximal size of possible extension queue 1300. Compared 85897 event pairs, 416 based on Foata normal form. 210/4890 useless extension candidates. Maximal degree in co-relation 51861. Up to 6242 conditions per place. [2022-12-13 00:20:56,941 INFO L137 encePairwiseOnDemand]: 16/51 looper letters, 318 selfloop transitions, 342 changer transitions 0/664 dead transitions. [2022-12-13 00:20:56,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 664 transitions, 8185 flow [2022-12-13 00:20:56,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 00:20:56,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 00:20:56,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 343 transitions. [2022-12-13 00:20:56,943 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42034313725490197 [2022-12-13 00:20:56,943 INFO L175 Difference]: Start difference. First operand has 104 places, 447 transitions, 5526 flow. Second operand 16 states and 343 transitions. [2022-12-13 00:20:56,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 664 transitions, 8185 flow [2022-12-13 00:20:57,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 664 transitions, 7589 flow, removed 153 selfloop flow, removed 10 redundant places. [2022-12-13 00:20:57,590 INFO L231 Difference]: Finished difference. Result has 113 places, 558 transitions, 7217 flow [2022-12-13 00:20:57,590 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=4681, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=230, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=7217, PETRI_PLACES=113, PETRI_TRANSITIONS=558} [2022-12-13 00:20:57,591 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 81 predicate places. [2022-12-13 00:20:57,591 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:20:57,591 INFO L89 Accepts]: Start accepts. Operand has 113 places, 558 transitions, 7217 flow [2022-12-13 00:20:57,593 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:20:57,593 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:20:57,593 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 558 transitions, 7217 flow [2022-12-13 00:20:57,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 558 transitions, 7217 flow [2022-12-13 00:20:57,809 INFO L130 PetriNetUnfolder]: 1480/3209 cut-off events. [2022-12-13 00:20:57,809 INFO L131 PetriNetUnfolder]: For 14156/14236 co-relation queries the response was YES. [2022-12-13 00:20:57,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18593 conditions, 3209 events. 1480/3209 cut-off events. For 14156/14236 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 28652 event pairs, 0 based on Foata normal form. 0/966 useless extension candidates. Maximal degree in co-relation 18553. Up to 1609 conditions per place. [2022-12-13 00:20:57,829 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 558 transitions, 7217 flow [2022-12-13 00:20:57,829 INFO L226 LiptonReduction]: Number of co-enabled transitions 5568 [2022-12-13 00:20:57,831 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:20:57,832 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 241 [2022-12-13 00:20:57,832 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 558 transitions, 7217 flow [2022-12-13 00:20:57,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 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 00:20:57,832 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:20:57,832 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:20:57,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-13 00:20:58,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:20:58,033 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:20:58,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:20:58,033 INFO L85 PathProgramCache]: Analyzing trace with hash 2075010054, now seen corresponding path program 1 times [2022-12-13 00:20:58,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:20:58,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029530091] [2022-12-13 00:20:58,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:20:58,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:20:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:20:58,199 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 00:20:58,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:20:58,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029530091] [2022-12-13 00:20:58,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029530091] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:20:58,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991229265] [2022-12-13 00:20:58,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:20:58,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:20:58,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:20:58,201 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:20:58,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 00:20:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:20:58,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 00:20:58,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:20:58,387 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 00:20:58,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:20:58,759 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 00:20:58,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991229265] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:20:58,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:20:58,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 00:20:58,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658204458] [2022-12-13 00:20:58,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:20:58,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 00:20:58,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:20:58,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 00:20:58,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-12-13 00:20:58,761 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2022-12-13 00:20:58,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 558 transitions, 7217 flow. Second operand has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 0 states have call successors, (0), 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 00:20:58,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:20:58,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2022-12-13 00:20:58,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:21:01,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:05,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:07,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:09,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:11,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:13,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:15,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:18,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:20,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:22,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:24,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:26,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:28,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:32,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:34,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:36,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:38,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:40,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:42,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:44,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:47,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:49,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:52,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:56,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:58,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:00,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:02,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:05,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:06,414 INFO L130 PetriNetUnfolder]: 8492/14676 cut-off events. [2022-12-13 00:22:06,414 INFO L131 PetriNetUnfolder]: For 118749/118749 co-relation queries the response was YES. [2022-12-13 00:22:06,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78547 conditions, 14676 events. 8492/14676 cut-off events. For 118749/118749 co-relation queries the response was YES. Maximal size of possible extension queue 1777. Compared 125568 event pairs, 503 based on Foata normal form. 147/6806 useless extension candidates. Maximal degree in co-relation 78504. Up to 6387 conditions per place. [2022-12-13 00:22:06,466 INFO L137 encePairwiseOnDemand]: 16/43 looper letters, 371 selfloop transitions, 446 changer transitions 0/821 dead transitions. [2022-12-13 00:22:06,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 821 transitions, 11159 flow [2022-12-13 00:22:06,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 00:22:06,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 00:22:06,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 333 transitions. [2022-12-13 00:22:06,467 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5162790697674419 [2022-12-13 00:22:06,468 INFO L175 Difference]: Start difference. First operand has 113 places, 558 transitions, 7217 flow. Second operand 15 states and 333 transitions. [2022-12-13 00:22:06,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 821 transitions, 11159 flow [2022-12-13 00:22:07,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 821 transitions, 10733 flow, removed 80 selfloop flow, removed 9 redundant places. [2022-12-13 00:22:07,577 INFO L231 Difference]: Finished difference. Result has 122 places, 708 transitions, 10159 flow [2022-12-13 00:22:07,577 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=6839, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=330, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=10159, PETRI_PLACES=122, PETRI_TRANSITIONS=708} [2022-12-13 00:22:07,577 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 90 predicate places. [2022-12-13 00:22:07,577 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:22:07,577 INFO L89 Accepts]: Start accepts. Operand has 122 places, 708 transitions, 10159 flow [2022-12-13 00:22:07,579 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:22:07,579 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:22:07,579 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 708 transitions, 10159 flow [2022-12-13 00:22:07,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 708 transitions, 10159 flow [2022-12-13 00:22:07,979 INFO L130 PetriNetUnfolder]: 2056/4489 cut-off events. [2022-12-13 00:22:07,979 INFO L131 PetriNetUnfolder]: For 27313/27384 co-relation queries the response was YES. [2022-12-13 00:22:07,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29142 conditions, 4489 events. 2056/4489 cut-off events. For 27313/27384 co-relation queries the response was YES. Maximal size of possible extension queue 822. Compared 42625 event pairs, 0 based on Foata normal form. 0/1397 useless extension candidates. Maximal degree in co-relation 29097. Up to 2381 conditions per place. [2022-12-13 00:22:08,010 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 708 transitions, 10159 flow [2022-12-13 00:22:08,011 INFO L226 LiptonReduction]: Number of co-enabled transitions 7088 [2022-12-13 00:22:08,013 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:22:08,014 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 437 [2022-12-13 00:22:08,014 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 708 transitions, 10159 flow [2022-12-13 00:22:08,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 0 states have call successors, (0), 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 00:22:08,014 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:22:08,014 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:22:08,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-13 00:22:08,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:22:08,220 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:22:08,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:22:08,220 INFO L85 PathProgramCache]: Analyzing trace with hash -262813724, now seen corresponding path program 1 times [2022-12-13 00:22:08,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:22:08,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800393791] [2022-12-13 00:22:08,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:22:08,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:22:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:22:08,366 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 00:22:08,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:22:08,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800393791] [2022-12-13 00:22:08,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800393791] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:22:08,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126097383] [2022-12-13 00:22:08,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:22:08,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:22:08,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:22:08,368 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:22:08,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 00:22:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:22:08,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 00:22:08,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:22:08,579 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 00:22:08,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:22:08,909 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 00:22:08,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126097383] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:22:08,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:22:08,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 00:22:08,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302184070] [2022-12-13 00:22:08,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:22:08,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 00:22:08,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:22:08,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 00:22:08,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-13 00:22:08,911 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2022-12-13 00:22:08,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 708 transitions, 10159 flow. Second operand has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 0 states have call successors, (0), 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 00:22:08,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:22:08,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2022-12-13 00:22:08,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:22:16,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:18,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:20,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:26,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:29,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:31,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:33,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:35,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:37,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:39,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:41,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:43,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:45,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:47,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:49,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:51,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:54,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:55,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:56,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:59,144 INFO L130 PetriNetUnfolder]: 11607/20138 cut-off events. [2022-12-13 00:22:59,145 INFO L131 PetriNetUnfolder]: For 267783/267783 co-relation queries the response was YES. [2022-12-13 00:22:59,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120351 conditions, 20138 events. 11607/20138 cut-off events. For 267783/267783 co-relation queries the response was YES. Maximal size of possible extension queue 2449. Compared 179135 event pairs, 481 based on Foata normal form. 301/9372 useless extension candidates. Maximal degree in co-relation 120303. Up to 8563 conditions per place. [2022-12-13 00:22:59,224 INFO L137 encePairwiseOnDemand]: 16/43 looper letters, 343 selfloop transitions, 764 changer transitions 0/1111 dead transitions. [2022-12-13 00:22:59,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 1111 transitions, 16318 flow [2022-12-13 00:22:59,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 00:22:59,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 00:22:59,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 501 transitions. [2022-12-13 00:22:59,225 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48546511627906974 [2022-12-13 00:22:59,225 INFO L175 Difference]: Start difference. First operand has 122 places, 708 transitions, 10159 flow. Second operand 24 states and 501 transitions. [2022-12-13 00:22:59,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 1111 transitions, 16318 flow [2022-12-13 00:23:01,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 1111 transitions, 15715 flow, removed 224 selfloop flow, removed 6 redundant places. [2022-12-13 00:23:01,466 INFO L231 Difference]: Finished difference. Result has 148 places, 940 transitions, 15702 flow [2022-12-13 00:23:01,467 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=9680, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=708, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=566, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=15702, PETRI_PLACES=148, PETRI_TRANSITIONS=940} [2022-12-13 00:23:01,467 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 116 predicate places. [2022-12-13 00:23:01,467 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:23:01,467 INFO L89 Accepts]: Start accepts. Operand has 148 places, 940 transitions, 15702 flow [2022-12-13 00:23:01,469 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:23:01,469 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:23:01,469 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 940 transitions, 15702 flow [2022-12-13 00:23:01,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 940 transitions, 15702 flow [2022-12-13 00:23:02,153 INFO L130 PetriNetUnfolder]: 2712/6145 cut-off events. [2022-12-13 00:23:02,153 INFO L131 PetriNetUnfolder]: For 62096/62203 co-relation queries the response was YES. [2022-12-13 00:23:02,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45841 conditions, 6145 events. 2712/6145 cut-off events. For 62096/62203 co-relation queries the response was YES. Maximal size of possible extension queue 1114. Compared 62782 event pairs, 0 based on Foata normal form. 0/1943 useless extension candidates. Maximal degree in co-relation 45789. Up to 3089 conditions per place. [2022-12-13 00:23:02,210 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 940 transitions, 15702 flow [2022-12-13 00:23:02,210 INFO L226 LiptonReduction]: Number of co-enabled transitions 9256 [2022-12-13 00:23:02,237 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [304] L695-5-->L695-4: Formula: (and (< v_~q~0_30 10) (= v_~q~0_29 (+ |v_t2Thread1of1ForFork0_#t~post2_23| 1)) (= v_~q~0_30 |v_t2Thread1of1ForFork0_#t~post2_23|) (= v_~j~0_79 (+ v_~i~0_73 v_~j~0_80))) InVars {~j~0=v_~j~0_80, ~i~0=v_~i~0_73, ~q~0=v_~q~0_30} OutVars{~j~0=v_~j~0_79, ~i~0=v_~i~0_73, ~q~0=v_~q~0_29, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_23|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:23:02,299 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_25 (+ v_~q~0_26 1)) (< v_~q~0_26 10) (= v_~j~0_75 (+ v_~i~0_71 v_~j~0_76))) InVars {~j~0=v_~j~0_76, ~i~0=v_~i~0_71, ~q~0=v_~q~0_26} OutVars{~j~0=v_~j~0_75, ~i~0=v_~i~0_71, ~q~0=v_~q~0_25, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:23:02,351 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [283] L695-5-->L695-3: Formula: (and (< v_~q~0_19 10) (= v_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|)) InVars {~j~0=v_~j~0_48, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19} OutVars{~j~0=v_~j~0_47, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_11|} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:23:02,399 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [282] L695-5-->L698: Formula: (and (< v_~q~0_17 10) (= v_~j~0_43 (+ v_~i~0_37 v_~j~0_44))) InVars {~j~0=v_~j~0_44, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} OutVars{~j~0=v_~j~0_43, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} AuxVars[] AssignedVars[~j~0] [2022-12-13 00:23:02,434 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [322] L687-5-->L687-4: Formula: (and (< v_~p~0_44 10) (= v_~p~0_44 |v_t1Thread1of1ForFork1_#t~post1_19|) (= v_~p~0_43 (+ |v_t1Thread1of1ForFork1_#t~post1_19| 1)) (= (+ v_~j~0_107 v_~i~0_108) v_~i~0_107)) InVars {~j~0=v_~j~0_107, ~i~0=v_~i~0_108, ~p~0=v_~p~0_44} OutVars{~j~0=v_~j~0_107, ~i~0=v_~i~0_107, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_19|, ~p~0=v_~p~0_43} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:23:02,480 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [278] L687-5-->L690: Formula: (and (= v_~i~0_29 (+ v_~i~0_30 v_~j~0_37)) (< v_~p~0_21 10)) InVars {~j~0=v_~j~0_37, ~i~0=v_~i~0_30, ~p~0=v_~p~0_21} OutVars{~j~0=v_~j~0_37, ~i~0=v_~i~0_29, ~p~0=v_~p~0_21} AuxVars[] AssignedVars[~i~0] [2022-12-13 00:23:02,514 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [323] L687-5-->L687-5: Formula: (and (< v_~p~0_48 10) (= v_~p~0_47 (+ v_~p~0_48 1)) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:23:02,555 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [279] L687-5-->L687-3: Formula: (and (= v_~i~0_33 (+ v_~i~0_34 v_~j~0_39)) (< v_~p~0_23 10) (= v_~p~0_23 |v_t1Thread1of1ForFork1_#t~post1_15|)) InVars {~j~0=v_~j~0_39, ~i~0=v_~i~0_34, ~p~0=v_~p~0_23} OutVars{~j~0=v_~j~0_39, ~i~0=v_~i~0_33, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_15|, ~p~0=v_~p~0_23} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1] [2022-12-13 00:23:02,609 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:23:02,610 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1143 [2022-12-13 00:23:02,610 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 940 transitions, 15790 flow [2022-12-13 00:23:02,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 0 states have call successors, (0), 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 00:23:02,610 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:23:02,610 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:23:02,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-13 00:23:02,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:23:02,815 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:23:02,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:23:02,816 INFO L85 PathProgramCache]: Analyzing trace with hash -812165411, now seen corresponding path program 1 times [2022-12-13 00:23:02,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:23:02,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246756543] [2022-12-13 00:23:02,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:23:02,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:23:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:23:02,969 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 00:23:02,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:23:02,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246756543] [2022-12-13 00:23:02,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246756543] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:23:02,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987046723] [2022-12-13 00:23:02,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:23:02,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:23:02,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:23:02,971 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:23:02,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 00:23:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:23:03,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 00:23:03,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:23:03,172 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 00:23:03,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:23:03,522 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 00:23:03,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987046723] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:23:03,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:23:03,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 00:23:03,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086076556] [2022-12-13 00:23:03,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:23:03,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 00:23:03,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:23:03,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 00:23:03,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-13 00:23:03,523 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 51 [2022-12-13 00:23:03,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 940 transitions, 15790 flow. Second operand has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 0 states have call successors, (0), 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 00:23:03,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:23:03,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 51 [2022-12-13 00:23:03,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:23:05,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:06,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:08,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:13,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:15,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:19,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:22,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:30,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:32,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:34,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:36,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:38,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:40,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:42,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:44,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:46,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:48,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:51,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:53,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:55,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:57,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:59,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:24:02,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:24:04,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:24:06,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:24:08,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:24:10,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:24:12,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:24:14,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:24:18,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:24:19,755 INFO L130 PetriNetUnfolder]: 12125/21123 cut-off events. [2022-12-13 00:24:19,755 INFO L131 PetriNetUnfolder]: For 350501/350501 co-relation queries the response was YES. [2022-12-13 00:24:19,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138238 conditions, 21123 events. 12125/21123 cut-off events. For 350501/350501 co-relation queries the response was YES. Maximal size of possible extension queue 2618. Compared 191059 event pairs, 1243 based on Foata normal form. 322/9728 useless extension candidates. Maximal degree in co-relation 138183. Up to 14007 conditions per place. [2022-12-13 00:24:19,850 INFO L137 encePairwiseOnDemand]: 16/51 looper letters, 664 selfloop transitions, 491 changer transitions 1/1160 dead transitions. [2022-12-13 00:24:19,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 1160 transitions, 19759 flow [2022-12-13 00:24:19,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 00:24:19,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 00:24:19,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 395 transitions. [2022-12-13 00:24:19,852 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43028322440087147 [2022-12-13 00:24:19,852 INFO L175 Difference]: Start difference. First operand has 148 places, 940 transitions, 15790 flow. Second operand 18 states and 395 transitions. [2022-12-13 00:24:19,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 1160 transitions, 19759 flow [2022-12-13 00:24:23,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 1160 transitions, 18069 flow, removed 704 selfloop flow, removed 12 redundant places. [2022-12-13 00:24:23,822 INFO L231 Difference]: Finished difference. Result has 159 places, 1028 transitions, 16946 flow [2022-12-13 00:24:23,822 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=14122, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=940, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=410, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=16946, PETRI_PLACES=159, PETRI_TRANSITIONS=1028} [2022-12-13 00:24:23,823 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 127 predicate places. [2022-12-13 00:24:23,823 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:24:23,823 INFO L89 Accepts]: Start accepts. Operand has 159 places, 1028 transitions, 16946 flow [2022-12-13 00:24:23,825 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:24:23,825 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:24:23,826 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 1028 transitions, 16946 flow [2022-12-13 00:24:23,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 1028 transitions, 16946 flow [2022-12-13 00:24:24,398 INFO L130 PetriNetUnfolder]: 2928/6561 cut-off events. [2022-12-13 00:24:24,399 INFO L131 PetriNetUnfolder]: For 64613/64711 co-relation queries the response was YES. [2022-12-13 00:24:24,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48432 conditions, 6561 events. 2928/6561 cut-off events. For 64613/64711 co-relation queries the response was YES. Maximal size of possible extension queue 1195. Compared 67219 event pairs, 0 based on Foata normal form. 0/2041 useless extension candidates. Maximal degree in co-relation 48377. Up to 3309 conditions per place. [2022-12-13 00:24:24,452 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 1028 transitions, 16946 flow [2022-12-13 00:24:24,452 INFO L226 LiptonReduction]: Number of co-enabled transitions 9972 [2022-12-13 00:24:24,466 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [278] L687-5-->L690: Formula: (and (= v_~i~0_29 (+ v_~i~0_30 v_~j~0_37)) (< v_~p~0_21 10)) InVars {~j~0=v_~j~0_37, ~i~0=v_~i~0_30, ~p~0=v_~p~0_21} OutVars{~j~0=v_~j~0_37, ~i~0=v_~i~0_29, ~p~0=v_~p~0_21} AuxVars[] AssignedVars[~i~0] [2022-12-13 00:24:24,501 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [323] L687-5-->L687-5: Formula: (and (< v_~p~0_48 10) (= v_~p~0_47 (+ v_~p~0_48 1)) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:24:24,541 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [279] L687-5-->L687-3: Formula: (and (= v_~i~0_33 (+ v_~i~0_34 v_~j~0_39)) (< v_~p~0_23 10) (= v_~p~0_23 |v_t1Thread1of1ForFork1_#t~post1_15|)) InVars {~j~0=v_~j~0_39, ~i~0=v_~i~0_34, ~p~0=v_~p~0_23} OutVars{~j~0=v_~j~0_39, ~i~0=v_~i~0_33, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_15|, ~p~0=v_~p~0_23} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1] [2022-12-13 00:24:24,583 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [322] L687-5-->L687-4: Formula: (and (< v_~p~0_44 10) (= v_~p~0_44 |v_t1Thread1of1ForFork1_#t~post1_19|) (= v_~p~0_43 (+ |v_t1Thread1of1ForFork1_#t~post1_19| 1)) (= (+ v_~j~0_107 v_~i~0_108) v_~i~0_107)) InVars {~j~0=v_~j~0_107, ~i~0=v_~i~0_108, ~p~0=v_~p~0_44} OutVars{~j~0=v_~j~0_107, ~i~0=v_~i~0_107, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_19|, ~p~0=v_~p~0_43} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:24:24,636 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_25 (+ v_~q~0_26 1)) (< v_~q~0_26 10) (= v_~j~0_75 (+ v_~i~0_71 v_~j~0_76))) InVars {~j~0=v_~j~0_76, ~i~0=v_~i~0_71, ~q~0=v_~q~0_26} OutVars{~j~0=v_~j~0_75, ~i~0=v_~i~0_71, ~q~0=v_~q~0_25, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:24:24,676 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [283] L695-5-->L695-3: Formula: (and (< v_~q~0_19 10) (= v_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|)) InVars {~j~0=v_~j~0_48, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19} OutVars{~j~0=v_~j~0_47, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_11|} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:24:24,716 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [282] L695-5-->L698: Formula: (and (< v_~q~0_17 10) (= v_~j~0_43 (+ v_~i~0_37 v_~j~0_44))) InVars {~j~0=v_~j~0_44, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} OutVars{~j~0=v_~j~0_43, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} AuxVars[] AssignedVars[~j~0] [2022-12-13 00:24:24,750 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [304] L695-5-->L695-4: Formula: (and (< v_~q~0_30 10) (= v_~q~0_29 (+ |v_t2Thread1of1ForFork0_#t~post2_23| 1)) (= v_~q~0_30 |v_t2Thread1of1ForFork0_#t~post2_23|) (= v_~j~0_79 (+ v_~i~0_73 v_~j~0_80))) InVars {~j~0=v_~j~0_80, ~i~0=v_~i~0_73, ~q~0=v_~q~0_30} OutVars{~j~0=v_~j~0_79, ~i~0=v_~i~0_73, ~q~0=v_~q~0_29, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_23|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:24:24,818 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:24:24,818 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 995 [2022-12-13 00:24:24,818 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 1028 transitions, 17050 flow [2022-12-13 00:24:24,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 0 states have call successors, (0), 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 00:24:24,819 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:24:24,819 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:24:24,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-13 00:24:25,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-13 00:24:25,024 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:24:25,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:24:25,024 INFO L85 PathProgramCache]: Analyzing trace with hash -281402533, now seen corresponding path program 1 times [2022-12-13 00:24:25,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:24:25,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524232676] [2022-12-13 00:24:25,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:24:25,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:24:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:24:25,168 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 00:24:25,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:24:25,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524232676] [2022-12-13 00:24:25,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524232676] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:24:25,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681345282] [2022-12-13 00:24:25,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:24:25,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:24:25,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:24:25,170 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:24:25,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 00:24:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:24:25,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 00:24:25,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:24:25,383 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 00:24:25,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:24:25,704 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 00:24:25,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681345282] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:24:25,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:24:25,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 00:24:25,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595005209] [2022-12-13 00:24:25,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:24:25,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 00:24:25,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:24:25,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 00:24:25,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-13 00:24:25,705 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 59 [2022-12-13 00:24:25,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 1028 transitions, 17050 flow. Second operand has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 0 states have call successors, (0), 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 00:24:25,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:24:25,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 59 [2022-12-13 00:24:25,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:24:38,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:24:40,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:24:42,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:24:44,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:24:46,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:24:48,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:24:50,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:24:51,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:24:54,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:24:55,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:24:56,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:24:59,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:25:01,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:25:03,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:25:04,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:25:06,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:25:08,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:25:10,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:25:14,770 INFO L130 PetriNetUnfolder]: 14322/25054 cut-off events. [2022-12-13 00:25:14,771 INFO L131 PetriNetUnfolder]: For 494833/494833 co-relation queries the response was YES. [2022-12-13 00:25:14,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165419 conditions, 25054 events. 14322/25054 cut-off events. For 494833/494833 co-relation queries the response was YES. Maximal size of possible extension queue 3094. Compared 233499 event pairs, 720 based on Foata normal form. 448/11484 useless extension candidates. Maximal degree in co-relation 165361. Up to 12502 conditions per place. [2022-12-13 00:25:14,887 INFO L137 encePairwiseOnDemand]: 16/59 looper letters, 536 selfloop transitions, 875 changer transitions 1/1416 dead transitions. [2022-12-13 00:25:14,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 1416 transitions, 24027 flow [2022-12-13 00:25:14,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 00:25:14,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-13 00:25:14,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 533 transitions. [2022-12-13 00:25:14,893 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36135593220338985 [2022-12-13 00:25:14,893 INFO L175 Difference]: Start difference. First operand has 158 places, 1028 transitions, 17050 flow. Second operand 25 states and 533 transitions. [2022-12-13 00:25:14,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 1416 transitions, 24027 flow [2022-12-13 00:25:20,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 1416 transitions, 23113 flow, removed 209 selfloop flow, removed 11 redundant places. [2022-12-13 00:25:20,984 INFO L231 Difference]: Finished difference. Result has 180 places, 1240 transitions, 22746 flow [2022-12-13 00:25:20,984 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=16136, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1028, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=686, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=22746, PETRI_PLACES=180, PETRI_TRANSITIONS=1240} [2022-12-13 00:25:20,985 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 148 predicate places. [2022-12-13 00:25:20,985 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:25:20,985 INFO L89 Accepts]: Start accepts. Operand has 180 places, 1240 transitions, 22746 flow [2022-12-13 00:25:20,987 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:25:20,987 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:25:20,988 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 1240 transitions, 22746 flow [2022-12-13 00:25:20,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 1240 transitions, 22746 flow [2022-12-13 00:25:21,868 INFO L130 PetriNetUnfolder]: 3520/7865 cut-off events. [2022-12-13 00:25:21,868 INFO L131 PetriNetUnfolder]: For 125637/125735 co-relation queries the response was YES. [2022-12-13 00:25:21,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66046 conditions, 7865 events. 3520/7865 cut-off events. For 125637/125735 co-relation queries the response was YES. Maximal size of possible extension queue 1415. Compared 82638 event pairs, 0 based on Foata normal form. 0/2439 useless extension candidates. Maximal degree in co-relation 65981. Up to 4285 conditions per place. [2022-12-13 00:25:22,102 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 1240 transitions, 22746 flow [2022-12-13 00:25:22,103 INFO L226 LiptonReduction]: Number of co-enabled transitions 11828 [2022-12-13 00:25:22,145 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [283] L695-5-->L695-3: Formula: (and (< v_~q~0_19 10) (= v_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|)) InVars {~j~0=v_~j~0_48, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19} OutVars{~j~0=v_~j~0_47, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_11|} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:25:22,196 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [282] L695-5-->L698: Formula: (and (< v_~q~0_17 10) (= v_~j~0_43 (+ v_~i~0_37 v_~j~0_44))) InVars {~j~0=v_~j~0_44, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} OutVars{~j~0=v_~j~0_43, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} AuxVars[] AssignedVars[~j~0] [2022-12-13 00:25:22,370 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [304] L695-5-->L695-4: Formula: (and (< v_~q~0_30 10) (= v_~q~0_29 (+ |v_t2Thread1of1ForFork0_#t~post2_23| 1)) (= v_~q~0_30 |v_t2Thread1of1ForFork0_#t~post2_23|) (= v_~j~0_79 (+ v_~i~0_73 v_~j~0_80))) InVars {~j~0=v_~j~0_80, ~i~0=v_~i~0_73, ~q~0=v_~q~0_30} OutVars{~j~0=v_~j~0_79, ~i~0=v_~i~0_73, ~q~0=v_~q~0_29, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_23|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:25:22,425 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [278] L687-5-->L690: Formula: (and (= v_~i~0_29 (+ v_~i~0_30 v_~j~0_37)) (< v_~p~0_21 10)) InVars {~j~0=v_~j~0_37, ~i~0=v_~i~0_30, ~p~0=v_~p~0_21} OutVars{~j~0=v_~j~0_37, ~i~0=v_~i~0_29, ~p~0=v_~p~0_21} AuxVars[] AssignedVars[~i~0] [2022-12-13 00:25:22,460 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_25 (+ v_~q~0_26 1)) (< v_~q~0_26 10) (= v_~j~0_75 (+ v_~i~0_71 v_~j~0_76))) InVars {~j~0=v_~j~0_76, ~i~0=v_~i~0_71, ~q~0=v_~q~0_26} OutVars{~j~0=v_~j~0_75, ~i~0=v_~i~0_71, ~q~0=v_~q~0_25, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:25:22,501 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [323] L687-5-->L687-5: Formula: (and (< v_~p~0_48 10) (= v_~p~0_47 (+ v_~p~0_48 1)) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:25:22,540 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [279] L687-5-->L687-3: Formula: (and (= v_~i~0_33 (+ v_~i~0_34 v_~j~0_39)) (< v_~p~0_23 10) (= v_~p~0_23 |v_t1Thread1of1ForFork1_#t~post1_15|)) InVars {~j~0=v_~j~0_39, ~i~0=v_~i~0_34, ~p~0=v_~p~0_23} OutVars{~j~0=v_~j~0_39, ~i~0=v_~i~0_33, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_15|, ~p~0=v_~p~0_23} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1] [2022-12-13 00:25:22,580 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [322] L687-5-->L687-4: Formula: (and (< v_~p~0_44 10) (= v_~p~0_44 |v_t1Thread1of1ForFork1_#t~post1_19|) (= v_~p~0_43 (+ |v_t1Thread1of1ForFork1_#t~post1_19| 1)) (= (+ v_~j~0_107 v_~i~0_108) v_~i~0_107)) InVars {~j~0=v_~j~0_107, ~i~0=v_~i~0_108, ~p~0=v_~p~0_44} OutVars{~j~0=v_~j~0_107, ~i~0=v_~i~0_107, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_19|, ~p~0=v_~p~0_43} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:25:22,635 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:25:22,636 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1651 [2022-12-13 00:25:22,636 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 1240 transitions, 22826 flow [2022-12-13 00:25:22,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 0 states have call successors, (0), 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 00:25:22,636 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:25:22,637 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:25:22,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-13 00:25:22,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 00:25:22,843 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:25:22,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:25:22,844 INFO L85 PathProgramCache]: Analyzing trace with hash -38298522, now seen corresponding path program 1 times [2022-12-13 00:25:22,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:25:22,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715345552] [2022-12-13 00:25:22,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:25:22,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:25:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:25:23,005 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:25:23,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:25:23,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715345552] [2022-12-13 00:25:23,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715345552] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:25:23,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607879984] [2022-12-13 00:25:23,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:25:23,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:25:23,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:25:23,007 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:25:23,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 00:25:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:25:23,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 00:25:23,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:25:23,228 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:25:23,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:25:23,618 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:25:23,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607879984] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:25:23,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:25:23,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-13 00:25:23,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903173058] [2022-12-13 00:25:23,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:25:23,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 00:25:23,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:25:23,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 00:25:23,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-12-13 00:25:23,620 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 67 [2022-12-13 00:25:23,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 1240 transitions, 22826 flow. Second operand has 20 states, 20 states have (on average 5.8) internal successors, (116), 20 states have internal predecessors, (116), 0 states have call successors, (0), 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 00:25:23,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:25:23,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 67 [2022-12-13 00:25:23,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:25:32,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:25:36,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:25:39,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:25:41,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:25:44,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:25:46,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:25:48,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:25:50,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:25:52,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:25:54,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:25:56,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:25:58,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:26:00,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:26:02,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:26:04,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:26:09,767 INFO L130 PetriNetUnfolder]: 15575/27416 cut-off events. [2022-12-13 00:26:09,768 INFO L131 PetriNetUnfolder]: For 798644/798644 co-relation queries the response was YES. [2022-12-13 00:26:09,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199737 conditions, 27416 events. 15575/27416 cut-off events. For 798644/798644 co-relation queries the response was YES. Maximal size of possible extension queue 3251. Compared 257942 event pairs, 2118 based on Foata normal form. 497/12388 useless extension candidates. Maximal degree in co-relation 199669. Up to 19932 conditions per place. [2022-12-13 00:26:10,012 INFO L137 encePairwiseOnDemand]: 24/67 looper letters, 974 selfloop transitions, 557 changer transitions 1/1536 dead transitions. [2022-12-13 00:26:10,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 1536 transitions, 29114 flow [2022-12-13 00:26:10,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 00:26:10,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-13 00:26:10,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 458 transitions. [2022-12-13 00:26:10,014 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32551528073916136 [2022-12-13 00:26:10,014 INFO L175 Difference]: Start difference. First operand has 179 places, 1240 transitions, 22826 flow. Second operand 21 states and 458 transitions. [2022-12-13 00:26:10,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 1536 transitions, 29114 flow [2022-12-13 00:26:19,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 1536 transitions, 27207 flow, removed 795 selfloop flow, removed 12 redundant places. [2022-12-13 00:26:19,350 INFO L231 Difference]: Finished difference. Result has 194 places, 1392 transitions, 25607 flow [2022-12-13 00:26:19,351 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=20985, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=436, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=787, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=25607, PETRI_PLACES=194, PETRI_TRANSITIONS=1392} [2022-12-13 00:26:19,351 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 162 predicate places. [2022-12-13 00:26:19,351 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:26:19,351 INFO L89 Accepts]: Start accepts. Operand has 194 places, 1392 transitions, 25607 flow [2022-12-13 00:26:19,355 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:26:19,355 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:26:19,355 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 194 places, 1392 transitions, 25607 flow [2022-12-13 00:26:19,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 1392 transitions, 25607 flow [2022-12-13 00:26:20,611 INFO L130 PetriNetUnfolder]: 3956/8805 cut-off events. [2022-12-13 00:26:20,612 INFO L131 PetriNetUnfolder]: For 164180/164269 co-relation queries the response was YES. [2022-12-13 00:26:20,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74508 conditions, 8805 events. 3956/8805 cut-off events. For 164180/164269 co-relation queries the response was YES. Maximal size of possible extension queue 1440. Compared 91709 event pairs, 0 based on Foata normal form. 0/2677 useless extension candidates. Maximal degree in co-relation 74437. Up to 4973 conditions per place. [2022-12-13 00:26:20,692 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 1392 transitions, 25607 flow [2022-12-13 00:26:20,692 INFO L226 LiptonReduction]: Number of co-enabled transitions 13220 [2022-12-13 00:26:20,704 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [279] L687-5-->L687-3: Formula: (and (= v_~i~0_33 (+ v_~i~0_34 v_~j~0_39)) (< v_~p~0_23 10) (= v_~p~0_23 |v_t1Thread1of1ForFork1_#t~post1_15|)) InVars {~j~0=v_~j~0_39, ~i~0=v_~i~0_34, ~p~0=v_~p~0_23} OutVars{~j~0=v_~j~0_39, ~i~0=v_~i~0_33, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_15|, ~p~0=v_~p~0_23} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1] [2022-12-13 00:26:20,744 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [322] L687-5-->L687-4: Formula: (and (< v_~p~0_44 10) (= v_~p~0_44 |v_t1Thread1of1ForFork1_#t~post1_19|) (= v_~p~0_43 (+ |v_t1Thread1of1ForFork1_#t~post1_19| 1)) (= (+ v_~j~0_107 v_~i~0_108) v_~i~0_107)) InVars {~j~0=v_~j~0_107, ~i~0=v_~i~0_108, ~p~0=v_~p~0_44} OutVars{~j~0=v_~j~0_107, ~i~0=v_~i~0_107, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_19|, ~p~0=v_~p~0_43} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:26:20,790 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [278] L687-5-->L690: Formula: (and (= v_~i~0_29 (+ v_~i~0_30 v_~j~0_37)) (< v_~p~0_21 10)) InVars {~j~0=v_~j~0_37, ~i~0=v_~i~0_30, ~p~0=v_~p~0_21} OutVars{~j~0=v_~j~0_37, ~i~0=v_~i~0_29, ~p~0=v_~p~0_21} AuxVars[] AssignedVars[~i~0] [2022-12-13 00:26:20,826 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [323] L687-5-->L687-5: Formula: (and (< v_~p~0_48 10) (= v_~p~0_47 (+ v_~p~0_48 1)) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:26:20,867 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [304] L695-5-->L695-4: Formula: (and (< v_~q~0_30 10) (= v_~q~0_29 (+ |v_t2Thread1of1ForFork0_#t~post2_23| 1)) (= v_~q~0_30 |v_t2Thread1of1ForFork0_#t~post2_23|) (= v_~j~0_79 (+ v_~i~0_73 v_~j~0_80))) InVars {~j~0=v_~j~0_80, ~i~0=v_~i~0_73, ~q~0=v_~q~0_30} OutVars{~j~0=v_~j~0_79, ~i~0=v_~i~0_73, ~q~0=v_~q~0_29, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_23|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:26:20,925 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_25 (+ v_~q~0_26 1)) (< v_~q~0_26 10) (= v_~j~0_75 (+ v_~i~0_71 v_~j~0_76))) InVars {~j~0=v_~j~0_76, ~i~0=v_~i~0_71, ~q~0=v_~q~0_26} OutVars{~j~0=v_~j~0_75, ~i~0=v_~i~0_71, ~q~0=v_~q~0_25, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:26:20,967 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [283] L695-5-->L695-3: Formula: (and (< v_~q~0_19 10) (= v_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|)) InVars {~j~0=v_~j~0_48, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19} OutVars{~j~0=v_~j~0_47, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_11|} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:26:21,008 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (* v_~next~0_109 10946) (+ v_~cur~0_168 (* v_~prev~0_192 17711))) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= (+ (* 6765 v_~next~0_109) v_~prev~0_194 v_~cur~0_168) (* 10946 v_~prev~0_192))) InVars {~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_192, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [282] L695-5-->L698: Formula: (and (< v_~q~0_17 10) (= v_~j~0_43 (+ v_~i~0_37 v_~j~0_44))) InVars {~j~0=v_~j~0_44, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} OutVars{~j~0=v_~j~0_43, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} AuxVars[] AssignedVars[~j~0] [2022-12-13 00:26:21,048 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (not (< v_~x~0_35 22)) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [323] L687-5-->L687-5: Formula: (and (< v_~p~0_48 10) (= v_~p~0_47 (+ v_~p~0_48 1)) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:26:21,125 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (not (< v_~x~0_35 22)) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [322] L687-5-->L687-4: Formula: (and (< v_~p~0_44 10) (= v_~p~0_44 |v_t1Thread1of1ForFork1_#t~post1_19|) (= v_~p~0_43 (+ |v_t1Thread1of1ForFork1_#t~post1_19| 1)) (= (+ v_~j~0_107 v_~i~0_108) v_~i~0_107)) InVars {~j~0=v_~j~0_107, ~i~0=v_~i~0_108, ~p~0=v_~p~0_44} OutVars{~j~0=v_~j~0_107, ~i~0=v_~i~0_107, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_19|, ~p~0=v_~p~0_43} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:26:21,235 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (not (< v_~x~0_35 22)) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [323] L687-5-->L687-5: Formula: (and (< v_~p~0_48 10) (= v_~p~0_47 (+ v_~p~0_48 1)) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:26:21,319 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (not (< v_~x~0_35 22)) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [279] L687-5-->L687-3: Formula: (and (= v_~i~0_33 (+ v_~i~0_34 v_~j~0_39)) (< v_~p~0_23 10) (= v_~p~0_23 |v_t1Thread1of1ForFork1_#t~post1_15|)) InVars {~j~0=v_~j~0_39, ~i~0=v_~i~0_34, ~p~0=v_~p~0_23} OutVars{~j~0=v_~j~0_39, ~i~0=v_~i~0_33, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_15|, ~p~0=v_~p~0_23} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1] [2022-12-13 00:26:21,406 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (not (< v_~x~0_35 22)) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [283] L695-5-->L695-3: Formula: (and (< v_~q~0_19 10) (= v_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|)) InVars {~j~0=v_~j~0_48, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19} OutVars{~j~0=v_~j~0_47, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_11|} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:26:21,481 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (not (< v_~x~0_35 22)) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_25 (+ v_~q~0_26 1)) (< v_~q~0_26 10) (= v_~j~0_75 (+ v_~i~0_71 v_~j~0_76))) InVars {~j~0=v_~j~0_76, ~i~0=v_~i~0_71, ~q~0=v_~q~0_26} OutVars{~j~0=v_~j~0_75, ~i~0=v_~i~0_71, ~q~0=v_~q~0_25, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:26:21,555 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (not (< v_~x~0_35 22)) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [279] L687-5-->L687-3: Formula: (and (= v_~i~0_33 (+ v_~i~0_34 v_~j~0_39)) (< v_~p~0_23 10) (= v_~p~0_23 |v_t1Thread1of1ForFork1_#t~post1_15|)) InVars {~j~0=v_~j~0_39, ~i~0=v_~i~0_34, ~p~0=v_~p~0_23} OutVars{~j~0=v_~j~0_39, ~i~0=v_~i~0_33, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_15|, ~p~0=v_~p~0_23} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1] [2022-12-13 00:26:21,630 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (not (< v_~x~0_35 22)) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [304] L695-5-->L695-4: Formula: (and (< v_~q~0_30 10) (= v_~q~0_29 (+ |v_t2Thread1of1ForFork0_#t~post2_23| 1)) (= v_~q~0_30 |v_t2Thread1of1ForFork0_#t~post2_23|) (= v_~j~0_79 (+ v_~i~0_73 v_~j~0_80))) InVars {~j~0=v_~j~0_80, ~i~0=v_~i~0_73, ~q~0=v_~q~0_30} OutVars{~j~0=v_~j~0_79, ~i~0=v_~i~0_73, ~q~0=v_~q~0_29, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_23|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:26:21,711 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (not (< v_~x~0_35 22)) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [282] L695-5-->L698: Formula: (and (< v_~q~0_17 10) (= v_~j~0_43 (+ v_~i~0_37 v_~j~0_44))) InVars {~j~0=v_~j~0_44, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} OutVars{~j~0=v_~j~0_43, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} AuxVars[] AssignedVars[~j~0] [2022-12-13 00:26:21,779 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (not (< v_~x~0_35 22)) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [278] L687-5-->L690: Formula: (and (= v_~i~0_29 (+ v_~i~0_30 v_~j~0_37)) (< v_~p~0_21 10)) InVars {~j~0=v_~j~0_37, ~i~0=v_~i~0_30, ~p~0=v_~p~0_21} OutVars{~j~0=v_~j~0_37, ~i~0=v_~i~0_29, ~p~0=v_~p~0_21} AuxVars[] AssignedVars[~i~0] [2022-12-13 00:26:21,848 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (not (< v_~x~0_35 22)) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [282] L695-5-->L698: Formula: (and (< v_~q~0_17 10) (= v_~j~0_43 (+ v_~i~0_37 v_~j~0_44))) InVars {~j~0=v_~j~0_44, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} OutVars{~j~0=v_~j~0_43, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} AuxVars[] AssignedVars[~j~0] [2022-12-13 00:26:21,916 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (not (< v_~x~0_35 22)) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [278] L687-5-->L690: Formula: (and (= v_~i~0_29 (+ v_~i~0_30 v_~j~0_37)) (< v_~p~0_21 10)) InVars {~j~0=v_~j~0_37, ~i~0=v_~i~0_30, ~p~0=v_~p~0_21} OutVars{~j~0=v_~j~0_37, ~i~0=v_~i~0_29, ~p~0=v_~p~0_21} AuxVars[] AssignedVars[~i~0] [2022-12-13 00:26:21,983 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (not (< v_~x~0_35 22)) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [283] L695-5-->L695-3: Formula: (and (< v_~q~0_19 10) (= v_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|)) InVars {~j~0=v_~j~0_48, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19} OutVars{~j~0=v_~j~0_47, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_11|} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:26:22,068 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (not (< v_~x~0_35 22)) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_25 (+ v_~q~0_26 1)) (< v_~q~0_26 10) (= v_~j~0_75 (+ v_~i~0_71 v_~j~0_76))) InVars {~j~0=v_~j~0_76, ~i~0=v_~i~0_71, ~q~0=v_~q~0_26} OutVars{~j~0=v_~j~0_75, ~i~0=v_~i~0_71, ~q~0=v_~q~0_25, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:26:22,148 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (not (< v_~x~0_35 22)) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [322] L687-5-->L687-4: Formula: (and (< v_~p~0_44 10) (= v_~p~0_44 |v_t1Thread1of1ForFork1_#t~post1_19|) (= v_~p~0_43 (+ |v_t1Thread1of1ForFork1_#t~post1_19| 1)) (= (+ v_~j~0_107 v_~i~0_108) v_~i~0_107)) InVars {~j~0=v_~j~0_107, ~i~0=v_~i~0_108, ~p~0=v_~p~0_44} OutVars{~j~0=v_~j~0_107, ~i~0=v_~i~0_107, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_19|, ~p~0=v_~p~0_43} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:26:22,232 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (not (< v_~x~0_35 22)) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [304] L695-5-->L695-4: Formula: (and (< v_~q~0_30 10) (= v_~q~0_29 (+ |v_t2Thread1of1ForFork0_#t~post2_23| 1)) (= v_~q~0_30 |v_t2Thread1of1ForFork0_#t~post2_23|) (= v_~j~0_79 (+ v_~i~0_73 v_~j~0_80))) InVars {~j~0=v_~j~0_80, ~i~0=v_~i~0_73, ~q~0=v_~q~0_30} OutVars{~j~0=v_~j~0_79, ~i~0=v_~i~0_73, ~q~0=v_~q~0_29, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_23|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:26:22,326 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:26:22,327 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2976 [2022-12-13 00:26:22,327 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 1392 transitions, 26887 flow [2022-12-13 00:26:22,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.8) internal successors, (116), 20 states have internal predecessors, (116), 0 states have call successors, (0), 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 00:26:22,328 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:26:22,328 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:26:22,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-13 00:26:22,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:26:22,533 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:26:22,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:26:22,533 INFO L85 PathProgramCache]: Analyzing trace with hash -280611010, now seen corresponding path program 1 times [2022-12-13 00:26:22,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:26:22,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125160893] [2022-12-13 00:26:22,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:26:22,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:26:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:26:22,709 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 00:26:22,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:26:22,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125160893] [2022-12-13 00:26:22,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125160893] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:26:22,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740889001] [2022-12-13 00:26:22,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:26:22,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:26:22,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:26:22,712 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:26:22,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 00:26:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:26:22,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 00:26:22,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:26:22,930 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 00:26:22,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:26:23,298 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 00:26:23,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740889001] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:26:23,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:26:23,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 00:26:23,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336151069] [2022-12-13 00:26:23,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:26:23,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 00:26:23,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:26:23,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 00:26:23,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-13 00:26:23,300 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 91 [2022-12-13 00:26:23,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 1392 transitions, 26887 flow. Second operand has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 0 states have call successors, (0), 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 00:26:23,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:26:23,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 91 [2022-12-13 00:26:23,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:26:36,518 WARN L233 SmtUtils]: Spent 11.27s on a formula simplification. DAG size of input: 63 DAG size of output: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 00:26:38,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:26:42,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:26:44,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:26:46,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:26:49,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:26:51,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:26:53,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:26:55,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:26:57,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:26:59,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:01,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:04,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:06,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:07,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:09,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:12,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:13,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:15,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:17,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:24,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:28,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:30,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:32,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:38,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:40,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:42,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:44,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:53,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:54,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:58,618 INFO L130 PetriNetUnfolder]: 16666/29467 cut-off events. [2022-12-13 00:27:58,618 INFO L131 PetriNetUnfolder]: For 860080/860080 co-relation queries the response was YES. [2022-12-13 00:27:58,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219957 conditions, 29467 events. 16666/29467 cut-off events. For 860080/860080 co-relation queries the response was YES. Maximal size of possible extension queue 3445. Compared 282571 event pairs, 2001 based on Foata normal form. 294/12905 useless extension candidates. Maximal degree in co-relation 219883. Up to 19791 conditions per place. [2022-12-13 00:27:58,806 INFO L137 encePairwiseOnDemand]: 32/91 looper letters, 917 selfloop transitions, 778 changer transitions 10/1709 dead transitions. [2022-12-13 00:27:58,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 1709 transitions, 33712 flow [2022-12-13 00:27:58,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 00:27:58,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-13 00:27:58,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 518 transitions. [2022-12-13 00:27:58,809 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24749163879598662 [2022-12-13 00:27:58,809 INFO L175 Difference]: Start difference. First operand has 193 places, 1392 transitions, 26887 flow. Second operand 23 states and 518 transitions. [2022-12-13 00:27:58,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 1709 transitions, 33712 flow [2022-12-13 00:28:13,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 1709 transitions, 30951 flow, removed 1272 selfloop flow, removed 8 redundant places. [2022-12-13 00:28:13,726 INFO L231 Difference]: Finished difference. Result has 215 places, 1544 transitions, 29578 flow [2022-12-13 00:28:13,727 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=24222, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=665, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=29578, PETRI_PLACES=215, PETRI_TRANSITIONS=1544} [2022-12-13 00:28:13,727 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 183 predicate places. [2022-12-13 00:28:13,727 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:28:13,727 INFO L89 Accepts]: Start accepts. Operand has 215 places, 1544 transitions, 29578 flow [2022-12-13 00:28:13,730 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:28:13,730 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:28:13,730 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 215 places, 1544 transitions, 29578 flow [2022-12-13 00:28:13,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 214 places, 1544 transitions, 29578 flow [2022-12-13 00:28:15,018 INFO L130 PetriNetUnfolder]: 4248/9544 cut-off events. [2022-12-13 00:28:15,018 INFO L131 PetriNetUnfolder]: For 191665/191770 co-relation queries the response was YES. [2022-12-13 00:28:15,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83244 conditions, 9544 events. 4248/9544 cut-off events. For 191665/191770 co-relation queries the response was YES. Maximal size of possible extension queue 1575. Compared 102252 event pairs, 0 based on Foata normal form. 0/2869 useless extension candidates. Maximal degree in co-relation 83165. Up to 5006 conditions per place. [2022-12-13 00:28:15,115 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 214 places, 1544 transitions, 29578 flow [2022-12-13 00:28:15,115 INFO L226 LiptonReduction]: Number of co-enabled transitions 14436 [2022-12-13 00:28:15,121 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:28:15,122 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1395 [2022-12-13 00:28:15,123 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 1544 transitions, 29578 flow [2022-12-13 00:28:15,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 0 states have call successors, (0), 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 00:28:15,123 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:28:15,123 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:28:15,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-13 00:28:15,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:28:15,324 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting L690 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:28:15,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:28:15,325 INFO L85 PathProgramCache]: Analyzing trace with hash 462364319, now seen corresponding path program 1 times [2022-12-13 00:28:15,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:28:15,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006837946] [2022-12-13 00:28:15,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:28:15,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:28:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:28:15,488 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 00:28:15,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:28:15,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006837946] [2022-12-13 00:28:15,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006837946] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:28:15,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189935806] [2022-12-13 00:28:15,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:28:15,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:28:15,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:28:15,492 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:28:15,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 00:28:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:28:15,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 00:28:15,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:28:15,796 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 00:28:15,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:28:16,163 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 00:28:16,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189935806] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:28:16,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:28:16,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-13 00:28:16,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337918001] [2022-12-13 00:28:16,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:28:16,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 00:28:16,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:28:16,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 00:28:16,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-12-13 00:28:16,165 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 91 [2022-12-13 00:28:16,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 1544 transitions, 29578 flow. Second operand has 20 states, 20 states have (on average 5.95) internal successors, (119), 20 states have internal predecessors, (119), 0 states have call successors, (0), 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 00:28:16,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:28:16,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 91 [2022-12-13 00:28:16,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:28:25,921 WARN L233 SmtUtils]: Spent 9.01s on a formula simplification. DAG size of input: 58 DAG size of output: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 00:28:32,160 WARN L233 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 62 DAG size of output: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 00:28:35,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:28:37,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:28:43,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:28:45,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:28:48,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:28:50,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:28:52,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:28:54,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:28:57,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:28:59,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:01,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:03,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:08,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:10,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:12,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:14,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:16,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:18,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:20,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:22,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:24,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:26,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:28,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:30,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:32,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:34,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:37,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:39,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:41,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:43,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:46,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:48,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:50,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:52,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:54,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:57,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:58,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:00,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:02,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:04,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:06,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:08,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:10,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:12,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:14,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:17,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:19,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:21,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:24,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:26,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:27,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:29,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:32,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:34,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:36,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:38,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:40,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:42,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:44,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:46,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:48,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:54,892 INFO L130 PetriNetUnfolder]: 17002/30313 cut-off events. [2022-12-13 00:30:54,893 INFO L131 PetriNetUnfolder]: For 876295/876295 co-relation queries the response was YES. [2022-12-13 00:30:55,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226735 conditions, 30313 events. 17002/30313 cut-off events. For 876295/876295 co-relation queries the response was YES. Maximal size of possible extension queue 3647. Compared 294240 event pairs, 1047 based on Foata normal form. 355/13206 useless extension candidates. Maximal degree in co-relation 226653. Up to 16902 conditions per place. [2022-12-13 00:30:55,150 INFO L137 encePairwiseOnDemand]: 16/91 looper letters, 786 selfloop transitions, 1026 changer transitions 0/1816 dead transitions. [2022-12-13 00:30:55,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 1816 transitions, 35796 flow [2022-12-13 00:30:55,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 00:30:55,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-13 00:30:55,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 523 transitions. [2022-12-13 00:30:55,152 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24988055422838032 [2022-12-13 00:30:55,152 INFO L175 Difference]: Start difference. First operand has 214 places, 1544 transitions, 29578 flow. Second operand 23 states and 523 transitions. [2022-12-13 00:30:55,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 1816 transitions, 35796 flow [2022-12-13 00:31:09,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 1816 transitions, 35065 flow, removed 259 selfloop flow, removed 9 redundant places. [2022-12-13 00:31:09,264 INFO L231 Difference]: Finished difference. Result has 232 places, 1656 transitions, 34324 flow [2022-12-13 00:31:09,265 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=28240, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=905, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=34324, PETRI_PLACES=232, PETRI_TRANSITIONS=1656} [2022-12-13 00:31:09,266 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 200 predicate places. [2022-12-13 00:31:09,266 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:31:09,266 INFO L89 Accepts]: Start accepts. Operand has 232 places, 1656 transitions, 34324 flow [2022-12-13 00:31:09,270 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:31:09,271 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:31:09,271 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 232 places, 1656 transitions, 34324 flow [2022-12-13 00:31:09,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 232 places, 1656 transitions, 34324 flow [2022-12-13 00:31:10,886 INFO L130 PetriNetUnfolder]: 4404/10040 cut-off events. [2022-12-13 00:31:10,887 INFO L131 PetriNetUnfolder]: For 203284/203419 co-relation queries the response was YES. [2022-12-13 00:31:10,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92714 conditions, 10040 events. 4404/10040 cut-off events. For 203284/203419 co-relation queries the response was YES. Maximal size of possible extension queue 1710. Compared 109495 event pairs, 0 based on Foata normal form. 0/2978 useless extension candidates. Maximal degree in co-relation 92628. Up to 5330 conditions per place. [2022-12-13 00:31:11,019 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 232 places, 1656 transitions, 34324 flow [2022-12-13 00:31:11,019 INFO L226 LiptonReduction]: Number of co-enabled transitions 15264 [2022-12-13 00:31:11,024 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:31:11,025 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1759 [2022-12-13 00:31:11,025 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 1656 transitions, 34324 flow [2022-12-13 00:31:11,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.95) internal successors, (119), 20 states have internal predecessors, (119), 0 states have call successors, (0), 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 00:31:11,025 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:31:11,025 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:31:11,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-13 00:31:11,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 00:31:11,226 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:31:11,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:31:11,227 INFO L85 PathProgramCache]: Analyzing trace with hash 480497582, now seen corresponding path program 1 times [2022-12-13 00:31:11,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:31:11,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817686158] [2022-12-13 00:31:11,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:31:11,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:31:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:31:11,445 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:31:11,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:31:11,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817686158] [2022-12-13 00:31:11,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817686158] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:31:11,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905914945] [2022-12-13 00:31:11,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:31:11,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:31:11,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:31:11,448 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:31:11,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-13 00:31:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:31:11,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 00:31:11,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:31:11,651 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:31:11,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:31:11,988 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:31:11,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905914945] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:31:11,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:31:11,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-13 00:31:11,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939448559] [2022-12-13 00:31:11,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:31:11,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 00:31:11,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:31:11,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 00:31:11,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2022-12-13 00:31:11,990 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 75 [2022-12-13 00:31:11,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 1656 transitions, 34324 flow. Second operand has 20 states, 20 states have (on average 5.95) internal successors, (119), 20 states have internal predecessors, (119), 0 states have call successors, (0), 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 00:31:11,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:31:11,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 75 [2022-12-13 00:31:11,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:31:18,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:31:21,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:31:26,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:31:28,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:31:30,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:31:32,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:31:34,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:31:36,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:31:38,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2022-12-13 00:31:39,359 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 00:31:39,376 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 00:31:40,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-13 00:31:40,559 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-12-13 00:31:40,572 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 00:31:40,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 00:31:40,573 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-12-13 00:31:40,574 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 00:31:40,574 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 137 [2022-12-13 00:31:40,574 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 00:31:40,574 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:31:40,576 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:31:40,576 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:31:40,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:31:40 BasicIcfg [2022-12-13 00:31:40,578 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:31:40,578 INFO L158 Benchmark]: Toolchain (without parser) took 868339.81ms. Allocated memory was 187.7MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 161.3MB in the beginning and 516.7MB in the end (delta: -355.5MB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2022-12-13 00:31:40,578 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 187.7MB. Free memory is still 163.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:31:40,578 INFO L158 Benchmark]: CACSL2BoogieTranslator took 713.28ms. Allocated memory is still 187.7MB. Free memory was 161.3MB in the beginning and 140.1MB in the end (delta: 21.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-13 00:31:40,579 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.25ms. Allocated memory is still 187.7MB. Free memory was 140.1MB in the beginning and 138.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:31:40,579 INFO L158 Benchmark]: Boogie Preprocessor took 56.88ms. Allocated memory is still 187.7MB. Free memory was 138.2MB in the beginning and 136.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 00:31:40,579 INFO L158 Benchmark]: RCFGBuilder took 641.93ms. Allocated memory is still 187.7MB. Free memory was 136.6MB in the beginning and 123.0MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 00:31:40,579 INFO L158 Benchmark]: TraceAbstraction took 866820.65ms. Allocated memory was 187.7MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 121.4MB in the beginning and 516.7MB in the end (delta: -395.3MB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2022-12-13 00:31:40,580 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 187.7MB. Free memory is still 163.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 713.28ms. Allocated memory is still 187.7MB. Free memory was 161.3MB in the beginning and 140.1MB in the end (delta: 21.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 101.25ms. Allocated memory is still 187.7MB. Free memory was 140.1MB in the beginning and 138.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.88ms. Allocated memory is still 187.7MB. Free memory was 138.2MB in the beginning and 136.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 641.93ms. Allocated memory is still 187.7MB. Free memory was 136.6MB in the beginning and 123.0MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 866820.65ms. Allocated memory was 187.7MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 121.4MB in the beginning and 516.7MB in the end (delta: -395.3MB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 91 PlacesBefore, 32 PlacesAfterwards, 91 TransitionsBefore, 28 TransitionsAfterwards, 1914 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 26 TrivialYvCompositions, 47 ConcurrentYvCompositions, 6 ChoiceCompositions, 79 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1670, independent: 1655, independent conditional: 1655, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1670, independent: 1655, independent conditional: 0, independent unconditional: 1655, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1670, independent: 1655, independent conditional: 0, independent unconditional: 1655, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1670, independent: 1655, independent conditional: 0, independent unconditional: 1655, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1406, independent: 1395, independent conditional: 0, independent unconditional: 1395, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1406, independent: 1395, independent conditional: 0, independent unconditional: 1395, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 55, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1670, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 1406, unknown conditional: 0, unknown unconditional: 1406] , Statistics on independence cache: Total cache size (in pairs): 2636, Positive cache size: 2625, Positive conditional cache size: 0, Positive unconditional cache size: 2625, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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, 32 PlacesBefore, 32 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 400 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.3s, 39 PlacesBefore, 36 PlacesAfterwards, 31 TransitionsBefore, 28 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 0, independent unconditional: 40, 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: 60, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 120, Positive conditional cache size: 120, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 39 PlacesBefore, 36 PlacesAfterwards, 31 TransitionsBefore, 28 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 0, independent unconditional: 40, 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: 60, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 300, Positive cache size: 300, Positive conditional cache size: 300, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 39 PlacesBefore, 36 PlacesAfterwards, 31 TransitionsBefore, 28 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 0, independent unconditional: 60, 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: 60, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 60, unknown conditional: 60, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 420, Positive cache size: 420, Positive conditional cache size: 420, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 39 PlacesBefore, 36 PlacesAfterwards, 31 TransitionsBefore, 28 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 0, independent unconditional: 60, 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: 60, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 60, unknown conditional: 60, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 600, Positive cache size: 600, Positive conditional cache size: 600, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 37 PlacesBefore, 35 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 0, independent unconditional: 40, 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: 40, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 760, Positive cache size: 760, Positive conditional cache size: 760, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 37 PlacesBefore, 35 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 0, independent unconditional: 40, 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: 40, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 940, Positive cache size: 940, Positive conditional cache size: 940, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 37 PlacesBefore, 35 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 0, independent unconditional: 40, 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: 40, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1140, Positive cache size: 1140, Positive conditional cache size: 1140, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 37 PlacesBefore, 35 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 0, independent unconditional: 40, 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: 40, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1220, Positive cache size: 1220, Positive conditional cache size: 1220, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 35 PlacesBefore, 34 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 440 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 0, independent unconditional: 20, 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: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1260, Positive cache size: 1260, Positive conditional cache size: 1260, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 41 PlacesBefore, 40 PlacesAfterwards, 83 TransitionsBefore, 82 TransitionsAfterwards, 1176 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 216, independent: 216, independent conditional: 216, 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: 216, independent: 216, independent conditional: 216, 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: 216, independent: 216, independent conditional: 216, 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: 216, independent: 216, independent conditional: 216, 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: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 0, independent unconditional: 24, 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: 216, independent: 192, independent conditional: 192, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 24, unknown conditional: 24, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1324, Positive cache size: 1324, Positive conditional cache size: 1324, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 904 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): 1324, Positive cache size: 1324, Positive conditional cache size: 1324, 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, 51 PlacesBefore, 51 PlacesAfterwards, 159 TransitionsBefore, 159 TransitionsAfterwards, 1940 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): 1324, Positive cache size: 1324, Positive conditional cache size: 1324, 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, 52 PlacesBefore, 52 PlacesAfterwards, 141 TransitionsBefore, 141 TransitionsAfterwards, 1632 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): 1324, Positive cache size: 1324, Positive conditional cache size: 1324, 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, 66 PlacesBefore, 66 PlacesAfterwards, 225 TransitionsBefore, 225 TransitionsAfterwards, 2488 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): 1324, Positive cache size: 1324, Positive conditional cache size: 1324, 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, 78 PlacesBefore, 78 PlacesAfterwards, 302 TransitionsBefore, 302 TransitionsAfterwards, 3424 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): 1324, Positive cache size: 1324, Positive conditional cache size: 1324, 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, 90 PlacesBefore, 90 PlacesAfterwards, 382 TransitionsBefore, 382 TransitionsAfterwards, 4064 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): 1324, Positive cache size: 1324, Positive conditional cache size: 1324, 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.8s, 104 PlacesBefore, 104 PlacesAfterwards, 447 TransitionsBefore, 447 TransitionsAfterwards, 4656 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, independent: 64, independent conditional: 64, 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: 64, independent: 64, independent conditional: 64, 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: 64, independent: 64, independent conditional: 64, 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: 64, independent: 64, independent conditional: 64, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 64, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1332, Positive cache size: 1332, Positive conditional cache size: 1332, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 113 PlacesBefore, 113 PlacesAfterwards, 558 TransitionsBefore, 558 TransitionsAfterwards, 5568 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): 1332, Positive cache size: 1332, Positive conditional cache size: 1332, 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, 122 PlacesBefore, 122 PlacesAfterwards, 708 TransitionsBefore, 708 TransitionsAfterwards, 7088 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): 1332, Positive cache size: 1332, Positive conditional cache size: 1332, 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.4s, 148 PlacesBefore, 148 PlacesAfterwards, 940 TransitionsBefore, 940 TransitionsAfterwards, 9256 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, independent: 80, independent conditional: 80, 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: 80, independent: 80, independent conditional: 80, 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: 80, independent: 80, independent conditional: 80, 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: 80, independent: 80, independent conditional: 80, 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: 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] , 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: 80, independent: 70, independent conditional: 70, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1342, Positive cache size: 1342, Positive conditional cache size: 1342, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 158 PlacesBefore, 158 PlacesAfterwards, 1028 TransitionsBefore, 1028 TransitionsAfterwards, 9972 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, independent: 64, independent conditional: 64, 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: 64, independent: 64, independent conditional: 64, 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: 64, independent: 64, independent conditional: 64, 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: 64, independent: 64, independent conditional: 64, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 64, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1350, Positive cache size: 1350, Positive conditional cache size: 1350, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 179 PlacesBefore, 179 PlacesAfterwards, 1240 TransitionsBefore, 1240 TransitionsAfterwards, 11828 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, independent: 80, independent conditional: 80, 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: 80, independent: 80, independent conditional: 80, 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: 80, independent: 80, independent conditional: 80, 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: 80, independent: 80, independent conditional: 80, 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: 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] , 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: 80, independent: 70, independent conditional: 70, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1360, Positive cache size: 1360, Positive conditional cache size: 1360, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 193 PlacesBefore, 193 PlacesAfterwards, 1392 TransitionsBefore, 1392 TransitionsAfterwards, 13220 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 224, independent: 224, independent conditional: 224, 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: 224, independent: 224, independent conditional: 224, 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: 224, independent: 224, independent conditional: 224, 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: 224, independent: 224, independent conditional: 224, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 224, independent: 206, independent conditional: 206, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1378, Positive cache size: 1378, Positive conditional cache size: 1378, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 214 PlacesBefore, 214 PlacesAfterwards, 1544 TransitionsBefore, 1544 TransitionsAfterwards, 14436 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): 1378, Positive cache size: 1378, Positive conditional cache size: 1378, 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, 232 PlacesBefore, 232 PlacesAfterwards, 1656 TransitionsBefore, 1656 TransitionsAfterwards, 15264 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): 1378, Positive cache size: 1378, Positive conditional cache size: 1378, 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 - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 720]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 721]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 109 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: 866.7s, OverallIterations: 27, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 827.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 248 mSolverCounterUnknown, 4318 SdHoareTripleChecker+Valid, 634.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4318 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 630.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3817 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12676 IncrementalHoareTripleChecker+Invalid, 16742 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3817 mSolverCounterUnsat, 0 mSDtfsCounter, 12676 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 662 GetRequests, 264 SyntacticMatches, 2 SemanticMatches, 396 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1527 ImplicationChecksByTransitivity, 102.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34324occurred in iteration=26, InterpolantAutomatonStates: 300, 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.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 485 NumberOfCodeBlocks, 485 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 636 ConstructedInterpolants, 119 QuantifiedInterpolants, 11891 SizeOfPredicates, 15 NumberOfNonLiveVariables, 3666 ConjunctsInSsa, 318 ConjunctsInUnsatCore, 76 InterpolantComputations, 3 PerfectInterpolantSequences, 6/163 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown