/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-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 23:56:55,043 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 23:56:55,045 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 23:56:55,075 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 23:56:55,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 23:56:55,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 23:56:55,080 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 23:56:55,082 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 23:56:55,085 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 23:56:55,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 23:56:55,089 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 23:56:55,091 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 23:56:55,091 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 23:56:55,093 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 23:56:55,093 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 23:56:55,094 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 23:56:55,095 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 23:56:55,095 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 23:56:55,097 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 23:56:55,101 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 23:56:55,102 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 23:56:55,102 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 23:56:55,103 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 23:56:55,104 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 23:56:55,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 23:56:55,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 23:56:55,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 23:56:55,111 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 23:56:55,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 23:56:55,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 23:56:55,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 23:56:55,113 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 23:56:55,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 23:56:55,115 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 23:56:55,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 23:56:55,116 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 23:56:55,116 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 23:56:55,116 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 23:56:55,116 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 23:56:55,117 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 23:56:55,129 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 23:56:55,129 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-NoLbe.epf [2022-12-11 23:56:55,153 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 23:56:55,153 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 23:56:55,155 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 23:56:55,155 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 23:56:55,155 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 23:56:55,156 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 23:56:55,156 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 23:56:55,156 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 23:56:55,156 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 23:56:55,156 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 23:56:55,157 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 23:56:55,157 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 23:56:55,157 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 23:56:55,157 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 23:56:55,157 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 23:56:55,157 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 23:56:55,157 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 23:56:55,158 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 23:56:55,158 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 23:56:55,158 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 23:56:55,158 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 23:56:55,158 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 23:56:55,158 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 23:56:55,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 23:56:55,158 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 23:56:55,158 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 23:56:55,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 23:56:55,159 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 23:56:55,159 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 23:56:55,159 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 23:56:55,159 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 23:56:55,159 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-11 23:56:55,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 23:56:55,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 23:56:55,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 23:56:55,451 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 23:56:55,451 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 23:56:55,452 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2022-12-11 23:56:56,478 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 23:56:56,640 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 23:56:56,641 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2022-12-11 23:56:56,652 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/620db4f2e/b926a21f4630472ba1e6f6461c5f6551/FLAGd871b7413 [2022-12-11 23:56:56,665 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/620db4f2e/b926a21f4630472ba1e6f6461c5f6551 [2022-12-11 23:56:56,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 23:56:56,668 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 23:56:56,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 23:56:56,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 23:56:56,673 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 23:56:56,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 11:56:56" (1/1) ... [2022-12-11 23:56:56,674 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2baa1beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:56:56, skipping insertion in model container [2022-12-11 23:56:56,674 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 11:56:56" (1/1) ... [2022-12-11 23:56:56,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 23:56:56,694 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 23:56:56,833 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c[1849,1862] [2022-12-11 23:56:56,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 23:56:56,844 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 23:56:56,862 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c[1849,1862] [2022-12-11 23:56:56,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 23:56:56,900 INFO L208 MainTranslator]: Completed translation [2022-12-11 23:56:56,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:56:56 WrapperNode [2022-12-11 23:56:56,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 23:56:56,903 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 23:56:56,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 23:56:56,903 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 23:56:56,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:56:56" (1/1) ... [2022-12-11 23:56:56,914 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:56:56" (1/1) ... [2022-12-11 23:56:56,931 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 57 [2022-12-11 23:56:56,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 23:56:56,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 23:56:56,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 23:56:56,932 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 23:56:56,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:56:56" (1/1) ... [2022-12-11 23:56:56,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:56:56" (1/1) ... [2022-12-11 23:56:56,945 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:56:56" (1/1) ... [2022-12-11 23:56:56,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:56:56" (1/1) ... [2022-12-11 23:56:56,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:56:56" (1/1) ... [2022-12-11 23:56:56,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:56:56" (1/1) ... [2022-12-11 23:56:56,957 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:56:56" (1/1) ... [2022-12-11 23:56:56,957 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:56:56" (1/1) ... [2022-12-11 23:56:56,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 23:56:56,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 23:56:56,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 23:56:56,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 23:56:56,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:56:56" (1/1) ... [2022-12-11 23:56:56,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 23:56:56,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 23:56:56,997 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-11 23:56:57,037 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-11 23:56:57,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 23:56:57,059 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-11 23:56:57,059 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-11 23:56:57,060 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-11 23:56:57,060 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-11 23:56:57,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 23:56:57,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 23:56:57,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 23:56:57,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 23:56:57,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 23:56:57,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-11 23:56:57,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 23:56:57,061 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 23:56:57,140 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 23:56:57,142 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 23:56:57,305 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 23:56:57,309 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 23:56:57,310 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-11 23:56:57,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 11:56:57 BoogieIcfgContainer [2022-12-11 23:56:57,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 23:56:57,312 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 23:56:57,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 23:56:57,315 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 23:56:57,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 11:56:56" (1/3) ... [2022-12-11 23:56:57,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131b8b58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 11:56:57, skipping insertion in model container [2022-12-11 23:56:57,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:56:56" (2/3) ... [2022-12-11 23:56:57,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131b8b58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 11:56:57, skipping insertion in model container [2022-12-11 23:56:57,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 11:56:57" (3/3) ... [2022-12-11 23:56:57,316 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp1x3.wvr.c [2022-12-11 23:56:57,328 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 23:56:57,329 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-11 23:56:57,329 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 23:56:57,366 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-11 23:56:57,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 74 transitions, 164 flow [2022-12-11 23:56:57,421 INFO L130 PetriNetUnfolder]: 6/72 cut-off events. [2022-12-11 23:56:57,422 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-11 23:56:57,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 72 events. 6/72 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2022-12-11 23:56:57,425 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 74 transitions, 164 flow [2022-12-11 23:56:57,429 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 64 transitions, 140 flow [2022-12-11 23:56:57,436 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 23:56:57,440 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=PETRI_NET, 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;@79f88068, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 23:56:57,441 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-11 23:56:57,459 INFO L130 PetriNetUnfolder]: 6/63 cut-off events. [2022-12-11 23:56:57,459 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-11 23:56:57,460 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:56:57,460 INFO L214 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:56:57,461 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 23:56:57,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:56:57,464 INFO L85 PathProgramCache]: Analyzing trace with hash -232152941, now seen corresponding path program 1 times [2022-12-11 23:56:57,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:56:57,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214164075] [2022-12-11 23:56:57,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:56:57,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:56:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:56:58,011 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-11 23:56:58,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:56:58,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214164075] [2022-12-11 23:56:58,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214164075] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:56:58,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:56:58,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:56:58,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587198222] [2022-12-11 23:56:58,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:56:58,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:56:58,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:56:58,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:56:58,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:56:58,053 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 74 [2022-12-11 23:56:58,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 140 flow. Second operand has 7 states, 7 states have (on average 47.57142857142857) internal successors, (333), 7 states have internal predecessors, (333), 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-11 23:56:58,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:56:58,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 74 [2022-12-11 23:56:58,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:56:58,247 INFO L130 PetriNetUnfolder]: 31/143 cut-off events. [2022-12-11 23:56:58,247 INFO L131 PetriNetUnfolder]: For 43/55 co-relation queries the response was YES. [2022-12-11 23:56:58,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 143 events. 31/143 cut-off events. For 43/55 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 373 event pairs, 16 based on Foata normal form. 3/120 useless extension candidates. Maximal degree in co-relation 139. Up to 48 conditions per place. [2022-12-11 23:56:58,249 INFO L137 encePairwiseOnDemand]: 60/74 looper letters, 25 selfloop transitions, 5 changer transitions 7/73 dead transitions. [2022-12-11 23:56:58,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 73 transitions, 241 flow [2022-12-11 23:56:58,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 23:56:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 23:56:58,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 450 transitions. [2022-12-11 23:56:58,266 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6756756756756757 [2022-12-11 23:56:58,268 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 8 predicate places. [2022-12-11 23:56:58,268 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 73 transitions, 241 flow [2022-12-11 23:56:58,270 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 66 transitions, 210 flow [2022-12-11 23:56:58,270 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 210 flow [2022-12-11 23:56:58,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 47.57142857142857) internal successors, (333), 7 states have internal predecessors, (333), 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-11 23:56:58,273 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:56:58,273 INFO L214 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:56:58,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 23:56:58,274 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 23:56:58,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:56:58,275 INFO L85 PathProgramCache]: Analyzing trace with hash 885839328, now seen corresponding path program 1 times [2022-12-11 23:56:58,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:56:58,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868802845] [2022-12-11 23:56:58,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:56:58,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:56:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:56:58,518 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-11 23:56:58,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:56:58,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868802845] [2022-12-11 23:56:58,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868802845] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 23:56:58,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586185271] [2022-12-11 23:56:58,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:56:58,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 23:56:58,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 23:56:58,524 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-11 23:56:58,525 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-11 23:56:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:56:58,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-11 23:56:58,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 23:56:59,134 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-11 23:56:59,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 23:56:59,277 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-11 23:56:59,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586185271] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 23:56:59,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 23:56:59,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-12-11 23:56:59,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077283354] [2022-12-11 23:56:59,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 23:56:59,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-11 23:56:59,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:56:59,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-11 23:56:59,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-12-11 23:56:59,283 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 74 [2022-12-11 23:56:59,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 66 transitions, 210 flow. Second operand has 13 states, 13 states have (on average 46.0) internal successors, (598), 13 states have internal predecessors, (598), 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-11 23:56:59,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:56:59,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 74 [2022-12-11 23:56:59,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:56:59,608 INFO L130 PetriNetUnfolder]: 38/175 cut-off events. [2022-12-11 23:56:59,612 INFO L131 PetriNetUnfolder]: For 126/379 co-relation queries the response was YES. [2022-12-11 23:56:59,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 408 conditions, 175 events. 38/175 cut-off events. For 126/379 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 583 event pairs, 7 based on Foata normal form. 11/165 useless extension candidates. Maximal degree in co-relation 232. Up to 76 conditions per place. [2022-12-11 23:56:59,615 INFO L137 encePairwiseOnDemand]: 63/74 looper letters, 40 selfloop transitions, 16 changer transitions 0/90 dead transitions. [2022-12-11 23:56:59,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 90 transitions, 439 flow [2022-12-11 23:56:59,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 23:56:59,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 23:56:59,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 533 transitions. [2022-12-11 23:56:59,620 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6547911547911548 [2022-12-11 23:56:59,621 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 12 predicate places. [2022-12-11 23:56:59,621 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 90 transitions, 439 flow [2022-12-11 23:56:59,623 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 90 transitions, 439 flow [2022-12-11 23:56:59,623 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 90 transitions, 439 flow [2022-12-11 23:56:59,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.0) internal successors, (598), 13 states have internal predecessors, (598), 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-11 23:56:59,624 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:56:59,624 INFO L214 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:56:59,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-11 23:56:59,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 23:56:59,831 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 23:56:59,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:56:59,832 INFO L85 PathProgramCache]: Analyzing trace with hash -2128875790, now seen corresponding path program 2 times [2022-12-11 23:56:59,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:56:59,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082211310] [2022-12-11 23:56:59,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:56:59,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:56:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:57:00,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:57:00,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:57:00,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082211310] [2022-12-11 23:57:00,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082211310] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:57:00,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:57:00,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 23:57:00,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732728745] [2022-12-11 23:57:00,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:57:00,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 23:57:00,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:57:00,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 23:57:00,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-11 23:57:00,032 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 74 [2022-12-11 23:57:00,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 90 transitions, 439 flow. Second operand has 6 states, 6 states have (on average 46.666666666666664) internal successors, (280), 6 states have internal predecessors, (280), 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-11 23:57:00,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:57:00,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 74 [2022-12-11 23:57:00,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:57:00,132 INFO L130 PetriNetUnfolder]: 34/161 cut-off events. [2022-12-11 23:57:00,132 INFO L131 PetriNetUnfolder]: For 154/225 co-relation queries the response was YES. [2022-12-11 23:57:00,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 161 events. 34/161 cut-off events. For 154/225 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 508 event pairs, 5 based on Foata normal form. 7/153 useless extension candidates. Maximal degree in co-relation 271. Up to 66 conditions per place. [2022-12-11 23:57:00,136 INFO L137 encePairwiseOnDemand]: 65/74 looper letters, 42 selfloop transitions, 5 changer transitions 6/87 dead transitions. [2022-12-11 23:57:00,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 87 transitions, 524 flow [2022-12-11 23:57:00,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-11 23:57:00,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-11 23:57:00,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 295 transitions. [2022-12-11 23:57:00,137 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6644144144144144 [2022-12-11 23:57:00,138 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 17 predicate places. [2022-12-11 23:57:00,138 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 87 transitions, 524 flow [2022-12-11 23:57:00,140 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 81 transitions, 470 flow [2022-12-11 23:57:00,140 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 81 transitions, 470 flow [2022-12-11 23:57:00,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.666666666666664) internal successors, (280), 6 states have internal predecessors, (280), 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-11 23:57:00,140 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:57:00,141 INFO L214 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:57:00,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 23:57:00,141 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 23:57:00,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:57:00,141 INFO L85 PathProgramCache]: Analyzing trace with hash -635103912, now seen corresponding path program 1 times [2022-12-11 23:57:00,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:57:00,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168302697] [2022-12-11 23:57:00,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:57:00,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:57:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:57:00,318 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-11 23:57:00,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:57:00,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168302697] [2022-12-11 23:57:00,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168302697] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 23:57:00,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721162661] [2022-12-11 23:57:00,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:57:00,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 23:57:00,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 23:57:00,321 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-11 23:57:00,352 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-11 23:57:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:57:00,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-11 23:57:00,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 23:57:00,578 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-11 23:57:00,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 23:57:00,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:57:00,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721162661] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 23:57:00,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 23:57:00,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-12-11 23:57:00,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322817775] [2022-12-11 23:57:00,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 23:57:00,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-11 23:57:00,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:57:00,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-11 23:57:00,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-12-11 23:57:00,710 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 74 [2022-12-11 23:57:00,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 81 transitions, 470 flow. Second operand has 13 states, 13 states have (on average 45.92307692307692) internal successors, (597), 13 states have internal predecessors, (597), 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-11 23:57:00,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:57:00,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 74 [2022-12-11 23:57:00,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:57:00,924 INFO L130 PetriNetUnfolder]: 37/144 cut-off events. [2022-12-11 23:57:00,925 INFO L131 PetriNetUnfolder]: For 181/245 co-relation queries the response was YES. [2022-12-11 23:57:00,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 144 events. 37/144 cut-off events. For 181/245 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 348 event pairs, 0 based on Foata normal form. 11/143 useless extension candidates. Maximal degree in co-relation 353. Up to 79 conditions per place. [2022-12-11 23:57:00,926 INFO L137 encePairwiseOnDemand]: 63/74 looper letters, 42 selfloop transitions, 21 changer transitions 0/97 dead transitions. [2022-12-11 23:57:00,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 97 transitions, 727 flow [2022-12-11 23:57:00,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 23:57:00,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 23:57:00,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 519 transitions. [2022-12-11 23:57:00,928 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6375921375921376 [2022-12-11 23:57:00,929 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 26 predicate places. [2022-12-11 23:57:00,930 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 97 transitions, 727 flow [2022-12-11 23:57:00,933 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 97 transitions, 727 flow [2022-12-11 23:57:00,934 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 97 transitions, 727 flow [2022-12-11 23:57:00,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 45.92307692307692) internal successors, (597), 13 states have internal predecessors, (597), 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-11 23:57:00,934 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:57:00,935 INFO L214 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:57:00,941 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-11 23:57:01,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-12-11 23:57:01,141 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 23:57:01,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:57:01,142 INFO L85 PathProgramCache]: Analyzing trace with hash -571607107, now seen corresponding path program 1 times [2022-12-11 23:57:01,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:57:01,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613847788] [2022-12-11 23:57:01,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:57:01,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:57:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:57:01,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:57:01,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:57:01,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613847788] [2022-12-11 23:57:01,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613847788] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 23:57:01,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656484183] [2022-12-11 23:57:01,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:57:01,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 23:57:01,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 23:57:01,552 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-11 23:57:01,554 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-11 23:57:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:57:01,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-11 23:57:01,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 23:57:04,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:57:04,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 23:57:06,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:57:06,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656484183] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 23:57:06,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 23:57:06,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 12] total 24 [2022-12-11 23:57:06,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053915795] [2022-12-11 23:57:06,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 23:57:06,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-11 23:57:06,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:57:06,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-11 23:57:06,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=433, Unknown=1, NotChecked=0, Total=552 [2022-12-11 23:57:06,493 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 74 [2022-12-11 23:57:06,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 97 transitions, 727 flow. Second operand has 24 states, 24 states have (on average 45.208333333333336) internal successors, (1085), 24 states have internal predecessors, (1085), 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-11 23:57:06,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:57:06,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 74 [2022-12-11 23:57:06,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:57:15,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-11 23:57:21,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-11 23:57:25,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-11 23:57:27,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-11 23:57:30,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-11 23:57:32,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-11 23:57:35,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-11 23:57:37,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-11 23:57:50,781 INFO L130 PetriNetUnfolder]: 118/411 cut-off events. [2022-12-11 23:57:50,781 INFO L131 PetriNetUnfolder]: For 826/987 co-relation queries the response was YES. [2022-12-11 23:57:50,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1825 conditions, 411 events. 118/411 cut-off events. For 826/987 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2100 event pairs, 2 based on Foata normal form. 37/400 useless extension candidates. Maximal degree in co-relation 1338. Up to 260 conditions per place. [2022-12-11 23:57:50,784 INFO L137 encePairwiseOnDemand]: 60/74 looper letters, 93 selfloop transitions, 92 changer transitions 10/229 dead transitions. [2022-12-11 23:57:50,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 229 transitions, 2509 flow [2022-12-11 23:57:50,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-11 23:57:50,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-11 23:57:50,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1243 transitions. [2022-12-11 23:57:50,787 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.646049896049896 [2022-12-11 23:57:50,787 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 51 predicate places. [2022-12-11 23:57:50,787 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 229 transitions, 2509 flow [2022-12-11 23:57:50,790 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 219 transitions, 2380 flow [2022-12-11 23:57:50,790 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 219 transitions, 2380 flow [2022-12-11 23:57:50,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 45.208333333333336) internal successors, (1085), 24 states have internal predecessors, (1085), 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-11 23:57:50,791 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:57:50,791 INFO L214 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:57:50,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-11 23:57:50,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 23:57:50,992 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 23:57:50,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:57:50,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1910943351, now seen corresponding path program 2 times [2022-12-11 23:57:50,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:57:50,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585027781] [2022-12-11 23:57:50,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:57:50,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:57:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:57:51,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:57:51,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:57:51,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585027781] [2022-12-11 23:57:51,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585027781] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 23:57:51,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704434652] [2022-12-11 23:57:51,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-11 23:57:51,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 23:57:51,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 23:57:51,408 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-11 23:57:51,414 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-11 23:57:51,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-11 23:57:51,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 23:57:51,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-11 23:57:51,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 23:57:54,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:57:54,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 23:57:59,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:57:59,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704434652] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 23:57:59,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 23:57:59,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 12] total 24 [2022-12-11 23:57:59,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833855079] [2022-12-11 23:57:59,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 23:57:59,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-11 23:57:59,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:57:59,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-11 23:57:59,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2022-12-11 23:57:59,420 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 74 [2022-12-11 23:57:59,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 219 transitions, 2380 flow. Second operand has 24 states, 24 states have (on average 45.208333333333336) internal successors, (1085), 24 states have internal predecessors, (1085), 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-11 23:57:59,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:57:59,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 74 [2022-12-11 23:57:59,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:58:08,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-11 23:58:10,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-11 23:58:13,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-11 23:58:15,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-11 23:58:22,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-11 23:58:25,024 INFO L130 PetriNetUnfolder]: 180/569 cut-off events. [2022-12-11 23:58:25,025 INFO L131 PetriNetUnfolder]: For 1309/1566 co-relation queries the response was YES. [2022-12-11 23:58:25,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3031 conditions, 569 events. 180/569 cut-off events. For 1309/1566 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3302 event pairs, 7 based on Foata normal form. 52/543 useless extension candidates. Maximal degree in co-relation 2573. Up to 388 conditions per place. [2022-12-11 23:58:25,028 INFO L137 encePairwiseOnDemand]: 60/74 looper letters, 136 selfloop transitions, 153 changer transitions 7/330 dead transitions. [2022-12-11 23:58:25,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 330 transitions, 4337 flow [2022-12-11 23:58:25,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-11 23:58:25,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-11 23:58:25,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1098 transitions. [2022-12-11 23:58:25,031 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.645123384253819 [2022-12-11 23:58:25,031 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 70 predicate places. [2022-12-11 23:58:25,031 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 330 transitions, 4337 flow [2022-12-11 23:58:25,039 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 323 transitions, 4236 flow [2022-12-11 23:58:25,039 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 323 transitions, 4236 flow [2022-12-11 23:58:25,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 45.208333333333336) internal successors, (1085), 24 states have internal predecessors, (1085), 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-11 23:58:25,040 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:58:25,040 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:58:25,060 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-11 23:58:25,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 23:58:25,245 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 23:58:25,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:58:25,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1664800602, now seen corresponding path program 3 times [2022-12-11 23:58:25,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:58:25,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707751631] [2022-12-11 23:58:25,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:58:25,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:58:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:58:27,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:58:27,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:58:27,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707751631] [2022-12-11 23:58:27,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707751631] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 23:58:27,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343167875] [2022-12-11 23:58:27,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-11 23:58:27,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 23:58:27,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 23:58:27,130 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-11 23:58:27,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-11 23:58:44,881 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-11 23:58:44,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 23:58:44,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-11 23:58:44,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 23:59:29,184 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:59:29,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 00:01:24,260 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 00:01:24,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343167875] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 00:01:24,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 00:01:24,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 14] total 32 [2022-12-12 00:01:24,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431852959] [2022-12-12 00:01:24,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 00:01:24,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-12 00:01:24,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 00:01:24,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-12 00:01:24,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=800, Unknown=36, NotChecked=0, Total=992 [2022-12-12 00:01:24,262 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 74 [2022-12-12 00:01:24,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 323 transitions, 4236 flow. Second operand has 32 states, 32 states have (on average 44.90625) internal successors, (1437), 32 states have internal predecessors, (1437), 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-12 00:01:24,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 00:01:24,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 74 [2022-12-12 00:01:24,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 00:01:27,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:01:35,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:01:37,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:01:45,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:01:55,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:02:22,128 WARN L233 SmtUtils]: Spent 16.91s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 00:02:24,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:02:26,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:02:28,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:02:30,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:02:35,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:04:48,480 WARN L233 SmtUtils]: Spent 2.07m on a formula simplification. DAG size of input: 93 DAG size of output: 89 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 00:04:50,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:04:52,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:04:54,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:05:20,623 WARN L233 SmtUtils]: Spent 16.31s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 00:05:22,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:05:24,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:05:25,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:05:27,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:05:30,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:05:32,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:05:34,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:05:36,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:05:38,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:05:40,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:05:42,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:05:54,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:05:56,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:05:58,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:06:06,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:06:08,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:06:23,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:06:25,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:06:27,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:06:29,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:06:31,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:06:35,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:06:37,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:06:38,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:06:40,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:06:42,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:06:44,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:06:46,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:06:48,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:06:50,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:06:52,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:07:17,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:07:20,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:07:22,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:07:25,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:07:27,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:07:29,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:07:31,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:07:33,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:07:36,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:07:39,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:07:41,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:07:43,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:07:45,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:07:48,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:07:50,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:07:52,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:07:54,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:07:56,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:07:58,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:08:00,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:08:02,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:08:04,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:08:06,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:08:08,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:08:11,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:08:13,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:09:01,455 WARN L233 SmtUtils]: Spent 12.14s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 00:09:03,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:09:05,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:09:07,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:09:10,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:09:12,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:09:14,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:09:29,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:09:33,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:09:35,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:09:37,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:09:39,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:09:41,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:09:43,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:09:45,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:09:47,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:09:50,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:09:52,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:09:54,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:09:56,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:09:58,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:10:00,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:10:02,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:10:04,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:10:06,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:10:08,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:10:09,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:10:11,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:10:14,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:10:16,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:10:18,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:10:21,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:10:23,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:10:25,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:10:27,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:10:29,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:10:31,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:10:34,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:10:36,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:10:39,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:10:41,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:10:43,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:10:45,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:10:47,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 00:10:49,088 INFO L130 PetriNetUnfolder]: 257/901 cut-off events. [2022-12-12 00:10:49,088 INFO L131 PetriNetUnfolder]: For 3127/4418 co-relation queries the response was YES. [2022-12-12 00:10:49,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5191 conditions, 901 events. 257/901 cut-off events. For 3127/4418 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 6394 event pairs, 3 based on Foata normal form. 90/885 useless extension candidates. Maximal degree in co-relation 3407. Up to 586 conditions per place. [2022-12-12 00:10:49,096 INFO L137 encePairwiseOnDemand]: 59/74 looper letters, 195 selfloop transitions, 245 changer transitions 8/482 dead transitions. [2022-12-12 00:10:49,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 482 transitions, 7463 flow [2022-12-12 00:10:49,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-12 00:10:49,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-12 00:10:49,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 1532 transitions. [2022-12-12 00:10:49,105 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6469594594594594 [2022-12-12 00:10:49,106 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 98 predicate places. [2022-12-12 00:10:49,106 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 482 transitions, 7463 flow [2022-12-12 00:10:49,113 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 474 transitions, 7326 flow [2022-12-12 00:10:49,114 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 474 transitions, 7326 flow [2022-12-12 00:10:49,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 44.90625) internal successors, (1437), 32 states have internal predecessors, (1437), 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-12 00:10:49,115 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 00:10:49,115 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 00:10:49,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-12 00:10:49,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 00:10:49,322 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 00:10:49,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 00:10:49,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1927585110, now seen corresponding path program 4 times [2022-12-12 00:10:49,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 00:10:49,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803169799] [2022-12-12 00:10:49,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:10:49,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 00:10:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:10:49,540 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 00:10:49,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 00:10:49,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803169799] [2022-12-12 00:10:49,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803169799] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 00:10:49,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162541424] [2022-12-12 00:10:49,541 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-12 00:10:49,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 00:10:49,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 00:10:49,542 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 00:10:49,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-12 00:10:50,186 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-12 00:10:50,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 00:10:50,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-12 00:10:50,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 00:11:02,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 00:11:02,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2022-12-12 00:11:36,319 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-12 00:11:36,319 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 00:11:37,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-12 00:11:37,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Cannot interrupt operation gracefully because timeout expired. Forcing shutdown