/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/fib_unsafe-5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:01:20,220 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:01:20,221 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:01:20,261 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:01:20,261 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:01:20,263 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:01:20,265 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:01:20,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:01:20,272 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:01:20,275 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:01:20,276 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:01:20,277 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:01:20,278 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:01:20,279 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:01:20,280 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:01:20,282 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:01:20,283 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:01:20,283 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:01:20,285 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:01:20,289 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:01:20,290 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:01:20,290 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:01:20,291 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:01:20,292 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:01:20,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:01:20,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:01:20,297 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:01:20,299 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:01:20,299 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:01:20,299 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:01:20,300 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:01:20,301 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:01:20,302 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:01:20,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:01:20,303 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:01:20,303 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:01:20,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:01:20,304 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:01:20,304 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:01:20,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:01:20,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:01:20,308 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:01:20,334 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:01:20,335 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:01:20,336 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:01:20,336 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:01:20,336 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:01:20,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:01:20,337 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:01:20,337 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:01:20,338 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:01:20,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:01:20,338 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:01:20,338 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:01:20,338 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:01:20,339 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:01:20,339 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:01:20,339 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:01:20,339 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:01:20,339 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:01:20,339 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:01:20,339 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:01:20,339 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:01:20,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:01:20,339 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:01:20,340 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:01:20,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:01:20,340 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:01:20,340 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:01:20,340 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:01:20,340 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:01:20,340 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 09:01:20,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:01:20,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:01:20,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:01:20,656 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:01:20,657 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:01:20,658 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-5.i [2022-12-13 09:01:21,692 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:01:22,071 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:01:22,072 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-5.i [2022-12-13 09:01:22,105 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18a5edbfd/27cbdc6ea6b048a3b8bcb6d615cd19e8/FLAG8f90ba64a [2022-12-13 09:01:22,279 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18a5edbfd/27cbdc6ea6b048a3b8bcb6d615cd19e8 [2022-12-13 09:01:22,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:01:22,282 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:01:22,284 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:01:22,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:01:22,286 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:01:22,287 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:01:22" (1/1) ... [2022-12-13 09:01:22,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2129e335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:01:22, skipping insertion in model container [2022-12-13 09:01:22,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:01:22" (1/1) ... [2022-12-13 09:01:22,294 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:01:22,330 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:01:22,599 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-5.i[30243,30256] [2022-12-13 09:01:22,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:01:22,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:01:22,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:01:22,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:01:22,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:01:22,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:01:22,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:01:22,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:01:22,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:01:22,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:01:22,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:01:22,628 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:01:22,663 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-5.i[30243,30256] [2022-12-13 09:01:22,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:01:22,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:01:22,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:01:22,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:01:22,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:01:22,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:01:22,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:01:22,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:01:22,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:01:22,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:01:22,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:01:22,699 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:01:22,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:01:22 WrapperNode [2022-12-13 09:01:22,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:01:22,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:01:22,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:01:22,701 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:01:22,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:01:22" (1/1) ... [2022-12-13 09:01:22,729 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:01:22" (1/1) ... [2022-12-13 09:01:22,748 INFO L138 Inliner]: procedures = 165, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2022-12-13 09:01:22,749 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:01:22,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:01:22,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:01:22,751 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:01:22,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:01:22" (1/1) ... [2022-12-13 09:01:22,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:01:22" (1/1) ... [2022-12-13 09:01:22,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:01:22" (1/1) ... [2022-12-13 09:01:22,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:01:22" (1/1) ... [2022-12-13 09:01:22,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:01:22" (1/1) ... [2022-12-13 09:01:22,777 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:01:22" (1/1) ... [2022-12-13 09:01:22,778 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:01:22" (1/1) ... [2022-12-13 09:01:22,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:01:22" (1/1) ... [2022-12-13 09:01:22,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:01:22,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:01:22,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:01:22,781 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:01:22,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:01:22" (1/1) ... [2022-12-13 09:01:22,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:01:22,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:01:22,816 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 09:01:22,834 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 09:01:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-13 09:01:22,845 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-13 09:01:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-13 09:01:22,846 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-13 09:01:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:01:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:01:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:01:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:01:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:01:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:01:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:01:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:01:22,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:01:22,847 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 09:01:23,004 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:01:23,006 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:01:23,231 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:01:23,238 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:01:23,238 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 09:01:23,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:01:23 BoogieIcfgContainer [2022-12-13 09:01:23,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:01:23,243 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:01:23,243 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:01:23,246 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:01:23,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:01:22" (1/3) ... [2022-12-13 09:01:23,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6a0c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:01:23, skipping insertion in model container [2022-12-13 09:01:23,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:01:22" (2/3) ... [2022-12-13 09:01:23,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6a0c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:01:23, skipping insertion in model container [2022-12-13 09:01:23,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:01:23" (3/3) ... [2022-12-13 09:01:23,249 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-5.i [2022-12-13 09:01:23,268 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:01:23,268 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 09:01:23,269 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:01:23,342 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:01:23,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 93 transitions, 196 flow [2022-12-13 09:01:23,435 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-13 09:01:23,435 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:01:23,442 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 09:01:23,442 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 93 transitions, 196 flow [2022-12-13 09:01:23,449 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 91 transitions, 188 flow [2022-12-13 09:01:23,451 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:01:23,472 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-13 09:01:23,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 91 transitions, 188 flow [2022-12-13 09:01:23,524 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-13 09:01:23,524 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:01:23,526 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 09:01:23,530 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-13 09:01:23,531 INFO L226 LiptonReduction]: Number of co-enabled transitions 1914 [2022-12-13 09:01:26,556 INFO L241 LiptonReduction]: Total number of compositions: 79 [2022-12-13 09:01:26,583 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:01:26,589 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;@1e2d9421, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:01:26,589 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 09:01:26,594 INFO L130 PetriNetUnfolder]: 3/26 cut-off events. [2022-12-13 09:01:26,594 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:01:26,594 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:01:26,595 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 09:01:26,595 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 09:01:26,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:01:26,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1807783243, now seen corresponding path program 1 times [2022-12-13 09:01:26,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:01:26,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785064263] [2022-12-13 09:01:26,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:26,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:01:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:26,813 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 09:01:26,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:01:26,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785064263] [2022-12-13 09:01:26,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785064263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:01:26,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:01:26,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:01:26,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848705717] [2022-12-13 09:01:26,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:01:26,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:01:26,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:01:26,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:01:26,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:01:26,839 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 09:01:26,841 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 09:01:26,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:01:26,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 09:01:26,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:01:27,061 INFO L130 PetriNetUnfolder]: 657/1007 cut-off events. [2022-12-13 09:01:27,062 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 09:01:27,066 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 09:01:27,074 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 38 selfloop transitions, 2 changer transitions 1/45 dead transitions. [2022-12-13 09:01:27,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 45 transitions, 178 flow [2022-12-13 09:01:27,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:01:27,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:01:27,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-13 09:01:27,087 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2022-12-13 09:01:27,089 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 62 flow. Second operand 3 states and 55 transitions. [2022-12-13 09:01:27,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 45 transitions, 178 flow [2022-12-13 09:01:27,092 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 09:01:27,095 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 70 flow [2022-12-13 09:01:27,097 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 09:01:27,103 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2022-12-13 09:01:27,103 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:01:27,104 INFO L89 Accepts]: Start accepts. Operand has 33 places, 28 transitions, 70 flow [2022-12-13 09:01:27,108 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:01:27,109 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:01:27,109 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 28 transitions, 70 flow [2022-12-13 09:01:27,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 28 transitions, 70 flow [2022-12-13 09:01:27,121 INFO L130 PetriNetUnfolder]: 3/28 cut-off events. [2022-12-13 09:01:27,122 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:01:27,122 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 09:01:27,125 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 28 transitions, 70 flow [2022-12-13 09:01:27,126 INFO L226 LiptonReduction]: Number of co-enabled transitions 400 [2022-12-13 09:01:27,126 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:01:27,131 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-13 09:01:27,137 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 70 flow [2022-12-13 09:01:27,137 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 09:01:27,137 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:01:27,137 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:01:27,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:01:27,138 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 09:01:27,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:01:27,139 INFO L85 PathProgramCache]: Analyzing trace with hash 206704716, now seen corresponding path program 1 times [2022-12-13 09:01:27,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:01:27,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267886481] [2022-12-13 09:01:27,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:27,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:01:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:27,300 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 09:01:27,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:01:27,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267886481] [2022-12-13 09:01:27,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267886481] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:01:27,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942660] [2022-12-13 09:01:27,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:27,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:01:27,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:01:27,310 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 09:01:27,345 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 09:01:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:27,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 09:01:27,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:01:27,454 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 09:01:27,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:01:27,466 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 09:01:27,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942660] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:01:27,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:01:27,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 09:01:27,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841925264] [2022-12-13 09:01:27,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:01:27,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:01:27,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:01:27,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:01:27,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:01:27,468 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-13 09:01:27,468 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 09:01:27,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:01:27,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-13 09:01:27,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:01:27,615 INFO L130 PetriNetUnfolder]: 913/1391 cut-off events. [2022-12-13 09:01:27,615 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-12-13 09:01:27,617 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 09:01:27,621 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 86 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2022-12-13 09:01:27,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 95 transitions, 392 flow [2022-12-13 09:01:27,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:01:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:01:27,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2022-12-13 09:01:27,622 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7283950617283951 [2022-12-13 09:01:27,622 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 70 flow. Second operand 6 states and 118 transitions. [2022-12-13 09:01:27,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 95 transitions, 392 flow [2022-12-13 09:01:27,623 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 09:01:27,624 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 104 flow [2022-12-13 09:01:27,624 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 09:01:27,625 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2022-12-13 09:01:27,625 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:01:27,625 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 09:01:27,626 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:01:27,626 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:01:27,626 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 09:01:27,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 09:01:27,628 INFO L130 PetriNetUnfolder]: 3/31 cut-off events. [2022-12-13 09:01:27,628 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 09:01:27,629 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 09:01:27,629 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 09:01:27,629 INFO L226 LiptonReduction]: Number of co-enabled transitions 520 [2022-12-13 09:01:27,823 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:01:27,824 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-13 09:01:27,824 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 86 flow [2022-12-13 09:01:27,824 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 09:01:27,824 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:01:27,824 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:01:27,832 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 09:01:28,029 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 09:01:28,030 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 09:01:28,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:01:28,030 INFO L85 PathProgramCache]: Analyzing trace with hash 206706204, now seen corresponding path program 1 times [2022-12-13 09:01:28,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:01:28,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680051554] [2022-12-13 09:01:28,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:28,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:01:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:28,072 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 09:01:28,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:01:28,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680051554] [2022-12-13 09:01:28,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680051554] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:01:28,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812953318] [2022-12-13 09:01:28,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:28,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:01:28,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:01:28,074 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 09:01:28,076 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 09:01:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:28,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 09:01:28,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:01:28,136 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 09:01:28,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:01:28,148 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 09:01:28,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812953318] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:01:28,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:01:28,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 09:01:28,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082353413] [2022-12-13 09:01:28,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:01:28,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:01:28,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:01:28,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:01:28,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:01:28,150 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 09:01:28,150 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 09:01:28,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:01:28,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 09:01:28,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:01:28,309 INFO L130 PetriNetUnfolder]: 913/1391 cut-off events. [2022-12-13 09:01:28,309 INFO L131 PetriNetUnfolder]: For 1456/1456 co-relation queries the response was YES. [2022-12-13 09:01:28,311 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 09:01:28,316 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 86 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2022-12-13 09:01:28,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 95 transitions, 414 flow [2022-12-13 09:01:28,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:01:28,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:01:28,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2022-12-13 09:01:28,320 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7023809523809523 [2022-12-13 09:01:28,321 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 86 flow. Second operand 6 states and 118 transitions. [2022-12-13 09:01:28,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 95 transitions, 414 flow [2022-12-13 09:01:28,331 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 09:01:28,332 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 104 flow [2022-12-13 09:01:28,333 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 09:01:28,334 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2022-12-13 09:01:28,334 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:01:28,334 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 09:01:28,335 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:01:28,335 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:01:28,335 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 09:01:28,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 09:01:28,339 INFO L130 PetriNetUnfolder]: 3/31 cut-off events. [2022-12-13 09:01:28,339 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 09:01:28,340 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 09:01:28,341 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 09:01:28,341 INFO L226 LiptonReduction]: Number of co-enabled transitions 520 [2022-12-13 09:01:28,551 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:01:28,551 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 217 [2022-12-13 09:01:28,552 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 86 flow [2022-12-13 09:01:28,552 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 09:01:28,552 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:01:28,552 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:01:28,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 09:01:28,757 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 09:01:28,757 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 09:01:28,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:01:28,758 INFO L85 PathProgramCache]: Analyzing trace with hash 206706297, now seen corresponding path program 1 times [2022-12-13 09:01:28,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:01:28,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115073259] [2022-12-13 09:01:28,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:28,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:01:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:28,791 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 09:01:28,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:01:28,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115073259] [2022-12-13 09:01:28,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115073259] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:01:28,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626456739] [2022-12-13 09:01:28,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:28,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:01:28,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:01:28,793 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 09:01:28,795 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 09:01:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:28,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 09:01:28,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:01:28,853 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 09:01:28,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:01:28,868 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 09:01:28,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626456739] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:01:28,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:01:28,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 09:01:28,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418804651] [2022-12-13 09:01:28,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:01:28,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:01:28,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:01:28,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:01:28,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:01:28,869 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 09:01:28,870 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 09:01:28,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:01:28,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 09:01:28,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:01:29,033 INFO L130 PetriNetUnfolder]: 785/1199 cut-off events. [2022-12-13 09:01:29,033 INFO L131 PetriNetUnfolder]: For 1264/1264 co-relation queries the response was YES. [2022-12-13 09:01:29,048 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 09:01:29,069 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 70 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2022-12-13 09:01:29,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 78 transitions, 342 flow [2022-12-13 09:01:29,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:01:29,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:01:29,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-13 09:01:29,070 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2022-12-13 09:01:29,071 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 86 flow. Second operand 5 states and 96 transitions. [2022-12-13 09:01:29,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 78 transitions, 342 flow [2022-12-13 09:01:29,074 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 09:01:29,076 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:29,076 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 09:01:29,076 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2022-12-13 09:01:29,077 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:01:29,077 INFO L89 Accepts]: Start accepts. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:29,077 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:01:29,077 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:01:29,078 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:29,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:29,098 INFO L130 PetriNetUnfolder]: 3/30 cut-off events. [2022-12-13 09:01:29,098 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 09:01:29,098 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 09:01:29,099 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:29,099 INFO L226 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-13 09:01:29,234 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:01:29,235 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-13 09:01:29,235 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 82 flow [2022-12-13 09:01:29,235 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 09:01:29,235 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:01:29,236 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:01:29,255 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 09:01:29,436 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 09:01:29,436 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 09:01:29,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:01:29,437 INFO L85 PathProgramCache]: Analyzing trace with hash 206706359, now seen corresponding path program 1 times [2022-12-13 09:01:29,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:01:29,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109820406] [2022-12-13 09:01:29,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:29,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:01:29,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:29,569 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 09:01:29,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:01:29,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109820406] [2022-12-13 09:01:29,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109820406] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:01:29,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053135584] [2022-12-13 09:01:29,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:29,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:01:29,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:01:29,587 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 09:01:29,590 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 09:01:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:29,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 09:01:29,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:01:29,705 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 09:01:29,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:01:29,715 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 09:01:29,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053135584] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:01:29,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:01:29,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 09:01:29,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900553507] [2022-12-13 09:01:29,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:01:29,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:01:29,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:01:29,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:01:29,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:01:29,717 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 09:01:29,717 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 09:01:29,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:01:29,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 09:01:29,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:01:29,848 INFO L130 PetriNetUnfolder]: 785/1199 cut-off events. [2022-12-13 09:01:29,848 INFO L131 PetriNetUnfolder]: For 704/704 co-relation queries the response was YES. [2022-12-13 09:01:29,849 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 09:01:29,853 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 70 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2022-12-13 09:01:29,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 78 transitions, 338 flow [2022-12-13 09:01:29,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:01:29,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:01:29,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-13 09:01:29,854 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2022-12-13 09:01:29,854 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 82 flow. Second operand 5 states and 96 transitions. [2022-12-13 09:01:29,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 78 transitions, 338 flow [2022-12-13 09:01:29,855 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 09:01:29,856 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:29,856 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 09:01:29,857 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2022-12-13 09:01:29,857 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:01:29,857 INFO L89 Accepts]: Start accepts. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:29,857 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:01:29,857 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:01:29,857 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:29,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:29,860 INFO L130 PetriNetUnfolder]: 3/30 cut-off events. [2022-12-13 09:01:29,860 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 09:01:29,860 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 09:01:29,860 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 09:01:29,860 INFO L226 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-13 09:01:29,982 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:01:29,983 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 09:01:29,983 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 82 flow [2022-12-13 09:01:29,983 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 09:01:29,984 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:01:29,984 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:01:30,006 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 09:01:30,188 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 09:01:30,189 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 09:01:30,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:01:30,189 INFO L85 PathProgramCache]: Analyzing trace with hash 206706421, now seen corresponding path program 1 times [2022-12-13 09:01:30,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:01:30,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946483603] [2022-12-13 09:01:30,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:30,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:01:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:30,249 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 09:01:30,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:01:30,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946483603] [2022-12-13 09:01:30,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946483603] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:01:30,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926677331] [2022-12-13 09:01:30,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:30,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:01:30,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:01:30,274 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 09:01:30,294 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 09:01:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:30,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 09:01:30,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:01:30,365 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 09:01:30,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:01:30,376 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 09:01:30,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926677331] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:01:30,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:01:30,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-12-13 09:01:30,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593017089] [2022-12-13 09:01:30,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:01:30,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:01:30,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:01:30,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:01:30,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:01:30,380 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 09:01:30,380 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 09:01:30,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:01:30,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 09:01:30,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:01:30,509 INFO L130 PetriNetUnfolder]: 657/1007 cut-off events. [2022-12-13 09:01:30,510 INFO L131 PetriNetUnfolder]: For 640/640 co-relation queries the response was YES. [2022-12-13 09:01:30,511 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 4122 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 09:01:30,514 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 54 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2022-12-13 09:01:30,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 61 transitions, 266 flow [2022-12-13 09:01:30,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:01:30,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:01:30,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-13 09:01:30,516 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6607142857142857 [2022-12-13 09:01:30,516 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 82 flow. Second operand 4 states and 74 transitions. [2022-12-13 09:01:30,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 61 transitions, 266 flow [2022-12-13 09:01:30,517 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 09:01:30,519 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 84 flow [2022-12-13 09:01:30,520 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 09:01:30,522 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2022-12-13 09:01:30,522 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:01:30,522 INFO L89 Accepts]: Start accepts. Operand has 35 places, 29 transitions, 84 flow [2022-12-13 09:01:30,523 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:01:30,523 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:01:30,523 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 29 transitions, 84 flow [2022-12-13 09:01:30,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 29 transitions, 84 flow [2022-12-13 09:01:30,527 INFO L130 PetriNetUnfolder]: 3/29 cut-off events. [2022-12-13 09:01:30,527 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 09:01:30,527 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 09:01:30,528 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 29 transitions, 84 flow [2022-12-13 09:01:30,528 INFO L226 LiptonReduction]: Number of co-enabled transitions 440 [2022-12-13 09:01:30,607 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:01:30,609 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-13 09:01:30,609 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 78 flow [2022-12-13 09:01:30,609 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 09:01:30,609 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:01:30,609 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:01:30,617 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 09:01:30,815 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 09:01:30,816 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 09:01:30,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:01:30,816 INFO L85 PathProgramCache]: Analyzing trace with hash 206706452, now seen corresponding path program 1 times [2022-12-13 09:01:30,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:01:30,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176323392] [2022-12-13 09:01:30,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:30,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:01:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:30,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 09:01:30,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:01:30,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176323392] [2022-12-13 09:01:30,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176323392] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:01:30,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145861455] [2022-12-13 09:01:30,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:30,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:01:30,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:01:30,977 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 09:01:30,979 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 09:01:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:31,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 09:01:31,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:01:31,084 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 09:01:31,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:01:31,305 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 09:01:31,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145861455] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:01:31,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:01:31,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2022-12-13 09:01:31,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497598776] [2022-12-13 09:01:31,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:01:31,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 09:01:31,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:01:31,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 09:01:31,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 09:01:31,306 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 09:01:31,307 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 09:01:31,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:01:31,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 09:01:31,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:01:32,202 INFO L130 PetriNetUnfolder]: 1705/2520 cut-off events. [2022-12-13 09:01:32,202 INFO L131 PetriNetUnfolder]: For 1146/1146 co-relation queries the response was YES. [2022-12-13 09:01:32,205 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 12007 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 09:01:32,217 INFO L137 encePairwiseOnDemand]: 16/28 looper letters, 80 selfloop transitions, 55 changer transitions 0/139 dead transitions. [2022-12-13 09:01:32,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 139 transitions, 614 flow [2022-12-13 09:01:32,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 09:01:32,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 09:01:32,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions. [2022-12-13 09:01:32,218 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7589285714285714 [2022-12-13 09:01:32,219 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 78 flow. Second operand 8 states and 170 transitions. [2022-12-13 09:01:32,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 139 transitions, 614 flow [2022-12-13 09:01:32,221 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 09:01:32,222 INFO L231 Difference]: Finished difference. Result has 41 places, 83 transitions, 367 flow [2022-12-13 09:01:32,222 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 09:01:32,223 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2022-12-13 09:01:32,223 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:01:32,223 INFO L89 Accepts]: Start accepts. Operand has 41 places, 83 transitions, 367 flow [2022-12-13 09:01:32,223 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:01:32,224 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:01:32,224 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 83 transitions, 367 flow [2022-12-13 09:01:32,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 83 transitions, 367 flow [2022-12-13 09:01:32,249 INFO L130 PetriNetUnfolder]: 329/525 cut-off events. [2022-12-13 09:01:32,250 INFO L131 PetriNetUnfolder]: For 211/219 co-relation queries the response was YES. [2022-12-13 09:01:32,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1236 conditions, 525 events. 329/525 cut-off events. For 211/219 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2166 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 1224. Up to 377 conditions per place. [2022-12-13 09:01:32,254 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 83 transitions, 367 flow [2022-12-13 09:01:32,255 INFO L226 LiptonReduction]: Number of co-enabled transitions 1176 [2022-12-13 09:01:32,283 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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 5) (= 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 09:01:32,337 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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_~j~0_75 (+ v_~i~0_71 v_~j~0_76)) (< v_~q~0_26 5)) 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 09:01:32,390 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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 5) (= 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 09:01:32,434 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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 5) (= 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 09:01:32,491 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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 5)) 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 09:01:32,535 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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 5) (= 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 09:01:32,593 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|) (< v_~q~0_19 5)) 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 09:01:32,715 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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_47 (+ v_~p~0_48 1)) (< v_~p~0_48 5) (= (+ 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 09:01:32,816 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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_47 (+ v_~p~0_48 1)) (< v_~p~0_48 5) (= (+ 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 09:01:32,857 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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 5) (= 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 09:01:32,907 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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_~j~0_75 (+ v_~i~0_71 v_~j~0_76)) (< v_~q~0_26 5)) 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 09:01:32,947 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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 5) (= 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 09:01:32,984 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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 5) (= 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 09:01:33,037 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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 5)) 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 09:01:33,074 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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 5) (= 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 09:01:33,133 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|) (< v_~q~0_19 5)) 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 09:01:33,260 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:01:33,262 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1039 [2022-12-13 09:01:33,262 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 83 transitions, 449 flow [2022-12-13 09:01:33,262 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 09:01:33,263 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:01:33,263 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:01:33,273 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 09:01:33,469 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 09:01:33,469 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 09:01:33,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:01:33,470 INFO L85 PathProgramCache]: Analyzing trace with hash 206706700, now seen corresponding path program 1 times [2022-12-13 09:01:33,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:01:33,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085960991] [2022-12-13 09:01:33,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:33,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:01:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:33,514 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 09:01:33,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:01:33,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085960991] [2022-12-13 09:01:33,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085960991] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:01:33,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:01:33,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:01:33,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637067865] [2022-12-13 09:01:33,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:01:33,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:01:33,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:01:33,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:01:33,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:01:33,517 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 46 [2022-12-13 09:01:33,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 83 transitions, 449 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 09:01:33,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:01:33,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 46 [2022-12-13 09:01:33,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:01:33,701 INFO L130 PetriNetUnfolder]: 1214/1850 cut-off events. [2022-12-13 09:01:33,701 INFO L131 PetriNetUnfolder]: For 1116/1116 co-relation queries the response was YES. [2022-12-13 09:01:33,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5551 conditions, 1850 events. 1214/1850 cut-off events. For 1116/1116 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 9046 event pairs, 368 based on Foata normal form. 0/1030 useless extension candidates. Maximal degree in co-relation 5536. Up to 907 conditions per place. [2022-12-13 09:01:33,713 INFO L137 encePairwiseOnDemand]: 26/46 looper letters, 63 selfloop transitions, 18 changer transitions 2/87 dead transitions. [2022-12-13 09:01:33,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 87 transitions, 603 flow [2022-12-13 09:01:33,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:01:33,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:01:33,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-13 09:01:33,715 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5072463768115942 [2022-12-13 09:01:33,715 INFO L175 Difference]: Start difference. First operand has 41 places, 83 transitions, 449 flow. Second operand 3 states and 70 transitions. [2022-12-13 09:01:33,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 87 transitions, 603 flow [2022-12-13 09:01:33,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 87 transitions, 567 flow, removed 18 selfloop flow, removed 0 redundant places. [2022-12-13 09:01:33,729 INFO L231 Difference]: Finished difference. Result has 42 places, 69 transitions, 375 flow [2022-12-13 09:01:33,729 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=375, PETRI_PLACES=42, PETRI_TRANSITIONS=69} [2022-12-13 09:01:33,732 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2022-12-13 09:01:33,732 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:01:33,732 INFO L89 Accepts]: Start accepts. Operand has 42 places, 69 transitions, 375 flow [2022-12-13 09:01:33,732 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:01:33,732 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:01:33,733 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 69 transitions, 375 flow [2022-12-13 09:01:33,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 69 transitions, 375 flow [2022-12-13 09:01:33,755 INFO L130 PetriNetUnfolder]: 272/441 cut-off events. [2022-12-13 09:01:33,755 INFO L131 PetriNetUnfolder]: For 235/243 co-relation queries the response was YES. [2022-12-13 09:01:33,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 441 events. 272/441 cut-off events. For 235/243 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 1129. Up to 321 conditions per place. [2022-12-13 09:01:33,760 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 69 transitions, 375 flow [2022-12-13 09:01:33,760 INFO L226 LiptonReduction]: Number of co-enabled transitions 904 [2022-12-13 09:01:33,762 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:01:33,762 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-13 09:01:33,762 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 69 transitions, 375 flow [2022-12-13 09:01:33,762 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 09:01:33,763 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:01:33,763 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:01:33,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:01:33,763 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 09:01:33,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:01:33,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1349048136, now seen corresponding path program 1 times [2022-12-13 09:01:33,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:01:33,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228194201] [2022-12-13 09:01:33,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:33,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:01:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:33,960 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 09:01:33,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:01:33,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228194201] [2022-12-13 09:01:33,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228194201] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:01:33,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584528097] [2022-12-13 09:01:33,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:01:33,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:01:33,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:01:33,976 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 09:01:34,064 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 09:01:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:01:34,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 09:01:34,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:01:34,185 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 09:01:34,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:01:34,444 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 09:01:34,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584528097] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:01:34,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:01:34,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-13 09:01:34,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164582572] [2022-12-13 09:01:34,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:01:34,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 09:01:34,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:01:34,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 09:01:34,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 09:01:34,447 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 44 [2022-12-13 09:01:34,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 69 transitions, 375 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 09:01:34,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:01:34,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 44 [2022-12-13 09:01:34,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:01:39,781 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 09:01:42,064 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 09:01:44,070 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 09:01:46,087 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 09:01:48,935 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 09:01:50,444 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 09:01:52,448 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 09:01:54,669 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 09:01:56,674 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 09:01:58,682 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 09:02:00,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 09:02:01,068 INFO L130 PetriNetUnfolder]: 2780/4201 cut-off events. [2022-12-13 09:02:01,068 INFO L131 PetriNetUnfolder]: For 4280/4280 co-relation queries the response was YES. [2022-12-13 09:02:01,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12604 conditions, 4201 events. 2780/4201 cut-off events. For 4280/4280 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 23655 event pairs, 100 based on Foata normal form. 168/2457 useless extension candidates. Maximal degree in co-relation 12587. Up to 2080 conditions per place. [2022-12-13 09:02:01,111 INFO L137 encePairwiseOnDemand]: 16/44 looper letters, 110 selfloop transitions, 131 changer transitions 0/245 dead transitions. [2022-12-13 09:02:01,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 245 transitions, 1498 flow [2022-12-13 09:02:01,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 09:02:01,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 09:02:01,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 276 transitions. [2022-12-13 09:02:01,115 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2022-12-13 09:02:01,115 INFO L175 Difference]: Start difference. First operand has 40 places, 69 transitions, 375 flow. Second operand 12 states and 276 transitions. [2022-12-13 09:02:01,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 245 transitions, 1498 flow [2022-12-13 09:02:01,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 245 transitions, 1426 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-13 09:02:01,166 INFO L231 Difference]: Finished difference. Result has 51 places, 159 transitions, 1121 flow [2022-12-13 09:02:01,167 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 09:02:01,167 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 19 predicate places. [2022-12-13 09:02:01,167 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:02:01,167 INFO L89 Accepts]: Start accepts. Operand has 51 places, 159 transitions, 1121 flow [2022-12-13 09:02:01,169 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:02:01,169 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:02:01,170 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 159 transitions, 1121 flow [2022-12-13 09:02:01,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 159 transitions, 1121 flow [2022-12-13 09:02:01,232 INFO L130 PetriNetUnfolder]: 604/1017 cut-off events. [2022-12-13 09:02:01,232 INFO L131 PetriNetUnfolder]: For 728/792 co-relation queries the response was YES. [2022-12-13 09:02:01,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3357 conditions, 1017 events. 604/1017 cut-off events. For 728/792 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 5504 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 09:02:01,242 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 159 transitions, 1121 flow [2022-12-13 09:02:01,242 INFO L226 LiptonReduction]: Number of co-enabled transitions 1940 [2022-12-13 09:02:01,247 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:02:01,248 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-13 09:02:01,248 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 159 transitions, 1121 flow [2022-12-13 09:02:01,248 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 09:02:01,248 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:02:01,248 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:02:01,269 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 09:02:01,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:02:01,454 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 09:02:01,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:02:01,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1348897011, now seen corresponding path program 1 times [2022-12-13 09:02:01,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:02:01,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205023904] [2022-12-13 09:02:01,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:02:01,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:02:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:02:01,511 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 09:02:01,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:02:01,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205023904] [2022-12-13 09:02:01,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205023904] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:02:01,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910222996] [2022-12-13 09:02:01,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:02:01,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:02:01,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:02:01,512 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 09:02:01,519 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 09:02:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:02:01,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 09:02:01,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:02:01,577 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 09:02:01,577 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 09:02:01,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910222996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:02:01,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 09:02:01,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-13 09:02:01,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703288242] [2022-12-13 09:02:01,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:02:01,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:02:01,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:02:01,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:02:01,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:02:01,578 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 44 [2022-12-13 09:02:01,579 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 09:02:01,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:02:01,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 44 [2022-12-13 09:02:01,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:02:01,778 INFO L130 PetriNetUnfolder]: 1996/3189 cut-off events. [2022-12-13 09:02:01,779 INFO L131 PetriNetUnfolder]: For 3541/3541 co-relation queries the response was YES. [2022-12-13 09:02:01,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10876 conditions, 3189 events. 1996/3189 cut-off events. For 3541/3541 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 18999 event pairs, 711 based on Foata normal form. 350/1907 useless extension candidates. Maximal degree in co-relation 10857. Up to 1634 conditions per place. [2022-12-13 09:02:01,788 INFO L137 encePairwiseOnDemand]: 25/44 looper letters, 133 selfloop transitions, 28 changer transitions 0/165 dead transitions. [2022-12-13 09:02:01,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 165 transitions, 1428 flow [2022-12-13 09:02:01,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:02:01,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:02:01,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-13 09:02:01,790 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2022-12-13 09:02:01,790 INFO L175 Difference]: Start difference. First operand has 51 places, 159 transitions, 1121 flow. Second operand 4 states and 72 transitions. [2022-12-13 09:02:01,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 165 transitions, 1428 flow [2022-12-13 09:02:01,807 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 09:02:01,810 INFO L231 Difference]: Finished difference. Result has 52 places, 141 transitions, 949 flow [2022-12-13 09:02:01,811 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 09:02:01,811 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2022-12-13 09:02:01,811 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:02:01,811 INFO L89 Accepts]: Start accepts. Operand has 52 places, 141 transitions, 949 flow [2022-12-13 09:02:01,813 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:02:01,813 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:02:01,813 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 141 transitions, 949 flow [2022-12-13 09:02:01,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 141 transitions, 949 flow [2022-12-13 09:02:01,841 INFO L130 PetriNetUnfolder]: 424/781 cut-off events. [2022-12-13 09:02:01,841 INFO L131 PetriNetUnfolder]: For 825/869 co-relation queries the response was YES. [2022-12-13 09:02:01,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2298 conditions, 781 events. 424/781 cut-off events. For 825/869 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 4572 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 09:02:01,845 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 141 transitions, 949 flow [2022-12-13 09:02:01,845 INFO L226 LiptonReduction]: Number of co-enabled transitions 1632 [2022-12-13 09:02:01,847 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:02:01,847 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-13 09:02:01,847 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 141 transitions, 949 flow [2022-12-13 09:02:01,848 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 09:02:01,848 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:02:01,848 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:02:01,858 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 09:02:02,057 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,SelfDestructingSolverStorable9 [2022-12-13 09:02:02,058 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 09:02:02,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:02:02,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1025623524, now seen corresponding path program 1 times [2022-12-13 09:02:02,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:02:02,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528086272] [2022-12-13 09:02:02,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:02:02,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:02:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:02:02,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:02:02,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:02:02,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528086272] [2022-12-13 09:02:02,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528086272] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:02:02,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162278488] [2022-12-13 09:02:02,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:02:02,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:02:02,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:02:02,248 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 09:02:02,311 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 09:02:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:02:02,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 09:02:02,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:02:02,432 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 09:02:02,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:02:02,651 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 09:02:02,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162278488] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:02:02,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:02:02,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-13 09:02:02,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078663816] [2022-12-13 09:02:02,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:02:02,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 09:02:02,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:02:02,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 09:02:02,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 09:02:02,653 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2022-12-13 09:02:02,654 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 09:02:02,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:02:02,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2022-12-13 09:02:02,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:02:07,140 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 09:02:09,148 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 09:02:09,815 INFO L130 PetriNetUnfolder]: 3207/5195 cut-off events. [2022-12-13 09:02:09,815 INFO L131 PetriNetUnfolder]: For 7682/7682 co-relation queries the response was YES. [2022-12-13 09:02:09,823 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 632. Compared 34512 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 09:02:09,838 INFO L137 encePairwiseOnDemand]: 16/43 looper letters, 137 selfloop transitions, 157 changer transitions 0/298 dead transitions. [2022-12-13 09:02:09,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 298 transitions, 2101 flow [2022-12-13 09:02:09,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 09:02:09,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 09:02:09,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 242 transitions. [2022-12-13 09:02:09,841 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5116279069767442 [2022-12-13 09:02:09,841 INFO L175 Difference]: Start difference. First operand has 52 places, 141 transitions, 949 flow. Second operand 11 states and 242 transitions. [2022-12-13 09:02:09,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 298 transitions, 2101 flow [2022-12-13 09:02:09,908 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 09:02:09,915 INFO L231 Difference]: Finished difference. Result has 66 places, 225 transitions, 1894 flow [2022-12-13 09:02:09,916 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 09:02:09,916 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 34 predicate places. [2022-12-13 09:02:09,916 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:02:09,916 INFO L89 Accepts]: Start accepts. Operand has 66 places, 225 transitions, 1894 flow [2022-12-13 09:02:09,917 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:02:09,917 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:02:09,917 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 225 transitions, 1894 flow [2022-12-13 09:02:09,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 225 transitions, 1894 flow [2022-12-13 09:02:09,988 INFO L130 PetriNetUnfolder]: 640/1265 cut-off events. [2022-12-13 09:02:09,988 INFO L131 PetriNetUnfolder]: For 2520/2600 co-relation queries the response was YES. [2022-12-13 09:02:09,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5000 conditions, 1265 events. 640/1265 cut-off events. For 2520/2600 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 8891 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 09:02:10,002 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 225 transitions, 1894 flow [2022-12-13 09:02:10,002 INFO L226 LiptonReduction]: Number of co-enabled transitions 2488 [2022-12-13 09:02:10,004 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:02:10,009 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 09:02:10,009 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 225 transitions, 1894 flow [2022-12-13 09:02:10,009 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 09:02:10,009 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:02:10,009 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:02:10,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 09:02:10,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:02:10,215 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 09:02:10,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:02:10,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1134578875, now seen corresponding path program 1 times [2022-12-13 09:02:10,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:02:10,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995483306] [2022-12-13 09:02:10,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:02:10,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:02:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:02:10,380 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 09:02:10,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:02:10,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995483306] [2022-12-13 09:02:10,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995483306] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:02:10,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514088374] [2022-12-13 09:02:10,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:02:10,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:02:10,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:02:10,383 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 09:02:10,384 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 09:02:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:02:10,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 09:02:10,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:02:10,566 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 09:02:10,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:02:10,891 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 09:02:10,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514088374] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:02:10,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:02:10,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-13 09:02:10,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153655732] [2022-12-13 09:02:10,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:02:10,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 09:02:10,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:02:10,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 09:02:10,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-12-13 09:02:10,893 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2022-12-13 09:02:10,893 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 09:02:10,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:02:10,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2022-12-13 09:02:10,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:02:13,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:02:14,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:02:17,918 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 09:02:19,408 INFO L130 PetriNetUnfolder]: 4901/7975 cut-off events. [2022-12-13 09:02:19,409 INFO L131 PetriNetUnfolder]: For 25012/25012 co-relation queries the response was YES. [2022-12-13 09:02:19,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31143 conditions, 7975 events. 4901/7975 cut-off events. For 25012/25012 co-relation queries the response was YES. Maximal size of possible extension queue 964. Compared 57190 event pairs, 205 based on Foata normal form. 154/4042 useless extension candidates. Maximal degree in co-relation 31117. Up to 3237 conditions per place. [2022-12-13 09:02:19,453 INFO L137 encePairwiseOnDemand]: 16/43 looper letters, 142 selfloop transitions, 251 changer transitions 0/397 dead transitions. [2022-12-13 09:02:19,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 397 transitions, 3424 flow [2022-12-13 09:02:19,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 09:02:19,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 09:02:19,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 277 transitions. [2022-12-13 09:02:19,455 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5368217054263565 [2022-12-13 09:02:19,455 INFO L175 Difference]: Start difference. First operand has 66 places, 225 transitions, 1894 flow. Second operand 12 states and 277 transitions. [2022-12-13 09:02:19,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 397 transitions, 3424 flow [2022-12-13 09:02:19,724 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 09:02:19,732 INFO L231 Difference]: Finished difference. Result has 78 places, 302 transitions, 3010 flow [2022-12-13 09:02:19,732 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 09:02:19,733 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 46 predicate places. [2022-12-13 09:02:19,733 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:02:19,733 INFO L89 Accepts]: Start accepts. Operand has 78 places, 302 transitions, 3010 flow [2022-12-13 09:02:19,735 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:02:19,735 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:02:19,735 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 302 transitions, 3010 flow [2022-12-13 09:02:19,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 302 transitions, 3010 flow [2022-12-13 09:02:19,866 INFO L130 PetriNetUnfolder]: 968/1965 cut-off events. [2022-12-13 09:02:19,866 INFO L131 PetriNetUnfolder]: For 7669/7749 co-relation queries the response was YES. [2022-12-13 09:02:19,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9477 conditions, 1965 events. 968/1965 cut-off events. For 7669/7749 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 15377 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 09:02:19,887 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 302 transitions, 3010 flow [2022-12-13 09:02:19,887 INFO L226 LiptonReduction]: Number of co-enabled transitions 3424 [2022-12-13 09:02:19,889 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:02:19,890 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 157 [2022-12-13 09:02:19,890 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 302 transitions, 3010 flow [2022-12-13 09:02:19,890 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 09:02:19,890 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:02:19,890 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:02:19,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 09:02:20,095 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,SelfDestructingSolverStorable11 [2022-12-13 09:02:20,096 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 09:02:20,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:02:20,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1931226434, now seen corresponding path program 1 times [2022-12-13 09:02:20,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:02:20,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778217381] [2022-12-13 09:02:20,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:02:20,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:02:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:02:20,296 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 09:02:20,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:02:20,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778217381] [2022-12-13 09:02:20,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778217381] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:02:20,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15370972] [2022-12-13 09:02:20,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:02:20,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:02:20,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:02:20,311 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 09:02:20,318 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 09:02:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:02:20,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 09:02:20,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:02:20,508 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 09:02:20,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:02:20,814 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 09:02:20,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15370972] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:02:20,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:02:20,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-13 09:02:20,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891397303] [2022-12-13 09:02:20,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:02:20,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 09:02:20,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:02:20,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 09:02:20,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-13 09:02:20,818 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2022-12-13 09:02:20,819 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 09:02:20,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:02:20,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2022-12-13 09:02:20,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:02:26,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 09:02:28,134 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 09:02:29,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:02:31,888 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 09:02:39,636 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 09:02:41,642 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 09:02:42,467 INFO L130 PetriNetUnfolder]: 5111/8490 cut-off events. [2022-12-13 09:02:42,467 INFO L131 PetriNetUnfolder]: For 48240/48240 co-relation queries the response was YES. [2022-12-13 09:02:42,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37422 conditions, 8490 events. 5111/8490 cut-off events. For 48240/48240 co-relation queries the response was YES. Maximal size of possible extension queue 1049. Compared 63457 event pairs, 302 based on Foata normal form. 301/4304 useless extension candidates. Maximal degree in co-relation 37391. Up to 4787 conditions per place. [2022-12-13 09:02:42,496 INFO L137 encePairwiseOnDemand]: 16/43 looper letters, 210 selfloop transitions, 278 changer transitions 0/492 dead transitions. [2022-12-13 09:02:42,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 492 transitions, 4882 flow [2022-12-13 09:02:42,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 09:02:42,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 09:02:42,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 339 transitions. [2022-12-13 09:02:42,497 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49273255813953487 [2022-12-13 09:02:42,497 INFO L175 Difference]: Start difference. First operand has 78 places, 302 transitions, 3010 flow. Second operand 16 states and 339 transitions. [2022-12-13 09:02:42,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 492 transitions, 4882 flow [2022-12-13 09:02:42,826 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 09:02:42,830 INFO L231 Difference]: Finished difference. Result has 90 places, 382 transitions, 4157 flow [2022-12-13 09:02:42,830 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 09:02:42,830 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 58 predicate places. [2022-12-13 09:02:42,830 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:02:42,831 INFO L89 Accepts]: Start accepts. Operand has 90 places, 382 transitions, 4157 flow [2022-12-13 09:02:42,831 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:02:42,831 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:02:42,831 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 382 transitions, 4157 flow [2022-12-13 09:02:42,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 382 transitions, 4157 flow [2022-12-13 09:02:42,954 INFO L130 PetriNetUnfolder]: 1096/2261 cut-off events. [2022-12-13 09:02:42,955 INFO L131 PetriNetUnfolder]: For 6763/6843 co-relation queries the response was YES. [2022-12-13 09:02:42,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11154 conditions, 2261 events. 1096/2261 cut-off events. For 6763/6843 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 18456 event pairs, 0 based on Foata normal form. 0/741 useless extension candidates. Maximal degree in co-relation 11125. Up to 1301 conditions per place. [2022-12-13 09:02:42,967 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 382 transitions, 4157 flow [2022-12-13 09:02:42,967 INFO L226 LiptonReduction]: Number of co-enabled transitions 4064 [2022-12-13 09:02:42,968 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:02:42,968 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 09:02:42,968 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 382 transitions, 4157 flow [2022-12-13 09:02:42,968 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 09:02:42,968 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:02:42,968 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:02:42,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 09:02:43,172 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 09:02:43,172 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 09:02:43,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:02:43,173 INFO L85 PathProgramCache]: Analyzing trace with hash -811218268, now seen corresponding path program 1 times [2022-12-13 09:02:43,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:02:43,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146305753] [2022-12-13 09:02:43,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:02:43,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:02:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:02:43,286 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 09:02:43,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:02:43,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146305753] [2022-12-13 09:02:43,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146305753] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:02:43,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877070513] [2022-12-13 09:02:43,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:02:43,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:02:43,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:02:43,288 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 09:02:43,289 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 09:02:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:02:43,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 09:02:43,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:02:43,452 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 09:02:43,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:02:43,683 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 09:02:43,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877070513] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:02:43,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:02:43,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 09:02:43,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832922364] [2022-12-13 09:02:43,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:02:43,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 09:02:43,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:02:43,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 09:02:43,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-13 09:02:43,685 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2022-12-13 09:02:43,685 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 09:02:43,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:02:43,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2022-12-13 09:02:43,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:02:49,560 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 09:02:51,595 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 09:02:53,600 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 09:02:55,607 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 09:02:57,610 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 09:02:59,717 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 09:03:02,320 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 09:03:03,819 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 09:03:06,102 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 09:03:08,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:03:09,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:03:10,571 INFO L130 PetriNetUnfolder]: 5678/9614 cut-off events. [2022-12-13 09:03:10,571 INFO L131 PetriNetUnfolder]: For 61615/61615 co-relation queries the response was YES. [2022-12-13 09:03:10,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44156 conditions, 9614 events. 5678/9614 cut-off events. For 61615/61615 co-relation queries the response was YES. Maximal size of possible extension queue 1099. Compared 73799 event pairs, 287 based on Foata normal form. 301/4723 useless extension candidates. Maximal degree in co-relation 44124. Up to 5719 conditions per place. [2022-12-13 09:03:10,602 INFO L137 encePairwiseOnDemand]: 16/43 looper letters, 295 selfloop transitions, 271 changer transitions 0/570 dead transitions. [2022-12-13 09:03:10,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 570 transitions, 6181 flow [2022-12-13 09:03:10,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:03:10,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 09:03:10,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 377 transitions. [2022-12-13 09:03:10,607 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4870801033591731 [2022-12-13 09:03:10,607 INFO L175 Difference]: Start difference. First operand has 90 places, 382 transitions, 4157 flow. Second operand 18 states and 377 transitions. [2022-12-13 09:03:10,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 570 transitions, 6181 flow [2022-12-13 09:03:11,032 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 09:03:11,037 INFO L231 Difference]: Finished difference. Result has 104 places, 447 transitions, 5278 flow [2022-12-13 09:03:11,038 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 09:03:11,038 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 72 predicate places. [2022-12-13 09:03:11,038 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:03:11,038 INFO L89 Accepts]: Start accepts. Operand has 104 places, 447 transitions, 5278 flow [2022-12-13 09:03:11,039 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:03:11,039 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:03:11,040 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 447 transitions, 5278 flow [2022-12-13 09:03:11,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 447 transitions, 5278 flow [2022-12-13 09:03:11,206 INFO L130 PetriNetUnfolder]: 1320/2777 cut-off events. [2022-12-13 09:03:11,207 INFO L131 PetriNetUnfolder]: For 14613/14684 co-relation queries the response was YES. [2022-12-13 09:03:11,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15300 conditions, 2777 events. 1320/2777 cut-off events. For 14613/14684 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 23004 event pairs, 0 based on Foata normal form. 0/882 useless extension candidates. Maximal degree in co-relation 15265. Up to 1637 conditions per place. [2022-12-13 09:03:11,224 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 447 transitions, 5278 flow [2022-12-13 09:03:11,224 INFO L226 LiptonReduction]: Number of co-enabled transitions 4656 [2022-12-13 09:03:11,225 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|) (= |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)) (not (< v_~x~0_35 12)) (= |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 5) (= 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 09:03:11,298 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|) (= |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)) (not (< v_~x~0_35 12)) (= |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 5) (= 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 09:03:11,391 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|) (= |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)) (not (< v_~x~0_35 12)) (= |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 5) (= 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 09:03:11,466 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|) (= |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)) (not (< v_~x~0_35 12)) (= |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 5)) 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 09:03:11,525 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|) (= |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)) (not (< v_~x~0_35 12)) (= |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_~j~0_75 (+ v_~i~0_71 v_~j~0_76)) (< v_~q~0_26 5)) 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 09:03:11,596 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|) (= |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)) (not (< v_~x~0_35 12)) (= |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_47 (+ v_~p~0_48 1)) (< v_~p~0_48 5) (= (+ 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 09:03:11,664 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|) (= |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)) (not (< v_~x~0_35 12)) (= |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_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|) (< v_~q~0_19 5)) 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 09:03:11,736 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|) (= |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)) (not (< v_~x~0_35 12)) (= |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 5) (= 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 09:03:11,799 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:03:11,800 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 762 [2022-12-13 09:03:11,800 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 447 transitions, 5526 flow [2022-12-13 09:03:11,800 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 09:03:11,800 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:03:11,800 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:03:11,805 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 09:03:12,003 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 09:03:12,003 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 09:03:12,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:03:12,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1930063252, now seen corresponding path program 1 times [2022-12-13 09:03:12,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:03:12,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603923593] [2022-12-13 09:03:12,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:03:12,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:03:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:03:12,148 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 09:03:12,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:03:12,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603923593] [2022-12-13 09:03:12,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603923593] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:03:12,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050750317] [2022-12-13 09:03:12,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:03:12,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:03:12,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:03:12,150 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 09:03:12,152 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 09:03:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:03:12,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 09:03:12,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:03:12,295 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 09:03:12,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:03:12,500 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 09:03:12,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050750317] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:03:12,501 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:03:12,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-13 09:03:12,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763577770] [2022-12-13 09:03:12,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:03:12,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 09:03:12,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:03:12,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 09:03:12,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-13 09:03:12,502 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 51 [2022-12-13 09:03:12,502 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 09:03:12,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:03:12,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 51 [2022-12-13 09:03:12,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:03:16,078 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 09:03:18,088 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 09:03:20,102 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 09:03:22,481 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 09:03:26,749 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 09:03:28,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 09:03:33,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 09:03:35,043 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 09:03:37,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 09:03:39,064 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 09:03:42,217 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 09:03:45,100 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 09:03:46,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:03:48,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 09:03:50,355 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 09:03:52,365 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 09:03:53,163 INFO L130 PetriNetUnfolder]: 6091/10540 cut-off events. [2022-12-13 09:03:53,163 INFO L131 PetriNetUnfolder]: For 71582/71582 co-relation queries the response was YES. [2022-12-13 09:03:53,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51897 conditions, 10540 events. 6091/10540 cut-off events. For 71582/71582 co-relation queries the response was YES. Maximal size of possible extension queue 1301. Compared 85585 event pairs, 392 based on Foata normal form. 210/4888 useless extension candidates. Maximal degree in co-relation 51859. Up to 6242 conditions per place. [2022-12-13 09:03:53,198 INFO L137 encePairwiseOnDemand]: 16/51 looper letters, 318 selfloop transitions, 344 changer transitions 9/675 dead transitions. [2022-12-13 09:03:53,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 675 transitions, 8329 flow [2022-12-13 09:03:53,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 09:03:53,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 09:03:53,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 354 transitions. [2022-12-13 09:03:53,201 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4083044982698962 [2022-12-13 09:03:53,202 INFO L175 Difference]: Start difference. First operand has 104 places, 447 transitions, 5526 flow. Second operand 17 states and 354 transitions. [2022-12-13 09:03:53,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 675 transitions, 8329 flow [2022-12-13 09:03:53,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 675 transitions, 7729 flow, removed 153 selfloop flow, removed 10 redundant places. [2022-12-13 09:03:53,838 INFO L231 Difference]: Finished difference. Result has 114 places, 560 transitions, 7252 flow [2022-12-13 09:03:53,838 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=17, PETRI_FLOW=7252, PETRI_PLACES=114, PETRI_TRANSITIONS=560} [2022-12-13 09:03:53,839 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 82 predicate places. [2022-12-13 09:03:53,839 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:03:53,839 INFO L89 Accepts]: Start accepts. Operand has 114 places, 560 transitions, 7252 flow [2022-12-13 09:03:53,856 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:03:53,856 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:03:53,856 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 560 transitions, 7252 flow [2022-12-13 09:03:53,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 560 transitions, 7252 flow [2022-12-13 09:03:54,041 INFO L130 PetriNetUnfolder]: 1474/3189 cut-off events. [2022-12-13 09:03:54,041 INFO L131 PetriNetUnfolder]: For 14259/14339 co-relation queries the response was YES. [2022-12-13 09:03:54,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18471 conditions, 3189 events. 1474/3189 cut-off events. For 14259/14339 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 28148 event pairs, 0 based on Foata normal form. 0/964 useless extension candidates. Maximal degree in co-relation 18431. Up to 1603 conditions per place. [2022-12-13 09:03:54,084 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 560 transitions, 7252 flow [2022-12-13 09:03:54,084 INFO L226 LiptonReduction]: Number of co-enabled transitions 5568 [2022-12-13 09:03:54,093 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [279] L687-5-->L687-3: Formula: (and (= v_~i~0_33 (+ v_~i~0_34 v_~j~0_39)) (< v_~p~0_23 5) (= 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] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_25 (+ v_~q~0_26 1)) (= v_~j~0_75 (+ v_~i~0_71 v_~j~0_76)) (< v_~q~0_26 5)) 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 09:03:54,122 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [278] L687-5-->L690: Formula: (and (= v_~i~0_29 (+ v_~i~0_30 v_~j~0_37)) (< v_~p~0_21 5)) 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] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_25 (+ v_~q~0_26 1)) (= v_~j~0_75 (+ v_~i~0_71 v_~j~0_76)) (< v_~q~0_26 5)) 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 09:03:54,155 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:03:54,164 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 325 [2022-12-13 09:03:54,164 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 559 transitions, 7254 flow [2022-12-13 09:03:54,164 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 09:03:54,164 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:03:54,164 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:03:54,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 09:03:54,368 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 09:03:54,368 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 09:03:54,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:03:54,369 INFO L85 PathProgramCache]: Analyzing trace with hash 2075009744, now seen corresponding path program 1 times [2022-12-13 09:03:54,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:03:54,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514855089] [2022-12-13 09:03:54,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:03:54,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:03:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:03:54,550 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 09:03:54,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:03:54,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514855089] [2022-12-13 09:03:54,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514855089] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:03:54,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062810044] [2022-12-13 09:03:54,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:03:54,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:03:54,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:03:54,556 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 09:03:54,558 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 09:03:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:03:54,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 09:03:54,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:03:54,711 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 09:03:54,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:03:55,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:03:55,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062810044] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:03:55,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:03:55,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 09:03:55,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090429288] [2022-12-13 09:03:55,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:03:55,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 09:03:55,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:03:55,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 09:03:55,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-12-13 09:03:55,047 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 45 [2022-12-13 09:03:55,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 559 transitions, 7254 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 09:03:55,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:03:55,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 45 [2022-12-13 09:03:55,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:03:59,752 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 09:04:02,228 INFO L130 PetriNetUnfolder]: 8486/14640 cut-off events. [2022-12-13 09:04:02,229 INFO L131 PetriNetUnfolder]: For 118748/118748 co-relation queries the response was YES. [2022-12-13 09:04:02,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78369 conditions, 14640 events. 8486/14640 cut-off events. For 118748/118748 co-relation queries the response was YES. Maximal size of possible extension queue 1793. Compared 125048 event pairs, 503 based on Foata normal form. 147/6789 useless extension candidates. Maximal degree in co-relation 78326. Up to 6387 conditions per place. [2022-12-13 09:04:02,290 INFO L137 encePairwiseOnDemand]: 16/45 looper letters, 371 selfloop transitions, 451 changer transitions 0/826 dead transitions. [2022-12-13 09:04:02,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 826 transitions, 11266 flow [2022-12-13 09:04:02,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:04:02,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 09:04:02,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 333 transitions. [2022-12-13 09:04:02,292 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2022-12-13 09:04:02,292 INFO L175 Difference]: Start difference. First operand has 113 places, 559 transitions, 7254 flow. Second operand 15 states and 333 transitions. [2022-12-13 09:04:02,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 826 transitions, 11266 flow [2022-12-13 09:04:03,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 826 transitions, 10941 flow, removed 68 selfloop flow, removed 8 redundant places. [2022-12-13 09:04:03,323 INFO L231 Difference]: Finished difference. Result has 123 places, 713 transitions, 10368 flow [2022-12-13 09:04:03,323 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=6977, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=331, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=10368, PETRI_PLACES=123, PETRI_TRANSITIONS=713} [2022-12-13 09:04:03,324 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 91 predicate places. [2022-12-13 09:04:03,324 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:04:03,324 INFO L89 Accepts]: Start accepts. Operand has 123 places, 713 transitions, 10368 flow [2022-12-13 09:04:03,328 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:04:03,328 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:04:03,328 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 713 transitions, 10368 flow [2022-12-13 09:04:03,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 713 transitions, 10368 flow [2022-12-13 09:04:03,652 INFO L130 PetriNetUnfolder]: 2056/4465 cut-off events. [2022-12-13 09:04:03,652 INFO L131 PetriNetUnfolder]: For 29678/29749 co-relation queries the response was YES. [2022-12-13 09:04:03,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29356 conditions, 4465 events. 2056/4465 cut-off events. For 29678/29749 co-relation queries the response was YES. Maximal size of possible extension queue 817. Compared 42190 event pairs, 0 based on Foata normal form. 0/1401 useless extension candidates. Maximal degree in co-relation 29311. Up to 2447 conditions per place. [2022-12-13 09:04:03,704 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 713 transitions, 10368 flow [2022-12-13 09:04:03,704 INFO L226 LiptonReduction]: Number of co-enabled transitions 7072 [2022-12-13 09:04:03,707 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:04:03,708 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 384 [2022-12-13 09:04:03,708 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 713 transitions, 10368 flow [2022-12-13 09:04:03,708 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 09:04:03,708 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:04:03,708 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:04:03,729 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 09:04:03,927 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 09:04:03,927 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 09:04:03,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:04:03,928 INFO L85 PathProgramCache]: Analyzing trace with hash -262197723, now seen corresponding path program 1 times [2022-12-13 09:04:03,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:04:03,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712632146] [2022-12-13 09:04:03,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:04:03,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:04:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:04:04,061 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 09:04:04,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:04:04,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712632146] [2022-12-13 09:04:04,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712632146] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:04:04,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992047078] [2022-12-13 09:04:04,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:04:04,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:04:04,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:04:04,068 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 09:04:04,070 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 09:04:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:04:04,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 09:04:04,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:04:04,275 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 09:04:04,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:04:04,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 09:04:04,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992047078] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:04:04,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:04:04,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 09:04:04,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467247695] [2022-12-13 09:04:04,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:04:04,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 09:04:04,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:04:04,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 09:04:04,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-13 09:04:04,583 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 45 [2022-12-13 09:04:04,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 713 transitions, 10368 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 09:04:04,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:04:04,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 45 [2022-12-13 09:04:04,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:04:10,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:04:15,165 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 09:04:17,172 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 09:04:18,803 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 09:04:20,846 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 09:04:22,199 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 09:04:25,338 INFO L130 PetriNetUnfolder]: 11601/20121 cut-off events. [2022-12-13 09:04:25,338 INFO L131 PetriNetUnfolder]: For 268066/268066 co-relation queries the response was YES. [2022-12-13 09:04:25,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120582 conditions, 20121 events. 11601/20121 cut-off events. For 268066/268066 co-relation queries the response was YES. Maximal size of possible extension queue 2449. Compared 179021 event pairs, 475 based on Foata normal form. 301/9374 useless extension candidates. Maximal degree in co-relation 120534. Up to 8571 conditions per place. [2022-12-13 09:04:25,427 INFO L137 encePairwiseOnDemand]: 16/45 looper letters, 343 selfloop transitions, 769 changer transitions 0/1116 dead transitions. [2022-12-13 09:04:25,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 1116 transitions, 16553 flow [2022-12-13 09:04:25,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 09:04:25,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 09:04:25,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 503 transitions. [2022-12-13 09:04:25,429 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46574074074074073 [2022-12-13 09:04:25,429 INFO L175 Difference]: Start difference. First operand has 123 places, 713 transitions, 10368 flow. Second operand 24 states and 503 transitions. [2022-12-13 09:04:25,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 1116 transitions, 16553 flow [2022-12-13 09:04:27,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 1116 transitions, 15952 flow, removed 224 selfloop flow, removed 6 redundant places. [2022-12-13 09:04:27,650 INFO L231 Difference]: Finished difference. Result has 149 places, 945 transitions, 15942 flow [2022-12-13 09:04:27,650 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=9891, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=713, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=571, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=15942, PETRI_PLACES=149, PETRI_TRANSITIONS=945} [2022-12-13 09:04:27,650 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 117 predicate places. [2022-12-13 09:04:27,650 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:04:27,650 INFO L89 Accepts]: Start accepts. Operand has 149 places, 945 transitions, 15942 flow [2022-12-13 09:04:27,652 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:04:27,652 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:04:27,652 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 945 transitions, 15942 flow [2022-12-13 09:04:27,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 945 transitions, 15942 flow [2022-12-13 09:04:28,176 INFO L130 PetriNetUnfolder]: 2712/6137 cut-off events. [2022-12-13 09:04:28,176 INFO L131 PetriNetUnfolder]: For 65043/65141 co-relation queries the response was YES. [2022-12-13 09:04:28,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46123 conditions, 6137 events. 2712/6137 cut-off events. For 65043/65141 co-relation queries the response was YES. Maximal size of possible extension queue 1131. Compared 62782 event pairs, 0 based on Foata normal form. 0/1951 useless extension candidates. Maximal degree in co-relation 46071. Up to 3091 conditions per place. [2022-12-13 09:04:28,316 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 945 transitions, 15942 flow [2022-12-13 09:04:28,316 INFO L226 LiptonReduction]: Number of co-enabled transitions 9240 [2022-12-13 09:04:28,331 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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 5) (= 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 09:04:28,380 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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_~j~0_75 (+ v_~i~0_71 v_~j~0_76)) (< v_~q~0_26 5)) 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 09:04:28,422 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|) (< v_~q~0_19 5)) 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 09:04:28,462 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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 5) (= 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 09:04:28,508 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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 5) (= 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 09:04:28,543 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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 5)) 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 09:04:28,578 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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_47 (+ v_~p~0_48 1)) (< v_~p~0_48 5) (= (+ 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 09:04:28,619 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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 5) (= 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 09:04:28,664 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:04:28,664 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1014 [2022-12-13 09:04:28,664 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 945 transitions, 16030 flow [2022-12-13 09:04:28,664 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 09:04:28,664 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:04:28,665 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:04:28,671 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 09:04:28,865 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 09:04:28,865 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 09:04:28,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:04:28,865 INFO L85 PathProgramCache]: Analyzing trace with hash -812173099, now seen corresponding path program 1 times [2022-12-13 09:04:28,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:04:28,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649139834] [2022-12-13 09:04:28,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:04:28,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:04:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:04:29,016 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 09:04:29,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:04:29,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649139834] [2022-12-13 09:04:29,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649139834] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:04:29,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44088001] [2022-12-13 09:04:29,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:04:29,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:04:29,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:04:29,018 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 09:04:29,020 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 09:04:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:04:29,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 09:04:29,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:04:29,190 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 09:04:29,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:04:29,508 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 09:04:29,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44088001] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:04:29,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:04:29,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 09:04:29,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446570924] [2022-12-13 09:04:29,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:04:29,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 09:04:29,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:04:29,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 09:04:29,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-13 09:04:29,511 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 53 [2022-12-13 09:04:29,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 945 transitions, 16030 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 09:04:29,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:04:29,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 53 [2022-12-13 09:04:29,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:04:31,475 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 09:04:36,498 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 09:04:39,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:04:43,471 INFO L130 PetriNetUnfolder]: 12119/21098 cut-off events. [2022-12-13 09:04:43,471 INFO L131 PetriNetUnfolder]: For 350980/350980 co-relation queries the response was YES. [2022-12-13 09:04:43,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138443 conditions, 21098 events. 12119/21098 cut-off events. For 350980/350980 co-relation queries the response was YES. Maximal size of possible extension queue 2615. Compared 190958 event pairs, 1229 based on Foata normal form. 322/9722 useless extension candidates. Maximal degree in co-relation 138388. Up to 14009 conditions per place. [2022-12-13 09:04:43,578 INFO L137 encePairwiseOnDemand]: 16/53 looper letters, 669 selfloop transitions, 491 changer transitions 1/1165 dead transitions. [2022-12-13 09:04:43,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 1165 transitions, 20009 flow [2022-12-13 09:04:43,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:04:43,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 09:04:43,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 397 transitions. [2022-12-13 09:04:43,580 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4161425576519916 [2022-12-13 09:04:43,580 INFO L175 Difference]: Start difference. First operand has 149 places, 945 transitions, 16030 flow. Second operand 18 states and 397 transitions. [2022-12-13 09:04:43,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 1165 transitions, 20009 flow [2022-12-13 09:04:47,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 1165 transitions, 18281 flow, removed 724 selfloop flow, removed 12 redundant places. [2022-12-13 09:04:47,308 INFO L231 Difference]: Finished difference. Result has 160 places, 1033 transitions, 17146 flow [2022-12-13 09:04:47,308 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=14324, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=945, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=410, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=17146, PETRI_PLACES=160, PETRI_TRANSITIONS=1033} [2022-12-13 09:04:47,308 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 128 predicate places. [2022-12-13 09:04:47,309 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:04:47,309 INFO L89 Accepts]: Start accepts. Operand has 160 places, 1033 transitions, 17146 flow [2022-12-13 09:04:47,310 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:04:47,310 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:04:47,310 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 1033 transitions, 17146 flow [2022-12-13 09:04:47,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 1033 transitions, 17146 flow [2022-12-13 09:04:47,908 INFO L130 PetriNetUnfolder]: 2928/6545 cut-off events. [2022-12-13 09:04:47,909 INFO L131 PetriNetUnfolder]: For 68011/68118 co-relation queries the response was YES. [2022-12-13 09:04:47,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48636 conditions, 6545 events. 2928/6545 cut-off events. For 68011/68118 co-relation queries the response was YES. Maximal size of possible extension queue 1211. Compared 67093 event pairs, 0 based on Foata normal form. 0/2047 useless extension candidates. Maximal degree in co-relation 48581. Up to 3311 conditions per place. [2022-12-13 09:04:47,959 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 1033 transitions, 17146 flow [2022-12-13 09:04:47,959 INFO L226 LiptonReduction]: Number of co-enabled transitions 9956 [2022-12-13 09:04:47,980 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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 5)) 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 09:04:48,014 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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_47 (+ v_~p~0_48 1)) (< v_~p~0_48 5) (= (+ 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 09:04:48,053 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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 5) (= 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 09:04:48,091 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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 5) (= 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 09:04:48,137 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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 5) (= 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 09:04:48,181 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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_~j~0_75 (+ v_~i~0_71 v_~j~0_76)) (< v_~q~0_26 5)) 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 09:04:48,221 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|) (< v_~q~0_19 5)) 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 09:04:48,260 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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 5) (= 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 09:04:48,299 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:04:48,299 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 990 [2022-12-13 09:04:48,299 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 1033 transitions, 17258 flow [2022-12-13 09:04:48,302 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 09:04:48,302 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:04:48,302 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:04:48,306 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 09:04:48,506 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 09:04:48,507 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 09:04:48,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:04:48,507 INFO L85 PathProgramCache]: Analyzing trace with hash -281441903, now seen corresponding path program 1 times [2022-12-13 09:04:48,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:04:48,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286417704] [2022-12-13 09:04:48,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:04:48,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:04:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:04:48,621 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 09:04:48,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:04:48,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286417704] [2022-12-13 09:04:48,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286417704] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:04:48,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382506999] [2022-12-13 09:04:48,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:04:48,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:04:48,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:04:48,640 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 09:04:48,656 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 09:04:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:04:48,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 09:04:48,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:04:48,818 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 09:04:48,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:04:49,057 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 09:04:49,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382506999] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:04:49,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:04:49,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 09:04:49,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293466913] [2022-12-13 09:04:49,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:04:49,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 09:04:49,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:04:49,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 09:04:49,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-13 09:04:49,059 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 61 [2022-12-13 09:04:49,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 1033 transitions, 17258 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 09:04:49,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:04:49,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 61 [2022-12-13 09:04:49,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:04:57,712 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 09:04:59,769 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 09:05:01,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:05:03,683 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 09:05:06,520 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 09:05:08,528 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 09:05:10,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 09:05:12,028 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 09:05:14,034 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 09:05:16,041 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 09:05:18,477 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 09:05:20,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 09:05:22,489 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 09:05:24,156 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 09:05:26,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 09:05:28,975 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 09:05:32,865 INFO L130 PetriNetUnfolder]: 14316/25050 cut-off events. [2022-12-13 09:05:32,865 INFO L131 PetriNetUnfolder]: For 501609/501609 co-relation queries the response was YES. [2022-12-13 09:05:32,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165559 conditions, 25050 events. 14316/25050 cut-off events. For 501609/501609 co-relation queries the response was YES. Maximal size of possible extension queue 3104. Compared 233458 event pairs, 726 based on Foata normal form. 462/11503 useless extension candidates. Maximal degree in co-relation 165501. Up to 12510 conditions per place. [2022-12-13 09:05:33,007 INFO L137 encePairwiseOnDemand]: 16/61 looper letters, 536 selfloop transitions, 881 changer transitions 4/1425 dead transitions. [2022-12-13 09:05:33,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 1425 transitions, 24305 flow [2022-12-13 09:05:33,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:05:33,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-13 09:05:33,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 533 transitions. [2022-12-13 09:05:33,009 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34950819672131145 [2022-12-13 09:05:33,009 INFO L175 Difference]: Start difference. First operand has 159 places, 1033 transitions, 17258 flow. Second operand 25 states and 533 transitions. [2022-12-13 09:05:33,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 1425 transitions, 24305 flow [2022-12-13 09:05:38,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 1425 transitions, 23393 flow, removed 209 selfloop flow, removed 11 redundant places. [2022-12-13 09:05:38,764 INFO L231 Difference]: Finished difference. Result has 181 places, 1246 transitions, 22975 flow [2022-12-13 09:05:38,765 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=16346, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1033, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=692, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=22975, PETRI_PLACES=181, PETRI_TRANSITIONS=1246} [2022-12-13 09:05:38,765 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 149 predicate places. [2022-12-13 09:05:38,765 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:05:38,765 INFO L89 Accepts]: Start accepts. Operand has 181 places, 1246 transitions, 22975 flow [2022-12-13 09:05:38,767 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:05:38,767 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:05:38,767 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 1246 transitions, 22975 flow [2022-12-13 09:05:38,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 1246 transitions, 22975 flow [2022-12-13 09:05:39,686 INFO L130 PetriNetUnfolder]: 3520/7851 cut-off events. [2022-12-13 09:05:39,687 INFO L131 PetriNetUnfolder]: For 125683/125781 co-relation queries the response was YES. [2022-12-13 09:05:39,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66000 conditions, 7851 events. 3520/7851 cut-off events. For 125683/125781 co-relation queries the response was YES. Maximal size of possible extension queue 1429. Compared 82569 event pairs, 0 based on Foata normal form. 0/2441 useless extension candidates. Maximal degree in co-relation 65935. Up to 4289 conditions per place. [2022-12-13 09:05:39,795 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 180 places, 1246 transitions, 22975 flow [2022-12-13 09:05:39,795 INFO L226 LiptonReduction]: Number of co-enabled transitions 11812 [2022-12-13 09:05:39,816 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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 5) (= 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 09:05:39,864 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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_~j~0_75 (+ v_~i~0_71 v_~j~0_76)) (< v_~q~0_26 5)) 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 09:05:39,905 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|) (< v_~q~0_19 5)) 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 09:05:39,945 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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 5)) 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 09:05:39,981 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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 5) (= 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 09:05:40,016 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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_47 (+ v_~p~0_48 1)) (< v_~p~0_48 5) (= (+ 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 09:05:40,058 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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 5) (= 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 09:05:40,098 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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 5) (= 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 09:05:40,151 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:05:40,152 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1387 [2022-12-13 09:05:40,152 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 1246 transitions, 23055 flow [2022-12-13 09:05:40,152 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 09:05:40,153 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:05:40,153 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:05:40,157 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 09:05:40,357 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 09:05:40,358 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 09:05:40,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:05:40,358 INFO L85 PathProgramCache]: Analyzing trace with hash -47533701, now seen corresponding path program 1 times [2022-12-13 09:05:40,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:05:40,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020802907] [2022-12-13 09:05:40,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:05:40,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:05:40,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:05:40,501 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 09:05:40,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:05:40,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020802907] [2022-12-13 09:05:40,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020802907] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:05:40,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842049164] [2022-12-13 09:05:40,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:05:40,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:05:40,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:05:40,503 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 09:05:40,505 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 09:05:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:05:40,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 09:05:40,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:05:40,688 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 09:05:40,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:05:40,942 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 09:05:40,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842049164] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:05:40,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:05:40,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-13 09:05:40,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024410639] [2022-12-13 09:05:40,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:05:40,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 09:05:40,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:05:40,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 09:05:40,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-12-13 09:05:40,944 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 69 [2022-12-13 09:05:40,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 1246 transitions, 23055 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 09:05:40,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:05:40,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 69 [2022-12-13 09:05:40,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:05:48,086 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 09:05:51,069 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 09:05:53,108 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 09:05:55,189 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 09:05:56,321 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 09:05:58,959 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 09:06:02,040 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 09:06:04,080 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 09:06:06,313 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 09:06:10,284 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 09:06:12,294 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 09:06:17,520 INFO L130 PetriNetUnfolder]: 15569/27406 cut-off events. [2022-12-13 09:06:17,520 INFO L131 PetriNetUnfolder]: For 798366/798366 co-relation queries the response was YES. [2022-12-13 09:06:17,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199813 conditions, 27406 events. 15569/27406 cut-off events. For 798366/798366 co-relation queries the response was YES. Maximal size of possible extension queue 3255. Compared 257810 event pairs, 2127 based on Foata normal form. 497/12393 useless extension candidates. Maximal degree in co-relation 199745. Up to 19932 conditions per place. [2022-12-13 09:06:17,698 INFO L137 encePairwiseOnDemand]: 24/69 looper letters, 974 selfloop transitions, 560 changer transitions 4/1542 dead transitions. [2022-12-13 09:06:17,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 1542 transitions, 29355 flow [2022-12-13 09:06:17,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 09:06:17,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-13 09:06:17,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 458 transitions. [2022-12-13 09:06:17,700 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31608005521049 [2022-12-13 09:06:17,700 INFO L175 Difference]: Start difference. First operand has 180 places, 1246 transitions, 23055 flow. Second operand 21 states and 458 transitions. [2022-12-13 09:06:17,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 1542 transitions, 29355 flow [2022-12-13 09:06:27,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 1542 transitions, 27443 flow, removed 808 selfloop flow, removed 11 redundant places. [2022-12-13 09:06:27,060 INFO L231 Difference]: Finished difference. Result has 196 places, 1395 transitions, 25797 flow [2022-12-13 09:06:27,061 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=21209, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=439, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=790, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=25797, PETRI_PLACES=196, PETRI_TRANSITIONS=1395} [2022-12-13 09:06:27,061 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 164 predicate places. [2022-12-13 09:06:27,061 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:06:27,061 INFO L89 Accepts]: Start accepts. Operand has 196 places, 1395 transitions, 25797 flow [2022-12-13 09:06:27,064 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:06:27,064 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:06:27,064 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 1395 transitions, 25797 flow [2022-12-13 09:06:27,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 1395 transitions, 25797 flow [2022-12-13 09:06:28,127 INFO L130 PetriNetUnfolder]: 3950/8785 cut-off events. [2022-12-13 09:06:28,127 INFO L131 PetriNetUnfolder]: For 164182/164271 co-relation queries the response was YES. [2022-12-13 09:06:28,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74376 conditions, 8785 events. 3950/8785 cut-off events. For 164182/164271 co-relation queries the response was YES. Maximal size of possible extension queue 1448. Compared 91575 event pairs, 0 based on Foata normal form. 0/2679 useless extension candidates. Maximal degree in co-relation 74305. Up to 4971 conditions per place. [2022-12-13 09:06:28,272 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 195 places, 1395 transitions, 25797 flow [2022-12-13 09:06:28,272 INFO L226 LiptonReduction]: Number of co-enabled transitions 13204 [2022-12-13 09:06:28,284 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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 5)) 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 09:06:28,319 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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_47 (+ v_~p~0_48 1)) (< v_~p~0_48 5) (= (+ 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 09:06:28,369 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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 5) (= 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 09:06:28,407 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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 5) (= 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 09:06:28,451 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|) (< v_~q~0_19 5)) 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 09:06:28,488 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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 5) (= 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 09:06:28,521 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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 5) (= 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 09:06:28,565 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (* 89 v_~next~0_65) (+ (* 144 v_~prev~0_128) v_~cur~0_104)) (= (* 89 v_~prev~0_128) (+ (* 55 v_~next~0_65) v_~prev~0_130 v_~cur~0_104))) InVars {~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_128, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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_~j~0_75 (+ v_~i~0_71 v_~j~0_76)) (< v_~q~0_26 5)) 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 09:06:28,608 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|) (= |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)) (not (< v_~x~0_35 12)) (= |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 5) (= 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 09:06:28,678 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|) (= |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)) (not (< v_~x~0_35 12)) (= |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 5)) 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 09:06:28,744 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|) (= |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)) (not (< v_~x~0_35 12)) (= |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 5) (= 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 09:06:28,822 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|) (= |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)) (not (< v_~x~0_35 12)) (= |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_~j~0_75 (+ v_~i~0_71 v_~j~0_76)) (< v_~q~0_26 5)) 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 09:06:28,893 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|) (= |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)) (not (< v_~x~0_35 12)) (= |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 5) (= 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 09:06:28,973 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|) (= |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)) (not (< v_~x~0_35 12)) (= |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 5) (= 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 09:06:29,037 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|) (= |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)) (not (< v_~x~0_35 12)) (= |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 5) (= 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 09:06:29,101 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|) (= |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)) (not (< v_~x~0_35 12)) (= |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_47 (+ v_~p~0_48 1)) (< v_~p~0_48 5) (= (+ 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 09:06:29,174 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|) (= |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)) (not (< v_~x~0_35 12)) (= |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_~j~0_75 (+ v_~i~0_71 v_~j~0_76)) (< v_~q~0_26 5)) 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 09:06:29,246 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|) (= |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)) (not (< v_~x~0_35 12)) (= |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 5)) 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 09:06:29,311 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|) (= |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)) (not (< v_~x~0_35 12)) (= |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 5) (= 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 09:06:29,390 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|) (= |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)) (not (< v_~x~0_35 12)) (= |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_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|) (< v_~q~0_19 5)) 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 09:06:29,461 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|) (= |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)) (not (< v_~x~0_35 12)) (= |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 5) (= 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 09:06:29,540 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|) (= |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)) (not (< v_~x~0_35 12)) (= |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_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|) (< v_~q~0_19 5)) 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 09:06:29,611 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|) (= |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)) (not (< v_~x~0_35 12)) (= |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_47 (+ v_~p~0_48 1)) (< v_~p~0_48 5) (= (+ 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 09:06:29,684 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|) (= |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)) (not (< v_~x~0_35 12)) (= |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 5) (= 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 09:06:29,760 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:06:29,760 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2699 [2022-12-13 09:06:29,760 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 1395 transitions, 27077 flow [2022-12-13 09:06:29,760 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 09:06:29,760 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:06:29,761 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:06:29,768 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 09:06:29,961 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 09:06:29,961 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 09:06:29,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:06:29,961 INFO L85 PathProgramCache]: Analyzing trace with hash -281245704, now seen corresponding path program 1 times [2022-12-13 09:06:29,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:06:29,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734752430] [2022-12-13 09:06:29,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:06:29,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:06:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:06:30,127 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 09:06:30,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:06:30,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734752430] [2022-12-13 09:06:30,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734752430] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:06:30,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069139622] [2022-12-13 09:06:30,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:06:30,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:06:30,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:06:30,144 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 09:06:30,187 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 09:06:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:06:30,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 09:06:30,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:06:30,351 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 09:06:30,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:06:30,611 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 09:06:30,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069139622] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:06:30,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:06:30,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 09:06:30,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302029734] [2022-12-13 09:06:30,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:06:30,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 09:06:30,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:06:30,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 09:06:30,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-13 09:06:30,613 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 93 [2022-12-13 09:06:30,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 1395 transitions, 27077 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 09:06:30,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:06:30,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 93 [2022-12-13 09:06:30,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:06:33,868 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 09:06:35,886 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 09:06:38,195 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 09:06:40,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 09:06:42,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 09:06:44,411 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 09:06:46,422 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 09:06:48,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 09:06:50,758 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 09:06:52,768 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 09:06:54,776 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 09:06:56,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 09:06:59,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 09:07:02,222 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 09:07:03,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:07:05,566 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 09:07:08,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:07:12,771 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 09:07:14,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 09:07:20,236 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 09:07:27,662 INFO L130 PetriNetUnfolder]: 16703/29536 cut-off events. [2022-12-13 09:07:27,662 INFO L131 PetriNetUnfolder]: For 860174/860174 co-relation queries the response was YES. [2022-12-13 09:07:27,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220644 conditions, 29536 events. 16703/29536 cut-off events. For 860174/860174 co-relation queries the response was YES. Maximal size of possible extension queue 3468. Compared 283387 event pairs, 2016 based on Foata normal form. 294/12935 useless extension candidates. Maximal degree in co-relation 220570. Up to 19808 conditions per place. [2022-12-13 09:07:27,920 INFO L137 encePairwiseOnDemand]: 32/93 looper letters, 916 selfloop transitions, 789 changer transitions 1/1710 dead transitions. [2022-12-13 09:07:27,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 1710 transitions, 33756 flow [2022-12-13 09:07:27,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 09:07:27,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 09:07:27,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 536 transitions. [2022-12-13 09:07:27,922 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24014336917562723 [2022-12-13 09:07:27,922 INFO L175 Difference]: Start difference. First operand has 195 places, 1395 transitions, 27077 flow. Second operand 24 states and 536 transitions. [2022-12-13 09:07:27,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 1710 transitions, 33756 flow [2022-12-13 09:07:42,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 1710 transitions, 31055 flow, removed 1248 selfloop flow, removed 8 redundant places. [2022-12-13 09:07:42,158 INFO L231 Difference]: Finished difference. Result has 218 places, 1548 transitions, 29895 flow [2022-12-13 09:07:42,158 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=24456, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=675, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=29895, PETRI_PLACES=218, PETRI_TRANSITIONS=1548} [2022-12-13 09:07:42,158 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 186 predicate places. [2022-12-13 09:07:42,158 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:07:42,159 INFO L89 Accepts]: Start accepts. Operand has 218 places, 1548 transitions, 29895 flow [2022-12-13 09:07:42,161 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:07:42,161 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:07:42,161 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 218 places, 1548 transitions, 29895 flow [2022-12-13 09:07:42,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 217 places, 1548 transitions, 29895 flow [2022-12-13 09:07:43,425 INFO L130 PetriNetUnfolder]: 4266/9569 cut-off events. [2022-12-13 09:07:43,425 INFO L131 PetriNetUnfolder]: For 192827/192925 co-relation queries the response was YES. [2022-12-13 09:07:43,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83750 conditions, 9569 events. 4266/9569 cut-off events. For 192827/192925 co-relation queries the response was YES. Maximal size of possible extension queue 1595. Compared 102376 event pairs, 0 based on Foata normal form. 0/2875 useless extension candidates. Maximal degree in co-relation 83671. Up to 5039 conditions per place. [2022-12-13 09:07:43,527 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 217 places, 1548 transitions, 29895 flow [2022-12-13 09:07:43,527 INFO L226 LiptonReduction]: Number of co-enabled transitions 14484 [2022-12-13 09:07:43,531 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:07:43,532 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1374 [2022-12-13 09:07:43,532 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 1548 transitions, 29895 flow [2022-12-13 09:07:43,532 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 09:07:43,532 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:07:43,532 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:07:43,539 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 09:07:43,736 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 09:07:43,737 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting L690 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:07:43,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:07:43,737 INFO L85 PathProgramCache]: Analyzing trace with hash 462156392, now seen corresponding path program 1 times [2022-12-13 09:07:43,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:07:43,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505086106] [2022-12-13 09:07:43,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:07:43,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:07:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:07:43,850 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 09:07:43,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:07:43,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505086106] [2022-12-13 09:07:43,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505086106] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:07:43,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614582529] [2022-12-13 09:07:43,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:07:43,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:07:43,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:07:43,851 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 09:07:43,853 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 09:07:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:07:43,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 09:07:43,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:07:44,035 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 09:07:44,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:07:44,285 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 09:07:44,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614582529] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:07:44,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:07:44,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-13 09:07:44,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507180508] [2022-12-13 09:07:44,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:07:44,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 09:07:44,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:07:44,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 09:07:44,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-12-13 09:07:44,287 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 93 [2022-12-13 09:07:44,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 1548 transitions, 29895 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 09:07:44,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:07:44,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 93 [2022-12-13 09:07:44,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:07:50,800 WARN L233 SmtUtils]: Spent 5.80s 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 09:07:57,343 WARN L233 SmtUtils]: Spent 6.47s 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 09:08:01,645 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 09:08:03,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 09:08:06,661 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 09:08:09,158 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 09:08:11,167 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 09:08:13,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 09:08:16,564 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 09:08:19,207 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 09:08:21,264 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 09:08:23,271 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 09:08:25,276 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 09:08:27,282 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 09:08:28,606 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 09:08:30,612 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 09:08:32,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 09:08:35,430 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 09:08:37,437 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 09:08:39,452 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 09:08:41,464 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 09:08:43,470 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 09:08:45,478 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 09:08:47,555 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 09:08:49,582 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 09:08:51,146 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 09:08:53,152 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 09:08:55,493 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 09:08:57,500 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 09:08:59,510 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 09:09:03,100 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 09:09:05,241 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 09:09:07,342 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 09:09:09,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 09:09:11,490 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 09:09:13,587 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 09:09:15,595 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 09:09:18,916 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 09:09:20,947 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 09:09:22,954 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 09:09:25,350 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 09:09:26,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:09:32,861 INFO L130 PetriNetUnfolder]: 17039/30393 cut-off events. [2022-12-13 09:09:32,861 INFO L131 PetriNetUnfolder]: For 876633/876633 co-relation queries the response was YES. [2022-12-13 09:09:33,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227797 conditions, 30393 events. 17039/30393 cut-off events. For 876633/876633 co-relation queries the response was YES. Maximal size of possible extension queue 3668. Compared 295803 event pairs, 1026 based on Foata normal form. 355/13226 useless extension candidates. Maximal degree in co-relation 227715. Up to 16955 conditions per place. [2022-12-13 09:09:33,114 INFO L137 encePairwiseOnDemand]: 16/93 looper letters, 781 selfloop transitions, 1035 changer transitions 0/1820 dead transitions. [2022-12-13 09:09:33,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 1820 transitions, 36113 flow [2022-12-13 09:09:33,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:09:33,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-13 09:09:33,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 525 transitions. [2022-12-13 09:09:33,116 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24544179523141654 [2022-12-13 09:09:33,116 INFO L175 Difference]: Start difference. First operand has 217 places, 1548 transitions, 29895 flow. Second operand 23 states and 525 transitions. [2022-12-13 09:09:33,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 1820 transitions, 36113 flow [2022-12-13 09:09:48,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 1820 transitions, 35087 flow, removed 251 selfloop flow, removed 8 redundant places. [2022-12-13 09:09:48,756 INFO L231 Difference]: Finished difference. Result has 236 places, 1660 transitions, 34365 flow [2022-12-13 09:09:48,757 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=28263, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=914, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=34365, PETRI_PLACES=236, PETRI_TRANSITIONS=1660} [2022-12-13 09:09:48,757 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 204 predicate places. [2022-12-13 09:09:48,757 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:09:48,757 INFO L89 Accepts]: Start accepts. Operand has 236 places, 1660 transitions, 34365 flow [2022-12-13 09:09:48,761 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:09:48,761 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:09:48,761 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 236 places, 1660 transitions, 34365 flow [2022-12-13 09:09:48,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 236 places, 1660 transitions, 34365 flow [2022-12-13 09:09:50,326 INFO L130 PetriNetUnfolder]: 4414/10057 cut-off events. [2022-12-13 09:09:50,327 INFO L131 PetriNetUnfolder]: For 202672/202797 co-relation queries the response was YES. [2022-12-13 09:09:50,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92186 conditions, 10057 events. 4414/10057 cut-off events. For 202672/202797 co-relation queries the response was YES. Maximal size of possible extension queue 1737. Compared 110180 event pairs, 0 based on Foata normal form. 0/2982 useless extension candidates. Maximal degree in co-relation 92101. Up to 5353 conditions per place. [2022-12-13 09:09:50,439 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 236 places, 1660 transitions, 34365 flow [2022-12-13 09:09:50,440 INFO L226 LiptonReduction]: Number of co-enabled transitions 15312 [2022-12-13 09:09:50,445 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:09:50,445 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1688 [2022-12-13 09:09:50,445 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 1660 transitions, 34365 flow [2022-12-13 09:09:50,446 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 09:09:50,446 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:09:50,446 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:09:50,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-13 09:09:50,648 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 09:09:50,648 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 09:09:50,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:09:50,649 INFO L85 PathProgramCache]: Analyzing trace with hash 480286844, now seen corresponding path program 1 times [2022-12-13 09:09:50,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:09:50,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597734543] [2022-12-13 09:09:50,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:09:50,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:09:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:09:50,801 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 09:09:50,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:09:50,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597734543] [2022-12-13 09:09:50,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597734543] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:09:50,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237835971] [2022-12-13 09:09:50,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:09:50,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:09:50,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:09:50,803 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 09:09:50,806 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 09:09:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:09:50,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 09:09:50,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:09:51,038 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 09:09:51,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:09:51,379 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 09:09:51,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237835971] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:09:51,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:09:51,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-13 09:09:51,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258782078] [2022-12-13 09:09:51,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:09:51,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 09:09:51,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:09:51,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 09:09:51,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-12-13 09:09:51,381 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 77 [2022-12-13 09:09:51,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 1660 transitions, 34365 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 09:09:51,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:09:51,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 77 [2022-12-13 09:09:51,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:09:56,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:09:58,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:10:02,947 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 09:10:04,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 09:10:15,314 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 09:10:17,327 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 09:10:27,433 INFO L130 PetriNetUnfolder]: 18264/33125 cut-off events. [2022-12-13 09:10:27,433 INFO L131 PetriNetUnfolder]: For 960361/960361 co-relation queries the response was YES. [2022-12-13 09:10:27,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255766 conditions, 33125 events. 18264/33125 cut-off events. For 960361/960361 co-relation queries the response was YES. Maximal size of possible extension queue 4014. Compared 333653 event pairs, 2256 based on Foata normal form. 294/14032 useless extension candidates. Maximal degree in co-relation 255678. Up to 20820 conditions per place. [2022-12-13 09:10:27,692 INFO L137 encePairwiseOnDemand]: 24/77 looper letters, 1152 selfloop transitions, 940 changer transitions 0/2096 dead transitions. [2022-12-13 09:10:27,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 2096 transitions, 44233 flow [2022-12-13 09:10:27,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 09:10:27,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-13 09:10:27,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 586 transitions. [2022-12-13 09:10:27,694 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2818662818662819 [2022-12-13 09:10:27,694 INFO L175 Difference]: Start difference. First operand has 236 places, 1660 transitions, 34365 flow. Second operand 27 states and 586 transitions. [2022-12-13 09:10:27,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 2096 transitions, 44233 flow [2022-12-13 09:10:44,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 2096 transitions, 42440 flow, removed 722 selfloop flow, removed 9 redundant places. [2022-12-13 09:10:44,031 INFO L231 Difference]: Finished difference. Result has 259 places, 1908 transitions, 40991 flow [2022-12-13 09:10:44,032 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=32860, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1660, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=748, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=808, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=40991, PETRI_PLACES=259, PETRI_TRANSITIONS=1908} [2022-12-13 09:10:44,032 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 227 predicate places. [2022-12-13 09:10:44,032 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:10:44,032 INFO L89 Accepts]: Start accepts. Operand has 259 places, 1908 transitions, 40991 flow [2022-12-13 09:10:44,036 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:10:44,036 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:10:44,036 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 259 places, 1908 transitions, 40991 flow [2022-12-13 09:10:44,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 259 places, 1908 transitions, 40991 flow [2022-12-13 09:10:45,819 INFO L130 PetriNetUnfolder]: 4862/11357 cut-off events. [2022-12-13 09:10:45,819 INFO L131 PetriNetUnfolder]: For 198030/198155 co-relation queries the response was YES. [2022-12-13 09:10:45,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104933 conditions, 11357 events. 4862/11357 cut-off events. For 198030/198155 co-relation queries the response was YES. Maximal size of possible extension queue 2029. Compared 129603 event pairs, 0 based on Foata normal form. 0/3283 useless extension candidates. Maximal degree in co-relation 104843. Up to 6081 conditions per place. [2022-12-13 09:10:46,097 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 259 places, 1908 transitions, 40991 flow [2022-12-13 09:10:46,098 INFO L226 LiptonReduction]: Number of co-enabled transitions 17264 [2022-12-13 09:10:46,110 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:10:46,110 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2078 [2022-12-13 09:10:46,110 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 1908 transitions, 40991 flow [2022-12-13 09:10:46,110 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 09:10:46,110 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:10:46,111 INFO L214 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:10:46,117 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 09:10:46,315 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 09:10:46,315 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 09:10:46,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:10:46,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1131927714, now seen corresponding path program 2 times [2022-12-13 09:10:46,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:10:46,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561249881] [2022-12-13 09:10:46,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:10:46,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:10:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:10:46,519 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:10:46,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:10:46,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561249881] [2022-12-13 09:10:46,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561249881] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:10:46,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671554871] [2022-12-13 09:10:46,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 09:10:46,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:10:46,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:10:46,521 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 09:10:46,524 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 09:10:46,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 09:10:46,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 09:10:46,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 09:10:46,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:10:46,760 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:10:46,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:10:47,172 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:10:47,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671554871] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:10:47,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:10:47,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-13 09:10:47,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058683751] [2022-12-13 09:10:47,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:10:47,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 09:10:47,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:10:47,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 09:10:47,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2022-12-13 09:10:47,174 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 77 [2022-12-13 09:10:47,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 1908 transitions, 40991 flow. Second operand has 23 states, 23 states have (on average 5.695652173913044) internal successors, (131), 23 states have internal predecessors, (131), 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 09:10:47,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:10:47,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 77 [2022-12-13 09:10:47,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:10:58,570 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 09:11:06,205 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 09:11:08,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:11:11,041 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 09:11:13,046 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 09:11:15,053 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 09:11:17,142 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 09:11:20,146 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 09:11:24,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 09:11:25,881 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 09:11:27,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 09:11:31,767 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 09:11:33,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 09:11:35,792 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 09:11:37,801 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 09:11:40,580 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 09:11:42,589 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 09:11:48,595 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 09:11:52,603 INFO L130 PetriNetUnfolder]: 21491/38786 cut-off events. [2022-12-13 09:11:52,604 INFO L131 PetriNetUnfolder]: For 1537904/1537904 co-relation queries the response was YES. [2022-12-13 09:11:53,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319240 conditions, 38786 events. 21491/38786 cut-off events. For 1537904/1537904 co-relation queries the response was YES. Maximal size of possible extension queue 4588. Compared 393870 event pairs, 2994 based on Foata normal form. 357/16501 useless extension candidates. Maximal degree in co-relation 319147. Up to 24110 conditions per place. [2022-12-13 09:11:53,098 INFO L137 encePairwiseOnDemand]: 24/77 looper letters, 1384 selfloop transitions, 993 changer transitions 0/2381 dead transitions. [2022-12-13 09:11:53,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 2381 transitions, 53253 flow [2022-12-13 09:11:53,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:11:53,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-13 09:11:53,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 585 transitions. [2022-12-13 09:11:53,116 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2922077922077922 [2022-12-13 09:11:53,116 INFO L175 Difference]: Start difference. First operand has 259 places, 1908 transitions, 40991 flow. Second operand 26 states and 585 transitions. [2022-12-13 09:11:53,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 2381 transitions, 53253 flow [2022-12-13 09:12:17,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 2381 transitions, 51207 flow, removed 721 selfloop flow, removed 14 redundant places. [2022-12-13 09:12:17,615 INFO L231 Difference]: Finished difference. Result has 283 places, 2187 transitions, 49255 flow [2022-12-13 09:12:17,616 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=39258, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1908, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=747, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=49255, PETRI_PLACES=283, PETRI_TRANSITIONS=2187} [2022-12-13 09:12:17,616 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 251 predicate places. [2022-12-13 09:12:17,616 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:12:17,616 INFO L89 Accepts]: Start accepts. Operand has 283 places, 2187 transitions, 49255 flow [2022-12-13 09:12:17,620 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:12:17,621 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:12:17,621 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 283 places, 2187 transitions, 49255 flow [2022-12-13 09:12:17,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 283 places, 2187 transitions, 49255 flow [2022-12-13 09:12:20,134 INFO L130 PetriNetUnfolder]: 5774/13273 cut-off events. [2022-12-13 09:12:20,134 INFO L131 PetriNetUnfolder]: For 402003/402137 co-relation queries the response was YES. [2022-12-13 09:12:20,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134569 conditions, 13273 events. 5774/13273 cut-off events. For 402003/402137 co-relation queries the response was YES. Maximal size of possible extension queue 2257. Compared 151755 event pairs, 0 based on Foata normal form. 0/3882 useless extension candidates. Maximal degree in co-relation 134465. Up to 6183 conditions per place. [2022-12-13 09:12:20,304 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 283 places, 2187 transitions, 49255 flow [2022-12-13 09:12:20,304 INFO L226 LiptonReduction]: Number of co-enabled transitions 19868 [2022-12-13 09:12:20,310 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:12:20,311 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2695 [2022-12-13 09:12:20,311 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 2187 transitions, 49255 flow [2022-12-13 09:12:20,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.695652173913044) internal successors, (131), 23 states have internal predecessors, (131), 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 09:12:20,311 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:12:20,311 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:12:20,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-13 09:12:20,515 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 09:12:20,515 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 09:12:20,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:12:20,515 INFO L85 PathProgramCache]: Analyzing trace with hash -666528179, now seen corresponding path program 1 times [2022-12-13 09:12:20,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:12:20,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261264922] [2022-12-13 09:12:20,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:12:20,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:12:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:12:20,657 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 09:12:20,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:12:20,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261264922] [2022-12-13 09:12:20,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261264922] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:12:20,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508880858] [2022-12-13 09:12:20,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:12:20,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:12:20,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:12:20,659 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 09:12:20,662 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 09:12:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:12:20,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 09:12:20,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:12:20,844 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 09:12:20,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:12:21,207 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 09:12:21,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508880858] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:12:21,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:12:21,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-13 09:12:21,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617234546] [2022-12-13 09:12:21,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:12:21,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 09:12:21,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:12:21,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 09:12:21,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2022-12-13 09:12:21,211 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 77 [2022-12-13 09:12:21,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 2187 transitions, 49255 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 09:12:21,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:12:21,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 77 [2022-12-13 09:12:21,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:12:40,217 INFO L130 PetriNetUnfolder]: 24361/44112 cut-off events. [2022-12-13 09:12:40,217 INFO L131 PetriNetUnfolder]: For 2008355/2008355 co-relation queries the response was YES. [2022-12-13 09:12:40,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377549 conditions, 44112 events. 24361/44112 cut-off events. For 2008355/2008355 co-relation queries the response was YES. Maximal size of possible extension queue 5336. Compared 457707 event pairs, 747 based on Foata normal form. 399/18939 useless extension candidates. Maximal degree in co-relation 377442. Up to 15034 conditions per place. [2022-12-13 09:12:41,015 INFO L137 encePairwiseOnDemand]: 16/77 looper letters, 727 selfloop transitions, 1884 changer transitions 0/2615 dead transitions. [2022-12-13 09:12:41,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 2615 transitions, 62919 flow [2022-12-13 09:12:41,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:12:41,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 09:12:41,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 436 transitions. [2022-12-13 09:12:41,026 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31457431457431456 [2022-12-13 09:12:41,026 INFO L175 Difference]: Start difference. First operand has 283 places, 2187 transitions, 49255 flow. Second operand 18 states and 436 transitions. [2022-12-13 09:12:41,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 2615 transitions, 62919 flow [2022-12-13 09:13:14,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 2615 transitions, 59476 flow, removed 1675 selfloop flow, removed 5 redundant places. [2022-12-13 09:13:14,124 INFO L231 Difference]: Finished difference. Result has 301 places, 2468 transitions, 59947 flow [2022-12-13 09:13:14,126 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=46452, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1653, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=59947, PETRI_PLACES=301, PETRI_TRANSITIONS=2468} [2022-12-13 09:13:14,126 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 269 predicate places. [2022-12-13 09:13:14,126 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:13:14,126 INFO L89 Accepts]: Start accepts. Operand has 301 places, 2468 transitions, 59947 flow [2022-12-13 09:13:14,132 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:13:14,132 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:13:14,132 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 301 places, 2468 transitions, 59947 flow [2022-12-13 09:13:14,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 301 places, 2468 transitions, 59947 flow [2022-12-13 09:13:17,135 INFO L130 PetriNetUnfolder]: 6410/14905 cut-off events. [2022-12-13 09:13:17,135 INFO L131 PetriNetUnfolder]: For 380668/380793 co-relation queries the response was YES. [2022-12-13 09:13:17,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157304 conditions, 14905 events. 6410/14905 cut-off events. For 380668/380793 co-relation queries the response was YES. Maximal size of possible extension queue 2574. Compared 175410 event pairs, 16 based on Foata normal form. 0/4383 useless extension candidates. Maximal degree in co-relation 157193. Up to 6527 conditions per place. [2022-12-13 09:13:17,410 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 301 places, 2468 transitions, 59947 flow [2022-12-13 09:13:17,411 INFO L226 LiptonReduction]: Number of co-enabled transitions 22324 [2022-12-13 09:13:17,420 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:13:17,421 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3295 [2022-12-13 09:13:17,421 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 2468 transitions, 59947 flow [2022-12-13 09:13:17,421 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 09:13:17,422 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:13:17,422 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:13:17,430 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 09:13:17,626 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 09:13:17,627 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:13:17,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:13:17,627 INFO L85 PathProgramCache]: Analyzing trace with hash -110289289, now seen corresponding path program 1 times [2022-12-13 09:13:17,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:13:17,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218718237] [2022-12-13 09:13:17,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:13:17,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:13:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:13:17,740 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 09:13:17,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:13:17,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218718237] [2022-12-13 09:13:17,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218718237] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:13:17,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563535175] [2022-12-13 09:13:17,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:13:17,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:13:17,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:13:17,753 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 09:13:17,758 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 09:13:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:13:17,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 09:13:17,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:13:17,946 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 09:13:17,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:13:18,204 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 09:13:18,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563535175] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:13:18,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:13:18,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-13 09:13:18,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588509968] [2022-12-13 09:13:18,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:13:18,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 09:13:18,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:13:18,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 09:13:18,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2022-12-13 09:13:18,206 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 77 [2022-12-13 09:13:18,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 2468 transitions, 59947 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 09:13:18,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:13:18,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 77 [2022-12-13 09:13:18,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:13:25,507 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 09:13:28,448 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 09:13:29,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:32,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 09:13:34,267 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 09:13:35,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:37,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:39,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:41,099 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 09:13:43,122 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 09:13:50,996 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 09:13:52,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:13:54,700 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 09:13:57,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:14:01,751 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 09:14:03,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:14:10,892 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 09:14:14,354 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 09:14:16,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 09:14:18,374 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 09:14:21,193 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 09:14:23,213 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 09:14:25,221 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 09:14:27,243 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 09:14:29,675 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 09:14:30,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:14:32,743 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 09:14:34,750 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 09:14:36,757 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 09:14:38,769 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 09:14:40,815 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 09:15:02,996 INFO L130 PetriNetUnfolder]: 25592/46653 cut-off events. [2022-12-13 09:15:02,996 INFO L131 PetriNetUnfolder]: For 2394377/2394377 co-relation queries the response was YES. [2022-12-13 09:15:04,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417464 conditions, 46653 events. 25592/46653 cut-off events. For 2394377/2394377 co-relation queries the response was YES. Maximal size of possible extension queue 5625. Compared 493216 event pairs, 3881 based on Foata normal form. 490/19811 useless extension candidates. Maximal degree in co-relation 417350. Up to 32831 conditions per place. [2022-12-13 09:15:04,421 INFO L137 encePairwiseOnDemand]: 24/77 looper letters, 1775 selfloop transitions, 1061 changer transitions 9/2849 dead transitions. [2022-12-13 09:15:04,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 2849 transitions, 71575 flow [2022-12-13 09:15:04,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 09:15:04,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-13 09:15:04,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 562 transitions. [2022-12-13 09:15:04,423 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2606679035250464 [2022-12-13 09:15:04,423 INFO L175 Difference]: Start difference. First operand has 301 places, 2468 transitions, 59947 flow. Second operand 28 states and 562 transitions. [2022-12-13 09:15:04,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 2849 transitions, 71575 flow Received shutdown request... [2022-12-13 09:15:35,311 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 09:15:35,314 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 09:15:35,661 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 09:15:35,669 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 09:15:35,867 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 09:15:35,867 WARN L619 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2022-12-13 09:15:35,869 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 09:15:35,869 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 09:15:35,869 INFO L445 BasicCegarLoop]: Path program histogram: [2, 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 09:15:35,872 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:15:35,872 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:15:35,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:15:35 BasicIcfg [2022-12-13 09:15:35,876 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:15:35,884 INFO L158 Benchmark]: Toolchain (without parser) took 853594.91ms. Allocated memory was 187.7MB in the beginning and 4.9GB in the end (delta: 4.8GB). Free memory was 160.8MB in the beginning and 3.4GB in the end (delta: -3.2GB). Peak memory consumption was 4.7GB. Max. memory is 8.0GB. [2022-12-13 09:15:35,884 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory is still 164.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:15:35,884 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.99ms. Allocated memory is still 187.7MB. Free memory was 160.8MB in the beginning and 140.4MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-13 09:15:35,884 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.88ms. Allocated memory is still 187.7MB. Free memory was 140.4MB in the beginning and 138.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:15:35,885 INFO L158 Benchmark]: Boogie Preprocessor took 30.01ms. Allocated memory is still 187.7MB. Free memory was 138.8MB in the beginning and 137.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 09:15:35,885 INFO L158 Benchmark]: RCFGBuilder took 460.30ms. Allocated memory is still 187.7MB. Free memory was 137.2MB in the beginning and 123.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 09:15:35,885 INFO L158 Benchmark]: TraceAbstraction took 852633.55ms. Allocated memory was 187.7MB in the beginning and 4.9GB in the end (delta: 4.8GB). Free memory was 122.6MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 4.7GB. Max. memory is 8.0GB. [2022-12-13 09:15:35,886 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.09ms. Allocated memory is still 187.7MB. Free memory is still 164.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 415.99ms. Allocated memory is still 187.7MB. Free memory was 160.8MB in the beginning and 140.4MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.88ms. Allocated memory is still 187.7MB. Free memory was 140.4MB in the beginning and 138.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.01ms. Allocated memory is still 187.7MB. Free memory was 138.8MB in the beginning and 137.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 460.30ms. Allocated memory is still 187.7MB. Free memory was 137.2MB in the beginning and 123.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 852633.55ms. Allocated memory was 187.7MB in the beginning and 4.9GB in the end (delta: 4.8GB). Free memory was 122.6MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 4.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 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: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1451, independent: 1440, independent conditional: 0, independent unconditional: 1440, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1451, independent: 1440, independent conditional: 0, independent unconditional: 1440, 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: 1451, independent: 1440, independent conditional: 0, independent unconditional: 1440, 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: 53, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1670, independent: 215, independent conditional: 215, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1451, unknown conditional: 1451, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1673, Positive cache size: 1662, Positive conditional cache size: 1662, Positive unconditional cache size: 0, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: 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: 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: 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 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: 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: 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: 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): 140, Positive cache size: 140, Positive conditional cache size: 140, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 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: 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: 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: 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): 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 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: 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: 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: 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): 440, Positive cache size: 440, Positive conditional cache size: 440, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 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: 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: 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: 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): 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 - 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: 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: 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: 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): 640, Positive cache size: 640, Positive conditional cache size: 640, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 41 PlacesBefore, 41 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 1176 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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): 704, Positive cache size: 704, Positive conditional cache size: 704, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 904 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 704, Positive cache size: 704, Positive conditional cache size: 704, 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 - 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: 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: 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: 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): 704, Positive cache size: 704, Positive conditional cache size: 704, 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 - 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: 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: 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: 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): 704, Positive cache size: 704, Positive conditional cache size: 704, 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 - 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: 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: 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: 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): 704, Positive cache size: 704, Positive conditional cache size: 704, 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 - 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: 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: 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: 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): 704, Positive cache size: 704, Positive conditional cache size: 704, 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 - 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: 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: 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: 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): 704, Positive cache size: 704, Positive conditional cache size: 704, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 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: 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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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): 712, Positive cache size: 712, Positive conditional cache size: 712, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 114 PlacesBefore, 113 PlacesAfterwards, 560 TransitionsBefore, 559 TransitionsAfterwards, 5568 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 8, independent: 0, independent conditional: 0, 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): 720, Positive cache size: 720, Positive conditional cache size: 720, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 123 PlacesBefore, 123 PlacesAfterwards, 713 TransitionsBefore, 713 TransitionsAfterwards, 7072 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 720, Positive cache size: 720, Positive conditional cache size: 720, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 149 PlacesBefore, 149 PlacesAfterwards, 945 TransitionsBefore, 945 TransitionsAfterwards, 9240 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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): 730, Positive cache size: 730, Positive conditional cache size: 730, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 159 PlacesBefore, 159 PlacesAfterwards, 1033 TransitionsBefore, 1033 TransitionsAfterwards, 9956 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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): 738, Positive cache size: 738, Positive conditional cache size: 738, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 180 PlacesBefore, 180 PlacesAfterwards, 1246 TransitionsBefore, 1246 TransitionsAfterwards, 11812 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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): 748, Positive cache size: 748, Positive conditional cache size: 748, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 195 PlacesBefore, 195 PlacesAfterwards, 1395 TransitionsBefore, 1395 TransitionsAfterwards, 13204 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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): 766, Positive cache size: 766, Positive conditional cache size: 766, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 217 PlacesBefore, 217 PlacesAfterwards, 1548 TransitionsBefore, 1548 TransitionsAfterwards, 14484 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 766, Positive cache size: 766, Positive conditional cache size: 766, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 236 PlacesBefore, 236 PlacesAfterwards, 1660 TransitionsBefore, 1660 TransitionsAfterwards, 15312 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 766, Positive cache size: 766, Positive conditional cache size: 766, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 259 PlacesBefore, 259 PlacesAfterwards, 1908 TransitionsBefore, 1908 TransitionsAfterwards, 17264 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 766, Positive cache size: 766, Positive conditional cache size: 766, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 283 PlacesBefore, 283 PlacesAfterwards, 2187 TransitionsBefore, 2187 TransitionsAfterwards, 19868 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 766, Positive cache size: 766, Positive conditional cache size: 766, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 301 PlacesBefore, 301 PlacesAfterwards, 2468 TransitionsBefore, 2468 TransitionsAfterwards, 22324 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 766, Positive cache size: 766, Positive conditional cache size: 766, 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 - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - 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 RemoveRedundantFlow. - 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 RemoveRedundantFlow. - 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: 852.5s, OverallIterations: 26, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 810.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 164 mSolverCounterUnknown, 5649 SdHoareTripleChecker+Valid, 476.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5649 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 472.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 5935 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16936 IncrementalHoareTripleChecker+Invalid, 23035 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5935 mSolverCounterUnsat, 0 mSDtfsCounter, 16936 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 752 GetRequests, 258 SyntacticMatches, 2 SemanticMatches, 492 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2314 ImplicationChecksByTransitivity, 85.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59947occurred in iteration=25, InterpolantAutomatonStates: 351, 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.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 507 NumberOfCodeBlocks, 507 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 672 ConstructedInterpolants, 148 QuantifiedInterpolants, 14658 SizeOfPredicates, 18 NumberOfNonLiveVariables, 3637 ConjunctsInSsa, 365 ConjunctsInUnsatCore, 73 InterpolantComputations, 3 PerfectInterpolantSequences, 6/199 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