/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:54:41,669 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:54:41,672 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:54:41,707 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:54:41,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:54:41,710 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:54:41,713 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:54:41,717 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:54:41,721 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:54:41,725 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:54:41,728 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:54:41,729 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:54:41,730 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:54:41,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:54:41,733 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:54:41,734 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:54:41,735 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:54:41,735 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:54:41,739 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:54:41,744 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:54:41,745 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:54:41,746 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:54:41,747 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:54:41,748 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:54:41,755 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:54:41,755 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:54:41,756 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:54:41,757 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:54:41,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:54:41,758 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:54:41,758 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:54:41,760 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:54:41,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:54:41,762 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:54:41,763 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:54:41,763 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:54:41,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:54:41,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:54:41,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:54:41,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:54:41,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:54:41,776 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 00:54:41,807 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:54:41,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:54:41,809 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:54:41,809 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:54:41,809 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:54:41,810 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:54:41,810 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:54:41,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:54:41,810 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:54:41,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:54:41,811 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:54:41,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:54:41,811 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:54:41,812 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:54:41,812 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:54:41,812 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:54:41,812 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:54:41,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:54:41,812 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:54:41,812 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:54:41,813 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:54:41,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:54:41,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:54:41,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:54:41,813 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:54:41,813 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:54:41,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:54:41,814 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:54:41,814 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 00:54:42,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:54:42,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:54:42,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:54:42,155 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:54:42,155 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:54:42,156 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longest.i [2022-12-06 00:54:43,259 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:54:43,531 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:54:43,531 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2022-12-06 00:54:43,549 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa591b2e5/ff793d77133b49268ac62abd07c94a43/FLAGd2c3cb211 [2022-12-06 00:54:43,562 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa591b2e5/ff793d77133b49268ac62abd07c94a43 [2022-12-06 00:54:43,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:54:43,565 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:54:43,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:54:43,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:54:43,569 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:54:43,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:54:43" (1/1) ... [2022-12-06 00:54:43,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d5c836e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:43, skipping insertion in model container [2022-12-06 00:54:43,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:54:43" (1/1) ... [2022-12-06 00:54:43,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:54:43,628 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:54:44,119 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/queue_ok_longest.i[43280,43293] [2022-12-06 00:54:44,127 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/queue_ok_longest.i[43553,43566] [2022-12-06 00:54:44,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:54:44,145 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:54:44,204 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/queue_ok_longest.i[43280,43293] [2022-12-06 00:54:44,211 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/queue_ok_longest.i[43553,43566] [2022-12-06 00:54:44,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:54:44,287 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:54:44,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:44 WrapperNode [2022-12-06 00:54:44,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:54:44,290 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:54:44,290 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:54:44,290 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:54:44,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:44" (1/1) ... [2022-12-06 00:54:44,325 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:44" (1/1) ... [2022-12-06 00:54:44,365 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-12-06 00:54:44,366 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:54:44,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:54:44,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:54:44,367 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:54:44,375 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:44" (1/1) ... [2022-12-06 00:54:44,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:44" (1/1) ... [2022-12-06 00:54:44,392 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:44" (1/1) ... [2022-12-06 00:54:44,393 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:44" (1/1) ... [2022-12-06 00:54:44,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:44" (1/1) ... [2022-12-06 00:54:44,403 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:44" (1/1) ... [2022-12-06 00:54:44,405 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:44" (1/1) ... [2022-12-06 00:54:44,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:44" (1/1) ... [2022-12-06 00:54:44,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:54:44,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:54:44,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:54:44,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:54:44,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:44" (1/1) ... [2022-12-06 00:54:44,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:54:44,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:54:44,461 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-06 00:54:44,471 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-06 00:54:44,502 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-06 00:54:44,503 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-06 00:54:44,503 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-06 00:54:44,503 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-06 00:54:44,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:54:44,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:54:44,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:54:44,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:54:44,504 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 00:54:44,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:54:44,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:54:44,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:54:44,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:54:44,505 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 00:54:44,706 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:54:44,707 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:54:45,032 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:54:45,045 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:54:45,046 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 00:54:45,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:54:45 BoogieIcfgContainer [2022-12-06 00:54:45,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:54:45,051 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:54:45,051 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:54:45,054 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:54:45,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:54:43" (1/3) ... [2022-12-06 00:54:45,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6d1c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:54:45, skipping insertion in model container [2022-12-06 00:54:45,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:44" (2/3) ... [2022-12-06 00:54:45,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6d1c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:54:45, skipping insertion in model container [2022-12-06 00:54:45,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:54:45" (3/3) ... [2022-12-06 00:54:45,056 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2022-12-06 00:54:45,073 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:54:45,074 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 00:54:45,074 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:54:45,201 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 00:54:45,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 215 transitions, 446 flow [2022-12-06 00:54:45,330 INFO L130 PetriNetUnfolder]: 13/213 cut-off events. [2022-12-06 00:54:45,330 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:54:45,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 213 events. 13/213 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 357 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 140. Up to 3 conditions per place. [2022-12-06 00:54:45,341 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 215 transitions, 446 flow [2022-12-06 00:54:45,350 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 204 transitions, 417 flow [2022-12-06 00:54:45,352 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:54:45,370 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 204 transitions, 417 flow [2022-12-06 00:54:45,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 204 transitions, 417 flow [2022-12-06 00:54:45,496 INFO L130 PetriNetUnfolder]: 13/204 cut-off events. [2022-12-06 00:54:45,496 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 00:54:45,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 204 events. 13/204 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 293 event pairs, 0 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 140. Up to 3 conditions per place. [2022-12-06 00:54:45,509 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 204 transitions, 417 flow [2022-12-06 00:54:45,509 INFO L188 LiptonReduction]: Number of co-enabled transitions 9810 [2022-12-06 00:54:54,511 INFO L203 LiptonReduction]: Total number of compositions: 164 [2022-12-06 00:54:54,533 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:54:54,540 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;@6a5bab2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:54:54,540 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 00:54:54,542 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-06 00:54:54,542 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:54:54,542 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:54:54,543 INFO L213 CegarLoopForPetriNet]: trace histogram [1] [2022-12-06 00:54:54,544 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 00:54:54,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:54:54,548 INFO L85 PathProgramCache]: Analyzing trace with hash 847, now seen corresponding path program 1 times [2022-12-06 00:54:54,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:54:54,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438333047] [2022-12-06 00:54:54,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:54:54,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:54:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:54:54,671 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-06 00:54:54,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:54:54,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438333047] [2022-12-06 00:54:54,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438333047] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:54:54,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:54:54,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-06 00:54:54,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701664639] [2022-12-06 00:54:54,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:54:54,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 00:54:54,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:54:54,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 00:54:54,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 00:54:54,704 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 47 [2022-12-06 00:54:54,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 103 flow. Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-06 00:54:54,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:54:54,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 47 [2022-12-06 00:54:54,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:54:54,906 INFO L130 PetriNetUnfolder]: 751/1277 cut-off events. [2022-12-06 00:54:54,906 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-12-06 00:54:54,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2501 conditions, 1277 events. 751/1277 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5564 event pairs, 582 based on Foata normal form. 0/1004 useless extension candidates. Maximal degree in co-relation 2344. Up to 1178 conditions per place. [2022-12-06 00:54:54,917 INFO L137 encePairwiseOnDemand]: 45/47 looper letters, 38 selfloop transitions, 0 changer transitions 0/45 dead transitions. [2022-12-06 00:54:54,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 175 flow [2022-12-06 00:54:54,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 00:54:54,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 00:54:54,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2022-12-06 00:54:54,928 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.574468085106383 [2022-12-06 00:54:54,932 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2022-12-06 00:54:54,932 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:54:54,933 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 45 transitions, 175 flow [2022-12-06 00:54:54,950 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 45 transitions, 175 flow [2022-12-06 00:54:54,950 INFO L188 LiptonReduction]: Number of co-enabled transitions 286 [2022-12-06 00:54:55,189 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 00:54:55,191 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 259 [2022-12-06 00:54:55,191 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 41 transitions, 171 flow [2022-12-06 00:54:55,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-06 00:54:55,191 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:54:55,191 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:54:55,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:54:55,192 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 00:54:55,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:54:55,192 INFO L85 PathProgramCache]: Analyzing trace with hash -247431227, now seen corresponding path program 1 times [2022-12-06 00:54:55,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:54:55,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225966645] [2022-12-06 00:54:55,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:54:55,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:54:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:54:55,460 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-06 00:54:55,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:54:55,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225966645] [2022-12-06 00:54:55,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225966645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:54:55,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:54:55,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:54:55,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879942659] [2022-12-06 00:54:55,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:54:55,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:54:55,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:54:55,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:54:55,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:54:55,464 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 41 [2022-12-06 00:54:55,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 41 transitions, 171 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-06 00:54:55,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:54:55,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 41 [2022-12-06 00:54:55,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:54:55,579 INFO L130 PetriNetUnfolder]: 240/443 cut-off events. [2022-12-06 00:54:55,580 INFO L131 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2022-12-06 00:54:55,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1379 conditions, 443 events. 240/443 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1578 event pairs, 174 based on Foata normal form. 28/383 useless extension candidates. Maximal degree in co-relation 1107. Up to 442 conditions per place. [2022-12-06 00:54:55,582 INFO L137 encePairwiseOnDemand]: 37/41 looper letters, 35 selfloop transitions, 2 changer transitions 11/49 dead transitions. [2022-12-06 00:54:55,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 305 flow [2022-12-06 00:54:55,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:54:55,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:54:55,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-06 00:54:55,584 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42276422764227645 [2022-12-06 00:54:55,585 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2022-12-06 00:54:55,585 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:54:55,586 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 49 transitions, 305 flow [2022-12-06 00:54:55,588 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 49 transitions, 305 flow [2022-12-06 00:54:55,588 INFO L188 LiptonReduction]: Number of co-enabled transitions 12 [2022-12-06 00:54:55,625 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:54:55,627 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-06 00:54:55,627 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 49 transitions, 305 flow [2022-12-06 00:54:55,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-06 00:54:55,627 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:54:55,627 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:54:55,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:54:55,627 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 00:54:55,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:54:55,628 INFO L85 PathProgramCache]: Analyzing trace with hash -92244445, now seen corresponding path program 1 times [2022-12-06 00:54:55,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:54:55,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169781253] [2022-12-06 00:54:55,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:54:55,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:54:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:54:55,725 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-06 00:54:55,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:54:55,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169781253] [2022-12-06 00:54:55,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169781253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:54:55,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:54:55,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:54:55,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158210994] [2022-12-06 00:54:55,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:54:55,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:54:55,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:54:55,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:54:55,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:54:55,727 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 00:54:55,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 49 transitions, 305 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-06 00:54:55,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:54:55,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 00:54:55,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:54:55,861 INFO L130 PetriNetUnfolder]: 358/649 cut-off events. [2022-12-06 00:54:55,861 INFO L131 PetriNetUnfolder]: For 126/126 co-relation queries the response was YES. [2022-12-06 00:54:55,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2629 conditions, 649 events. 358/649 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2440 event pairs, 186 based on Foata normal form. 0/533 useless extension candidates. Maximal degree in co-relation 2274. Up to 630 conditions per place. [2022-12-06 00:54:55,866 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 46 selfloop transitions, 3 changer transitions 15/64 dead transitions. [2022-12-06 00:54:55,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 64 transitions, 522 flow [2022-12-06 00:54:55,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:54:55,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:54:55,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-12-06 00:54:55,868 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2022-12-06 00:54:55,869 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2022-12-06 00:54:55,870 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:54:55,871 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 64 transitions, 522 flow [2022-12-06 00:54:55,875 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 64 transitions, 522 flow [2022-12-06 00:54:55,875 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 00:54:55,922 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:54:55,923 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-06 00:54:55,923 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 64 transitions, 526 flow [2022-12-06 00:54:55,925 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-06 00:54:55,925 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:54:55,925 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:54:55,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:54:55,925 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 00:54:55,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:54:55,926 INFO L85 PathProgramCache]: Analyzing trace with hash -676744799, now seen corresponding path program 1 times [2022-12-06 00:54:55,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:54:55,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833790195] [2022-12-06 00:54:55,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:54:55,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:54:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:54:56,074 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-06 00:54:56,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:54:56,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833790195] [2022-12-06 00:54:56,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833790195] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:54:56,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812930748] [2022-12-06 00:54:56,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:54:56,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:54:56,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:54:56,079 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-06 00:54:56,114 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-06 00:54:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:54:56,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 00:54:56,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:54:56,288 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-06 00:54:56,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:54:56,325 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-06 00:54:56,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812930748] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:54:56,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:54:56,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-06 00:54:56,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407759570] [2022-12-06 00:54:56,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:54:56,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:54:56,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:54:56,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:54:56,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:54:56,327 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 00:54:56,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 64 transitions, 526 flow. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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-06 00:54:56,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:54:56,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 00:54:56,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:54:56,617 INFO L130 PetriNetUnfolder]: 576/1037 cut-off events. [2022-12-06 00:54:56,617 INFO L131 PetriNetUnfolder]: For 207/207 co-relation queries the response was YES. [2022-12-06 00:54:56,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5193 conditions, 1037 events. 576/1037 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3681 event pairs, 102 based on Foata normal form. 0/883 useless extension candidates. Maximal degree in co-relation 4755. Up to 988 conditions per place. [2022-12-06 00:54:56,623 INFO L137 encePairwiseOnDemand]: 37/43 looper letters, 67 selfloop transitions, 10 changer transitions 24/101 dead transitions. [2022-12-06 00:54:56,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 101 transitions, 1017 flow [2022-12-06 00:54:56,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:54:56,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:54:56,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2022-12-06 00:54:56,627 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.375968992248062 [2022-12-06 00:54:56,628 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 5 predicate places. [2022-12-06 00:54:56,629 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:54:56,629 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 101 transitions, 1017 flow [2022-12-06 00:54:56,635 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 101 transitions, 1017 flow [2022-12-06 00:54:56,635 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 00:54:56,757 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:54:56,758 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-06 00:54:56,758 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 101 transitions, 1029 flow [2022-12-06 00:54:56,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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-06 00:54:56,758 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:54:56,759 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:54:56,768 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-06 00:54:56,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:54:56,960 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 00:54:56,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:54:56,961 INFO L85 PathProgramCache]: Analyzing trace with hash -776874107, now seen corresponding path program 2 times [2022-12-06 00:54:56,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:54:56,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852670855] [2022-12-06 00:54:56,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:54:56,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:54:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:54:57,155 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:54:57,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:54:57,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852670855] [2022-12-06 00:54:57,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852670855] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:54:57,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665080075] [2022-12-06 00:54:57,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 00:54:57,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:54:57,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:54:57,158 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-06 00:54:57,167 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-06 00:54:57,363 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 00:54:57,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:54:57,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 00:54:57,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:54:57,406 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:54:57,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:54:57,512 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:54:57,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665080075] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:54:57,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:54:57,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-06 00:54:57,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725625899] [2022-12-06 00:54:57,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:54:57,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 00:54:57,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:54:57,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 00:54:57,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-12-06 00:54:57,515 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 00:54:57,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 101 transitions, 1029 flow. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 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-06 00:54:57,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:54:57,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 00:54:57,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:54:57,973 INFO L130 PetriNetUnfolder]: 1080/2021 cut-off events. [2022-12-06 00:54:57,974 INFO L131 PetriNetUnfolder]: For 450/450 co-relation queries the response was YES. [2022-12-06 00:54:57,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12111 conditions, 2021 events. 1080/2021 cut-off events. For 450/450 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7535 event pairs, 102 based on Foata normal form. 0/1843 useless extension candidates. Maximal degree in co-relation 11590. Up to 1912 conditions per place. [2022-12-06 00:54:57,985 INFO L137 encePairwiseOnDemand]: 39/45 looper letters, 142 selfloop transitions, 22 changer transitions 54/218 dead transitions. [2022-12-06 00:54:57,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 218 transitions, 2635 flow [2022-12-06 00:54:57,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 00:54:57,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 00:54:57,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 187 transitions. [2022-12-06 00:54:57,987 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34629629629629627 [2022-12-06 00:54:57,988 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 16 predicate places. [2022-12-06 00:54:57,989 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:54:57,990 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 218 transitions, 2635 flow [2022-12-06 00:54:58,002 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 218 transitions, 2635 flow [2022-12-06 00:54:58,002 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 00:54:58,262 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:54:58,266 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 278 [2022-12-06 00:54:58,266 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 218 transitions, 2659 flow [2022-12-06 00:54:58,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 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-06 00:54:58,267 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:54:58,267 INFO L213 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:54:58,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 00:54:58,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:54:58,474 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 00:54:58,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:54:58,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1178684642, now seen corresponding path program 1 times [2022-12-06 00:54:58,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:54:58,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566508440] [2022-12-06 00:54:58,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:54:58,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:54:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:54:58,922 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:54:58,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:54:58,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566508440] [2022-12-06 00:54:58,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566508440] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:54:58,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60336774] [2022-12-06 00:54:58,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:54:58,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:54:58,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:54:58,924 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-06 00:54:58,927 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-06 00:54:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:54:59,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 00:54:59,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:54:59,193 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:54:59,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:54:59,409 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:54:59,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60336774] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:54:59,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:54:59,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-12-06 00:54:59,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844939186] [2022-12-06 00:54:59,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:54:59,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 00:54:59,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:54:59,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 00:54:59,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-12-06 00:54:59,412 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 00:54:59,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 218 transitions, 2659 flow. Second operand has 25 states, 25 states have (on average 5.0) internal successors, (125), 25 states have internal predecessors, (125), 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-06 00:54:59,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:54:59,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 00:54:59,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:55:00,530 INFO L130 PetriNetUnfolder]: 2172/4073 cut-off events. [2022-12-06 00:55:00,531 INFO L131 PetriNetUnfolder]: For 927/927 co-relation queries the response was YES. [2022-12-06 00:55:00,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28449 conditions, 4073 events. 2172/4073 cut-off events. For 927/927 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 15458 event pairs, 102 based on Foata normal form. 0/3763 useless extension candidates. Maximal degree in co-relation 27845. Up to 3914 conditions per place. [2022-12-06 00:55:00,560 INFO L137 encePairwiseOnDemand]: 42/48 looper letters, 292 selfloop transitions, 46 changer transitions 114/452 dead transitions. [2022-12-06 00:55:00,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 452 transitions, 6371 flow [2022-12-06 00:55:00,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 00:55:00,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 00:55:00,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 367 transitions. [2022-12-06 00:55:00,563 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3185763888888889 [2022-12-06 00:55:00,566 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 39 predicate places. [2022-12-06 00:55:00,574 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:55:00,575 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 452 transitions, 6371 flow [2022-12-06 00:55:00,616 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 452 transitions, 6371 flow [2022-12-06 00:55:00,616 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 00:55:01,083 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:55:01,084 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 518 [2022-12-06 00:55:01,085 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 452 transitions, 6419 flow [2022-12-06 00:55:01,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.0) internal successors, (125), 25 states have internal predecessors, (125), 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-06 00:55:01,085 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:55:01,085 INFO L213 CegarLoopForPetriNet]: trace histogram [22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:55:01,103 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-06 00:55:01,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:55:01,293 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 00:55:01,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:55:01,293 INFO L85 PathProgramCache]: Analyzing trace with hash -2068781846, now seen corresponding path program 2 times [2022-12-06 00:55:01,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:55:01,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775509801] [2022-12-06 00:55:01,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:55:01,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:55:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:55:02,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:55:02,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:55:02,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775509801] [2022-12-06 00:55:02,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775509801] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:55:02,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953173440] [2022-12-06 00:55:02,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 00:55:02,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:55:02,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:55:02,476 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-06 00:55:02,479 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-06 00:55:02,887 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 00:55:02,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:55:02,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 1263 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-06 00:55:02,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:55:03,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:55:03,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:55:03,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:55:03,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953173440] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:55:03,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:55:03,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-12-06 00:55:03,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476254657] [2022-12-06 00:55:03,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:55:03,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-12-06 00:55:03,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:55:03,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-12-06 00:55:03,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-12-06 00:55:03,749 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 00:55:03,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 452 transitions, 6419 flow. Second operand has 49 states, 49 states have (on average 5.020408163265306) internal successors, (246), 49 states have internal predecessors, (246), 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-06 00:55:03,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:55:03,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 00:55:03,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:55:06,802 INFO L130 PetriNetUnfolder]: 4356/8177 cut-off events. [2022-12-06 00:55:06,802 INFO L131 PetriNetUnfolder]: For 1894/1894 co-relation queries the response was YES. [2022-12-06 00:55:06,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65259 conditions, 8177 events. 4356/8177 cut-off events. For 1894/1894 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 31270 event pairs, 102 based on Foata normal form. 0/7603 useless extension candidates. Maximal degree in co-relation 64572. Up to 8018 conditions per place. [2022-12-06 00:55:06,890 INFO L137 encePairwiseOnDemand]: 48/54 looper letters, 592 selfloop transitions, 94 changer transitions 234/920 dead transitions. [2022-12-06 00:55:06,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 920 transitions, 14811 flow [2022-12-06 00:55:06,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-06 00:55:06,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2022-12-06 00:55:06,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 727 transitions. [2022-12-06 00:55:06,894 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2804783950617284 [2022-12-06 00:55:06,894 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 86 predicate places. [2022-12-06 00:55:06,896 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:55:06,896 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 920 transitions, 14811 flow [2022-12-06 00:55:06,990 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 920 transitions, 14811 flow [2022-12-06 00:55:06,990 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 00:55:07,850 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:55:07,851 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 957 [2022-12-06 00:55:07,851 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 920 transitions, 14907 flow [2022-12-06 00:55:07,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 5.020408163265306) internal successors, (246), 49 states have internal predecessors, (246), 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-06 00:55:07,852 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:55:07,852 INFO L213 CegarLoopForPetriNet]: trace histogram [46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:55:07,868 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-06 00:55:08,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:55:08,061 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 00:55:08,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:55:08,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1376356638, now seen corresponding path program 3 times [2022-12-06 00:55:08,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:55:08,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905925058] [2022-12-06 00:55:08,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:55:08,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:55:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:55:11,250 INFO L134 CoverageAnalysis]: Checked inductivity of 5221 backedges. 0 proven. 5221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:55:11,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:55:11,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905925058] [2022-12-06 00:55:11,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905925058] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:55:11,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433029673] [2022-12-06 00:55:11,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 00:55:11,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:55:11,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:55:11,253 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-06 00:55:11,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process Received shutdown request... [2022-12-06 01:09:15,252 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 01:09:15,252 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-06 01:09:16,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2022-12-06 01:09:16,453 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forcibly destroying the process [2022-12-06 01:09:16,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 137 [2022-12-06 01:09:16,486 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-06 01:09:16,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-12-06 01:09:16,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2022-12-06 01:09:16,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271980474] [2022-12-06 01:09:16,486 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-12-06 01:09:16,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-12-06 01:09:16,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:09:16,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-12-06 01:09:16,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-12-06 01:09:16,493 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-06 01:09:16,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 920 transitions, 14907 flow. Second operand has 49 states, 49 states have (on average 5.040816326530612) internal successors, (247), 49 states have internal predecessors, (247), 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-06 01:09:16,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:09:16,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-06 01:09:16,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:09:16,498 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 01:09:16,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 01:09:16,499 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-12-06 01:09:16,500 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-06 01:09:16,501 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 01:09:16,501 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 01:09:16,501 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-06 01:09:16,502 INFO L458 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2022-12-06 01:09:16,506 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 01:09:16,506 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 01:09:16,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 01:09:16 BasicIcfg [2022-12-06 01:09:16,508 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 01:09:16,509 INFO L158 Benchmark]: Toolchain (without parser) took 872943.69ms. Allocated memory was 206.6MB in the beginning and 649.1MB in the end (delta: 442.5MB). Free memory was 181.4MB in the beginning and 155.0MB in the end (delta: 26.4MB). Peak memory consumption was 469.4MB. Max. memory is 8.0GB. [2022-12-06 01:09:16,509 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 206.6MB. Free memory is still 183.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 01:09:16,509 INFO L158 Benchmark]: CACSL2BoogieTranslator took 722.41ms. Allocated memory is still 206.6MB. Free memory was 181.4MB in the beginning and 151.5MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-06 01:09:16,509 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.25ms. Allocated memory is still 206.6MB. Free memory was 151.5MB in the beginning and 148.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 01:09:16,510 INFO L158 Benchmark]: Boogie Preprocessor took 54.00ms. Allocated memory is still 206.6MB. Free memory was 148.3MB in the beginning and 146.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 01:09:16,510 INFO L158 Benchmark]: RCFGBuilder took 627.73ms. Allocated memory is still 206.6MB. Free memory was 146.2MB in the beginning and 125.8MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-06 01:09:16,510 INFO L158 Benchmark]: TraceAbstraction took 871457.59ms. Allocated memory was 206.6MB in the beginning and 649.1MB in the end (delta: 442.5MB). Free memory was 124.7MB in the beginning and 155.0MB in the end (delta: -30.2MB). Peak memory consumption was 412.8MB. Max. memory is 8.0GB. [2022-12-06 01:09:16,511 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 206.6MB. Free memory is still 183.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 722.41ms. Allocated memory is still 206.6MB. Free memory was 181.4MB in the beginning and 151.5MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 76.25ms. Allocated memory is still 206.6MB. Free memory was 151.5MB in the beginning and 148.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.00ms. Allocated memory is still 206.6MB. Free memory was 148.3MB in the beginning and 146.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 627.73ms. Allocated memory is still 206.6MB. Free memory was 146.2MB in the beginning and 125.8MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 871457.59ms. Allocated memory was 206.6MB in the beginning and 649.1MB in the end (delta: 442.5MB). Free memory was 124.7MB in the beginning and 155.0MB in the end (delta: -30.2MB). Peak memory consumption was 412.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.0s, 198 PlacesBefore, 46 PlacesAfterwards, 204 TransitionsBefore, 47 TransitionsAfterwards, 9810 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 58 TrivialYvCompositions, 97 ConcurrentYvCompositions, 5 ChoiceCompositions, 164 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6855, independent: 6649, independent conditional: 6649, independent unconditional: 0, dependent: 206, dependent conditional: 206, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6855, independent: 6649, independent conditional: 0, independent unconditional: 6649, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6855, independent: 6649, independent conditional: 0, independent unconditional: 6649, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6855, independent: 6649, independent conditional: 0, independent unconditional: 6649, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5796, independent: 5695, independent conditional: 0, independent unconditional: 5695, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5796, independent: 5681, independent conditional: 0, independent unconditional: 5681, dependent: 115, dependent conditional: 0, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 115, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 223, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 211, dependent conditional: 0, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6855, independent: 954, independent conditional: 0, independent unconditional: 954, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 5796, unknown conditional: 0, unknown unconditional: 5796] , Statistics on independence cache: Total cache size (in pairs): 9610, Positive cache size: 9509, Positive conditional cache size: 0, Positive unconditional cache size: 9509, Negative cache size: 101, Negative conditional cache size: 0, Negative unconditional cache size: 101, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 46 PlacesBefore, 42 PlacesAfterwards, 45 TransitionsBefore, 41 TransitionsAfterwards, 286 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 12 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 51 PlacesBefore, 51 PlacesAfterwards, 101 TransitionsBefore, 101 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 62 PlacesBefore, 62 PlacesAfterwards, 218 TransitionsBefore, 218 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 85 PlacesBefore, 85 PlacesAfterwards, 452 TransitionsBefore, 452 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 132 PlacesBefore, 132 PlacesAfterwards, 920 TransitionsBefore, 920 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 325 locations, 5 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: 871.3s, OverallIterations: 8, TraceHistogramMax: 46, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2527 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2527 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 299 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2036 IncrementalHoareTripleChecker+Invalid, 2336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 299 mSolverCounterUnsat, 0 mSDtfsCounter, 2036 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 601 GetRequests, 466 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14907occurred in iteration=7, InterpolantAutomatonStates: 98, 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.7s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 786 NumberOfCodeBlocks, 786 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1023 ConstructedInterpolants, 0 QuantifiedInterpolants, 2651 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2700 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 16 InterpolantComputations, 3 PerfectInterpolantSequences, 0/9562 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