/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 16:59:20,603 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 16:59:20,605 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 16:59:20,636 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 16:59:20,637 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 16:59:20,640 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 16:59:20,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 16:59:20,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 16:59:20,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 16:59:20,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 16:59:20,656 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 16:59:20,659 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 16:59:20,659 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 16:59:20,664 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 16:59:20,665 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 16:59:20,666 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 16:59:20,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 16:59:20,667 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 16:59:20,668 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 16:59:20,669 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 16:59:20,671 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 16:59:20,675 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 16:59:20,677 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 16:59:20,678 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 16:59:20,686 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 16:59:20,686 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 16:59:20,687 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 16:59:20,689 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 16:59:20,689 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 16:59:20,690 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 16:59:20,690 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 16:59:20,692 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 16:59:20,693 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 16:59:20,693 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 16:59:20,694 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 16:59:20,694 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 16:59:20,695 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 16:59:20,695 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 16:59:20,695 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 16:59:20,696 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 16:59:20,697 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 16:59:20,697 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-06 16:59:20,731 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 16:59:20,731 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 16:59:20,732 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-06 16:59:20,732 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-06 16:59:20,733 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 16:59:20,733 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 16:59:20,733 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 16:59:20,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 16:59:20,734 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 16:59:20,734 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 16:59:20,734 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 16:59:20,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 16:59:20,734 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 16:59:20,734 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 16:59:20,734 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 16:59:20,734 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 16:59:20,735 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 16:59:20,735 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 16:59:20,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 16:59:20,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 16:59:20,735 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 16:59:20,735 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 16:59:20,736 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 16:59:20,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:59:20,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 16:59:20,736 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 16:59:20,736 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 16:59:20,736 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 16:59:20,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 16:59:20,737 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-06 16:59:20,737 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-06 16:59:20,737 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 16:59:21,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 16:59:21,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 16:59:21,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 16:59:21,101 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 16:59:21,102 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 16:59:21,103 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2022-12-06 16:59:22,317 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 16:59:22,541 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 16:59:22,542 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2022-12-06 16:59:22,549 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44d4babea/6aa896624b12482d99a2fe088cad90e7/FLAGc7e8aa3e8 [2022-12-06 16:59:22,570 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44d4babea/6aa896624b12482d99a2fe088cad90e7 [2022-12-06 16:59:22,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 16:59:22,575 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 16:59:22,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 16:59:22,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 16:59:22,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 16:59:22,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:59:22" (1/1) ... [2022-12-06 16:59:22,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17343458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:22, skipping insertion in model container [2022-12-06 16:59:22,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:59:22" (1/1) ... [2022-12-06 16:59:22,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 16:59:22,601 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 16:59:22,770 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-exp2x3.wvr.c[2237,2250] [2022-12-06 16:59:22,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:59:22,784 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 16:59:22,820 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-exp2x3.wvr.c[2237,2250] [2022-12-06 16:59:22,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:59:22,835 INFO L208 MainTranslator]: Completed translation [2022-12-06 16:59:22,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:22 WrapperNode [2022-12-06 16:59:22,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 16:59:22,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 16:59:22,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 16:59:22,838 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 16:59:22,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:22" (1/1) ... [2022-12-06 16:59:22,857 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:22" (1/1) ... [2022-12-06 16:59:22,881 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2022-12-06 16:59:22,881 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 16:59:22,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 16:59:22,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 16:59:22,882 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 16:59:22,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:22" (1/1) ... [2022-12-06 16:59:22,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:22" (1/1) ... [2022-12-06 16:59:22,894 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:22" (1/1) ... [2022-12-06 16:59:22,895 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:22" (1/1) ... [2022-12-06 16:59:22,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:22" (1/1) ... [2022-12-06 16:59:22,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:22" (1/1) ... [2022-12-06 16:59:22,904 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:22" (1/1) ... [2022-12-06 16:59:22,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:22" (1/1) ... [2022-12-06 16:59:22,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 16:59:22,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 16:59:22,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 16:59:22,907 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 16:59:22,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:22" (1/1) ... [2022-12-06 16:59:22,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:59:22,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:59:22,941 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 16:59:22,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 16:59:22,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 16:59:22,975 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 16:59:22,975 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 16:59:22,975 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 16:59:22,975 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 16:59:22,975 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 16:59:22,975 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 16:59:22,975 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 16:59:22,976 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 16:59:22,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 16:59:22,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 16:59:22,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 16:59:22,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 16:59:22,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 16:59:22,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 16:59:22,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 16:59:22,978 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 16:59:23,114 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 16:59:23,121 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 16:59:23,315 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 16:59:23,322 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 16:59:23,322 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 16:59:23,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:59:23 BoogieIcfgContainer [2022-12-06 16:59:23,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 16:59:23,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 16:59:23,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 16:59:23,329 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 16:59:23,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:59:22" (1/3) ... [2022-12-06 16:59:23,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a90053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:59:23, skipping insertion in model container [2022-12-06 16:59:23,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:22" (2/3) ... [2022-12-06 16:59:23,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a90053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:59:23, skipping insertion in model container [2022-12-06 16:59:23,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:59:23" (3/3) ... [2022-12-06 16:59:23,331 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2022-12-06 16:59:23,346 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 16:59:23,346 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 16:59:23,346 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 16:59:23,455 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-06 16:59:23,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 118 transitions, 268 flow [2022-12-06 16:59:23,559 INFO L130 PetriNetUnfolder]: 10/114 cut-off events. [2022-12-06 16:59:23,559 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 16:59:23,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 114 events. 10/114 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-12-06 16:59:23,565 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 118 transitions, 268 flow [2022-12-06 16:59:23,568 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 102 transitions, 228 flow [2022-12-06 16:59:23,578 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 16:59:23,584 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;@72542c96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 16:59:23,584 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 16:59:23,626 INFO L130 PetriNetUnfolder]: 10/101 cut-off events. [2022-12-06 16:59:23,626 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 16:59:23,627 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:59:23,635 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:59:23,636 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:59:23,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:59:23,640 INFO L85 PathProgramCache]: Analyzing trace with hash -960369813, now seen corresponding path program 1 times [2022-12-06 16:59:23,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:59:23,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466813022] [2022-12-06 16:59:23,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:59:23,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:59:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:59:24,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:59:24,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:59:24,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466813022] [2022-12-06 16:59:24,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466813022] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:59:24,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:59:24,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:59:24,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810736368] [2022-12-06 16:59:24,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:59:24,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:59:24,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:59:24,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:59:24,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:59:24,969 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 118 [2022-12-06 16:59:24,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 102 transitions, 228 flow. Second operand has 7 states, 7 states have (on average 77.0) internal successors, (539), 7 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:59:24,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:59:24,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 118 [2022-12-06 16:59:24,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:59:25,514 INFO L130 PetriNetUnfolder]: 895/1611 cut-off events. [2022-12-06 16:59:25,515 INFO L131 PetriNetUnfolder]: For 411/503 co-relation queries the response was YES. [2022-12-06 16:59:25,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3092 conditions, 1611 events. 895/1611 cut-off events. For 411/503 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 7995 event pairs, 544 based on Foata normal form. 3/1140 useless extension candidates. Maximal degree in co-relation 2279. Up to 796 conditions per place. [2022-12-06 16:59:25,536 INFO L137 encePairwiseOnDemand]: 100/118 looper letters, 47 selfloop transitions, 7 changer transitions 7/119 dead transitions. [2022-12-06 16:59:25,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 119 transitions, 405 flow [2022-12-06 16:59:25,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 16:59:25,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 16:59:25,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 730 transitions. [2022-12-06 16:59:25,555 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.687382297551789 [2022-12-06 16:59:25,559 INFO L294 CegarLoopForPetriNet]: 105 programPoint places, 8 predicate places. [2022-12-06 16:59:25,559 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 119 transitions, 405 flow [2022-12-06 16:59:25,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.0) internal successors, (539), 7 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:59:25,560 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:59:25,561 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:59:25,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 16:59:25,561 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:59:25,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:59:25,562 INFO L85 PathProgramCache]: Analyzing trace with hash -172963614, now seen corresponding path program 1 times [2022-12-06 16:59:25,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:59:25,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251385631] [2022-12-06 16:59:25,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:59:25,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:59:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:59:25,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:59:25,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:59:25,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251385631] [2022-12-06 16:59:25,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251385631] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 16:59:25,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096008982] [2022-12-06 16:59:25,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:59:25,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:59:25,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:59:25,879 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 16:59:25,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 16:59:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:59:25,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 16:59:25,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 16:59:26,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:59:26,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 16:59:26,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:59:26,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096008982] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 16:59:26,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 16:59:26,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-06 16:59:26,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568265483] [2022-12-06 16:59:26,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 16:59:26,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 16:59:26,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:59:26,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 16:59:26,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-06 16:59:26,480 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 118 [2022-12-06 16:59:26,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 119 transitions, 405 flow. Second operand has 10 states, 10 states have (on average 81.1) internal successors, (811), 10 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:59:26,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:59:26,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 118 [2022-12-06 16:59:26,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:59:27,209 INFO L130 PetriNetUnfolder]: 1719/3051 cut-off events. [2022-12-06 16:59:27,209 INFO L131 PetriNetUnfolder]: For 1581/11113 co-relation queries the response was YES. [2022-12-06 16:59:27,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7948 conditions, 3051 events. 1719/3051 cut-off events. For 1581/11113 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17835 event pairs, 398 based on Foata normal form. 12/2243 useless extension candidates. Maximal degree in co-relation 7254. Up to 1981 conditions per place. [2022-12-06 16:59:27,239 INFO L137 encePairwiseOnDemand]: 104/118 looper letters, 109 selfloop transitions, 22 changer transitions 9/204 dead transitions. [2022-12-06 16:59:27,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 204 transitions, 1103 flow [2022-12-06 16:59:27,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 16:59:27,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 16:59:27,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1195 transitions. [2022-12-06 16:59:27,243 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7233656174334141 [2022-12-06 16:59:27,243 INFO L294 CegarLoopForPetriNet]: 105 programPoint places, 21 predicate places. [2022-12-06 16:59:27,243 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 204 transitions, 1103 flow [2022-12-06 16:59:27,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 81.1) internal successors, (811), 10 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:59:27,244 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:59:27,244 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:59:27,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 16:59:27,451 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-06 16:59:27,451 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:59:27,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:59:27,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1039506410, now seen corresponding path program 2 times [2022-12-06 16:59:27,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:59:27,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315966938] [2022-12-06 16:59:27,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:59:27,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:59:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:59:27,815 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-06 16:59:27,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:59:27,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315966938] [2022-12-06 16:59:27,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315966938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:59:27,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:59:27,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:59:27,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768332980] [2022-12-06 16:59:27,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:59:27,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:59:27,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:59:27,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:59:27,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:59:27,819 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 118 [2022-12-06 16:59:27,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 204 transitions, 1103 flow. Second operand has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:59:27,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:59:27,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 118 [2022-12-06 16:59:27,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:59:28,286 INFO L130 PetriNetUnfolder]: 1604/2986 cut-off events. [2022-12-06 16:59:28,286 INFO L131 PetriNetUnfolder]: For 2653/13009 co-relation queries the response was YES. [2022-12-06 16:59:28,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9814 conditions, 2986 events. 1604/2986 cut-off events. For 2653/13009 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 17895 event pairs, 289 based on Foata normal form. 49/2302 useless extension candidates. Maximal degree in co-relation 7163. Up to 1922 conditions per place. [2022-12-06 16:59:28,315 INFO L137 encePairwiseOnDemand]: 106/118 looper letters, 138 selfloop transitions, 11 changer transitions 9/214 dead transitions. [2022-12-06 16:59:28,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 214 transitions, 1481 flow [2022-12-06 16:59:28,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 16:59:28,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 16:59:28,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 573 transitions. [2022-12-06 16:59:28,318 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6937046004842615 [2022-12-06 16:59:28,318 INFO L294 CegarLoopForPetriNet]: 105 programPoint places, 27 predicate places. [2022-12-06 16:59:28,319 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 214 transitions, 1481 flow [2022-12-06 16:59:28,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:59:28,319 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:59:28,319 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:59:28,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 16:59:28,320 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:59:28,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:59:28,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2138577782, now seen corresponding path program 1 times [2022-12-06 16:59:28,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:59:28,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91513781] [2022-12-06 16:59:28,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:59:28,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:59:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:59:28,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:59:28,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:59:28,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91513781] [2022-12-06 16:59:28,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91513781] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 16:59:28,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451592180] [2022-12-06 16:59:28,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:59:28,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:59:28,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:59:28,607 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 16:59:28,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 16:59:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:59:28,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 16:59:28,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 16:59:28,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:59:28,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 16:59:29,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:59:29,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451592180] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 16:59:29,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 16:59:29,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-06 16:59:29,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170663864] [2022-12-06 16:59:29,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 16:59:29,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 16:59:29,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:59:29,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 16:59:29,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-06 16:59:29,160 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 118 [2022-12-06 16:59:29,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 214 transitions, 1481 flow. Second operand has 10 states, 10 states have (on average 81.5) internal successors, (815), 10 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:59:29,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:59:29,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 118 [2022-12-06 16:59:29,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:59:30,092 INFO L130 PetriNetUnfolder]: 3260/5910 cut-off events. [2022-12-06 16:59:30,093 INFO L131 PetriNetUnfolder]: For 7034/33335 co-relation queries the response was YES. [2022-12-06 16:59:30,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23551 conditions, 5910 events. 3260/5910 cut-off events. For 7034/33335 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 40063 event pairs, 177 based on Foata normal form. 54/4772 useless extension candidates. Maximal degree in co-relation 16573. Up to 4298 conditions per place. [2022-12-06 16:59:30,194 INFO L137 encePairwiseOnDemand]: 104/118 looper letters, 357 selfloop transitions, 54 changer transitions 13/495 dead transitions. [2022-12-06 16:59:30,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 495 transitions, 4815 flow [2022-12-06 16:59:30,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 16:59:30,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 16:59:30,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1191 transitions. [2022-12-06 16:59:30,198 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7209443099273608 [2022-12-06 16:59:30,199 INFO L294 CegarLoopForPetriNet]: 105 programPoint places, 40 predicate places. [2022-12-06 16:59:30,199 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 495 transitions, 4815 flow [2022-12-06 16:59:30,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 81.5) internal successors, (815), 10 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:59:30,200 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:59:30,200 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:59:30,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 16:59:30,405 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-06 16:59:30,405 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:59:30,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:59:30,406 INFO L85 PathProgramCache]: Analyzing trace with hash 2005473776, now seen corresponding path program 2 times [2022-12-06 16:59:30,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:59:30,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472198074] [2022-12-06 16:59:30,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:59:30,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:59:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:59:30,611 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-06 16:59:30,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:59:30,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472198074] [2022-12-06 16:59:30,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472198074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:59:30,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:59:30,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:59:30,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835868417] [2022-12-06 16:59:30,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:59:30,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:59:30,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:59:30,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:59:30,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:59:30,623 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 118 [2022-12-06 16:59:30,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 495 transitions, 4815 flow. Second operand has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:59:30,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:59:30,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 118 [2022-12-06 16:59:30,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:59:31,422 INFO L130 PetriNetUnfolder]: 3026/5451 cut-off events. [2022-12-06 16:59:31,422 INFO L131 PetriNetUnfolder]: For 9565/42959 co-relation queries the response was YES. [2022-12-06 16:59:31,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25251 conditions, 5451 events. 3026/5451 cut-off events. For 9565/42959 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 36158 event pairs, 93 based on Foata normal form. 288/4691 useless extension candidates. Maximal degree in co-relation 17933. Up to 3956 conditions per place. [2022-12-06 16:59:31,474 INFO L137 encePairwiseOnDemand]: 105/118 looper letters, 505 selfloop transitions, 67 changer transitions 13/656 dead transitions. [2022-12-06 16:59:31,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 656 transitions, 7732 flow [2022-12-06 16:59:31,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 16:59:31,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 16:59:31,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 692 transitions. [2022-12-06 16:59:31,476 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7330508474576272 [2022-12-06 16:59:31,478 INFO L294 CegarLoopForPetriNet]: 105 programPoint places, 46 predicate places. [2022-12-06 16:59:31,478 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 656 transitions, 7732 flow [2022-12-06 16:59:31,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:59:31,479 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:59:31,479 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:59:31,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 16:59:31,480 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:59:31,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:59:31,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1769620368, now seen corresponding path program 1 times [2022-12-06 16:59:31,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:59:31,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108408598] [2022-12-06 16:59:31,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:59:31,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:59:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:59:31,699 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-06 16:59:31,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:59:31,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108408598] [2022-12-06 16:59:31,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108408598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:59:31,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:59:31,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:59:31,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353120178] [2022-12-06 16:59:31,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:59:31,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:59:31,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:59:31,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:59:31,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:59:31,706 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 118 [2022-12-06 16:59:31,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 656 transitions, 7732 flow. Second operand has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:59:31,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:59:31,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 118 [2022-12-06 16:59:31,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:59:32,610 INFO L130 PetriNetUnfolder]: 3001/5526 cut-off events. [2022-12-06 16:59:32,610 INFO L131 PetriNetUnfolder]: For 13355/49999 co-relation queries the response was YES. [2022-12-06 16:59:32,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28766 conditions, 5526 events. 3001/5526 cut-off events. For 13355/49999 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 37805 event pairs, 85 based on Foata normal form. 247/4741 useless extension candidates. Maximal degree in co-relation 20359. Up to 3961 conditions per place. [2022-12-06 16:59:32,677 INFO L137 encePairwiseOnDemand]: 104/118 looper letters, 570 selfloop transitions, 49 changer transitions 22/712 dead transitions. [2022-12-06 16:59:32,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 712 transitions, 9751 flow [2022-12-06 16:59:32,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 16:59:32,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 16:59:32,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 691 transitions. [2022-12-06 16:59:32,680 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7319915254237288 [2022-12-06 16:59:32,683 INFO L294 CegarLoopForPetriNet]: 105 programPoint places, 53 predicate places. [2022-12-06 16:59:32,683 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 712 transitions, 9751 flow [2022-12-06 16:59:32,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:59:32,683 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:59:32,683 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:59:32,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 16:59:32,684 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:59:32,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:59:32,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1479951438, now seen corresponding path program 2 times [2022-12-06 16:59:32,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:59:32,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849116839] [2022-12-06 16:59:32,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:59:32,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:59:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:59:32,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:59:32,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:59:32,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849116839] [2022-12-06 16:59:32,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849116839] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 16:59:32,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053566514] [2022-12-06 16:59:32,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 16:59:32,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:59:32,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:59:32,908 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 16:59:32,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 16:59:33,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 16:59:33,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 16:59:33,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 16:59:33,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 16:59:33,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:59:33,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 16:59:33,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:59:33,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053566514] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 16:59:33,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 16:59:33,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-06 16:59:33,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123588327] [2022-12-06 16:59:33,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 16:59:33,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 16:59:33,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:59:33,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 16:59:33,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-06 16:59:33,431 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 118 [2022-12-06 16:59:33,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 712 transitions, 9751 flow. Second operand has 10 states, 10 states have (on average 81.4) internal successors, (814), 10 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:59:33,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:59:33,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 118 [2022-12-06 16:59:33,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:59:34,599 INFO L130 PetriNetUnfolder]: 3751/6622 cut-off events. [2022-12-06 16:59:34,599 INFO L131 PetriNetUnfolder]: For 21582/86020 co-relation queries the response was YES. [2022-12-06 16:59:34,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39870 conditions, 6622 events. 3751/6622 cut-off events. For 21582/86020 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 45028 event pairs, 51 based on Foata normal form. 371/5809 useless extension candidates. Maximal degree in co-relation 27937. Up to 4998 conditions per place. [2022-12-06 16:59:34,669 INFO L137 encePairwiseOnDemand]: 104/118 looper letters, 809 selfloop transitions, 80 changer transitions 22/982 dead transitions. [2022-12-06 16:59:34,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 982 transitions, 15576 flow [2022-12-06 16:59:34,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:59:34,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:59:34,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1102 transitions. [2022-12-06 16:59:34,672 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7183833116036505 [2022-12-06 16:59:34,673 INFO L294 CegarLoopForPetriNet]: 105 programPoint places, 65 predicate places. [2022-12-06 16:59:34,673 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 982 transitions, 15576 flow [2022-12-06 16:59:34,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 81.4) internal successors, (814), 10 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:59:34,674 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:59:34,674 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:59:34,679 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-06 16:59:34,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:59:34,880 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:59:34,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:59:34,880 INFO L85 PathProgramCache]: Analyzing trace with hash -272144370, now seen corresponding path program 1 times [2022-12-06 16:59:34,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:59:34,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828594214] [2022-12-06 16:59:34,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:59:34,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:59:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:59:35,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:59:35,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:59:35,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828594214] [2022-12-06 16:59:35,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828594214] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 16:59:35,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793606768] [2022-12-06 16:59:35,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:59:35,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:59:35,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:59:35,102 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 16:59:35,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 16:59:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:59:35,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 16:59:35,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 16:59:35,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:59:35,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 16:59:35,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:59:35,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793606768] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 16:59:35,474 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 16:59:35,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-06 16:59:35,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581456706] [2022-12-06 16:59:35,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 16:59:35,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 16:59:35,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:59:35,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 16:59:35,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-06 16:59:35,477 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 118 [2022-12-06 16:59:35,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 982 transitions, 15576 flow. Second operand has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:59:35,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:59:35,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 118 [2022-12-06 16:59:35,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:59:37,177 INFO L130 PetriNetUnfolder]: 4904/8366 cut-off events. [2022-12-06 16:59:37,177 INFO L131 PetriNetUnfolder]: For 34180/150121 co-relation queries the response was YES. [2022-12-06 16:59:37,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57256 conditions, 8366 events. 4904/8366 cut-off events. For 34180/150121 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 58179 event pairs, 56 based on Foata normal form. 332/7247 useless extension candidates. Maximal degree in co-relation 40904. Up to 6620 conditions per place. [2022-12-06 16:59:37,341 INFO L137 encePairwiseOnDemand]: 104/118 looper letters, 1234 selfloop transitions, 172 changer transitions 23/1513 dead transitions. [2022-12-06 16:59:37,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 1513 transitions, 27273 flow [2022-12-06 16:59:37,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 16:59:37,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 16:59:37,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1192 transitions. [2022-12-06 16:59:37,347 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7215496368038741 [2022-12-06 16:59:37,349 INFO L294 CegarLoopForPetriNet]: 105 programPoint places, 78 predicate places. [2022-12-06 16:59:37,349 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 1513 transitions, 27273 flow [2022-12-06 16:59:37,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:59:37,350 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:59:37,350 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:59:37,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 16:59:37,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:59:37,556 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:59:37,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:59:37,557 INFO L85 PathProgramCache]: Analyzing trace with hash -742485817, now seen corresponding path program 1 times [2022-12-06 16:59:37,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:59:37,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819415534] [2022-12-06 16:59:37,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:59:37,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:59:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:59:38,362 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-06 16:59:38,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:59:38,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819415534] [2022-12-06 16:59:38,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819415534] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 16:59:38,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278915959] [2022-12-06 16:59:38,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:59:38,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:59:38,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:59:38,365 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 16:59:38,367 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-06 16:59:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:59:38,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 16:59:38,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:00:06,737 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-06 17:00:06,940 INFO L208 tifierPushTermWalker]: Run 20 iterations without descend maybe there is a nontermination bug. [2022-12-06 17:00:07,388 INFO L208 tifierPushTermWalker]: Run 30 iterations without descend maybe there is a nontermination bug. [2022-12-06 17:00:37,772 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-06 17:00:37,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:01:20,743 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-06 17:01:20,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278915959] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:01:20,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:01:20,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 28 [2022-12-06 17:01:20,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218680275] [2022-12-06 17:01:20,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:01:20,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 17:01:20,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:01:20,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 17:01:20,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=590, Unknown=10, NotChecked=0, Total=756 [2022-12-06 17:01:20,747 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 118 [2022-12-06 17:01:20,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 1513 transitions, 27273 flow. Second operand has 28 states, 28 states have (on average 73.53571428571429) internal successors, (2059), 28 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:01:20,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:01:20,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 118 [2022-12-06 17:01:20,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:01:23,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:01:25,697 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-06 17:01:26,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:01:28,944 WARN 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-06 17:01:33,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-06 17:01:35,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:01:43,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:01:46,129 WARN 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-06 17:01:47,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:02:04,594 WARN 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-06 17:02:13,967 WARN L233 SmtUtils]: Spent 5.80s on a formula simplification. DAG size of input: 78 DAG size of output: 24 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 17:02:16,237 WARN 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-06 17:02:18,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:02:20,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:02:22,174 WARN 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-06 17:02:28,978 WARN 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-06 17:02:31,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:02:33,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:02:36,303 WARN 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-06 17:02:38,327 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-06 17:02:40,333 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-06 17:02:42,337 WARN 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-06 17:02:44,341 WARN 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-06 17:02:46,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-06 17:02:57,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:03:00,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:03:13,032 WARN 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-06 17:03:15,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:03:17,116 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-06 17:03:19,126 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-06 17:03:20,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:03:23,117 WARN 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-06 17:03:25,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:03:27,798 WARN 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-06 17:03:29,894 WARN 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-06 17:03:53,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:03:55,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:04:00,070 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-06 17:04:07,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:04:09,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-06 17:04:11,609 WARN 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-06 17:04:15,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:04:30,802 WARN L233 SmtUtils]: Spent 10.94s on a formula simplification. DAG size of input: 89 DAG size of output: 23 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 17:04:32,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:04:35,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:04:37,119 WARN 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-06 17:04:39,127 WARN 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-06 17:04:47,914 WARN 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-06 17:04:53,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:04:55,844 WARN 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-06 17:04:58,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:05:06,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:05:08,077 WARN 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-06 17:05:10,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:05:46,824 WARN L233 SmtUtils]: Spent 29.14s on a formula simplification. DAG size of input: 73 DAG size of output: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 17:05:58,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:06:00,353 WARN 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-06 17:06:02,810 WARN 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-06 17:06:10,144 WARN 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-06 17:06:12,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:06:14,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-06 17:06:15,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:06:23,625 WARN 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-06 17:06:25,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-06 17:06:29,876 WARN 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-06 17:06:34,936 WARN 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-06 17:06:49,500 WARN L233 SmtUtils]: Spent 9.80s on a formula simplification. DAG size of input: 72 DAG size of output: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 17:06:55,842 WARN 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-06 17:06:57,849 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-06 17:06:59,857 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-06 17:07:01,862 WARN 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-06 17:07:03,868 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-06 17:07:05,874 WARN 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-06 17:07:19,736 WARN L233 SmtUtils]: Spent 7.64s on a formula simplification. DAG size of input: 54 DAG size of output: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 17:07:29,985 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-06 17:07:32,841 WARN 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-06 17:07:35,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:07:38,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:07:41,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:07:42,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:07:44,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:07:47,491 WARN 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-06 17:07:49,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:07:57,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:08:00,441 WARN 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-06 17:08:10,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:08:37,888 WARN L233 SmtUtils]: Spent 10.15s on a formula simplification. DAG size of input: 94 DAG size of output: 91 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 17:08:47,002 WARN 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-06 17:08:49,012 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-06 17:08:51,021 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-06 17:08:53,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:08:56,753 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-06 17:09:22,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:09:24,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:09:26,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:09:28,977 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-06 17:09:30,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:09:32,383 WARN 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-06 17:09:34,721 WARN 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-06 17:09:36,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:09:38,739 WARN 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-06 17:09:43,847 WARN 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-06 17:09:46,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:09:48,071 WARN 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-06 17:09:50,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:09:52,201 WARN 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-06 17:09:53,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:09:55,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:10:02,247 WARN 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-06 17:10:04,269 WARN 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-06 17:10:07,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:10:11,614 WARN 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-06 17:10:13,624 WARN 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-06 17:10:15,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:10:17,674 WARN 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-06 17:10:19,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:10:22,643 WARN 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-06 17:10:24,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-06 17:10:31,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:10:33,698 WARN 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-06 17:10:40,860 WARN 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-06 17:10:42,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-06 17:10:57,302 WARN 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-06 17:10:59,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:11:24,237 WARN L233 SmtUtils]: Spent 14.65s on a formula simplification. DAG size of input: 101 DAG size of output: 95 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 17:11:32,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:11:42,979 WARN 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-06 17:11:45,036 WARN 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-06 17:11:47,961 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-06 17:11:49,501 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-06 17:11:52,427 WARN 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-06 17:11:54,908 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-06 17:11:56,923 WARN 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-06 17:11:58,942 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-06 17:12:00,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:12:09,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-06 17:12:11,147 WARN 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-06 17:12:13,151 WARN 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-06 17:12:15,158 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-06 17:12:17,166 WARN 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-06 17:12:19,183 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-06 17:12:26,755 WARN 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-06 17:12:28,789 WARN 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-06 17:12:32,336 WARN 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-06 17:12:35,365 WARN 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-06 17:12:37,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:12:39,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-06 17:12:41,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:12:47,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:12:49,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:12:51,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:13:06,142 WARN L233 SmtUtils]: Spent 5.22s on a formula simplification. DAG size of input: 59 DAG size of output: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 17:13:16,598 INFO L130 PetriNetUnfolder]: 19928/34540 cut-off events. [2022-12-06 17:13:16,598 INFO L131 PetriNetUnfolder]: For 155365/1785688 co-relation queries the response was YES. [2022-12-06 17:13:16,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253788 conditions, 34540 events. 19928/34540 cut-off events. For 155365/1785688 co-relation queries the response was YES. Maximal size of possible extension queue 2035. Compared 305441 event pairs, 68 based on Foata normal form. 4894/34443 useless extension candidates. Maximal degree in co-relation 182884. Up to 27388 conditions per place. [2022-12-06 17:13:16,985 INFO L137 encePairwiseOnDemand]: 89/118 looper letters, 4110 selfloop transitions, 2530 changer transitions 85/6781 dead transitions. [2022-12-06 17:13:16,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 6781 transitions, 136142 flow [2022-12-06 17:13:16,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-12-06 17:13:16,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2022-12-06 17:13:16,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 6854 transitions. [2022-12-06 17:13:16,997 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6833499501495514 [2022-12-06 17:13:16,997 INFO L294 CegarLoopForPetriNet]: 105 programPoint places, 162 predicate places. [2022-12-06 17:13:16,998 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 6781 transitions, 136142 flow [2022-12-06 17:13:16,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 73.53571428571429) internal successors, (2059), 28 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:13:16,999 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:13:16,999 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 17:13:17,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-06 17:13:17,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:13:17,204 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 17:13:17,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:13:17,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1518873089, now seen corresponding path program 2 times [2022-12-06 17:13:17,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:13:17,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56495894] [2022-12-06 17:13:17,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:13:17,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:13:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:13:18,050 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-06 17:13:18,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:13:18,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56495894] [2022-12-06 17:13:18,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56495894] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:13:18,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450569304] [2022-12-06 17:13:18,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 17:13:18,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:13:18,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:13:18,052 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-06 17:13:18,055 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-06 17:13:19,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 17:13:19,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:13:19,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 17:13:19,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:13:43,885 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-06 17:13:44,134 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-06 17:13:44,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2022-12-06 17:13:45,302 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-06 17:13:45,304 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 17:13:45,309 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-06 17:13:45,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 17:13:45,321 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 17:13:45,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:13:45,510 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 91 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 9 for 3ms.. [2022-12-06 17:13:45,512 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 17:13:45,512 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 17:13:45,512 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 17:13:45,512 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 17:13:45,512 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1] [2022-12-06 17:13:45,515 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 17:13:45,515 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 17:13:45,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:13:45 BasicIcfg [2022-12-06 17:13:45,518 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 17:13:45,518 INFO L158 Benchmark]: Toolchain (without parser) took 862944.05ms. Allocated memory was 185.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 162.1MB in the beginning and 455.4MB in the end (delta: -293.3MB). Peak memory consumption was 980.4MB. Max. memory is 8.0GB. [2022-12-06 17:13:45,519 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 185.6MB. Free memory is still 162.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 17:13:45,519 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.78ms. Allocated memory is still 185.6MB. Free memory was 161.8MB in the beginning and 150.7MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 17:13:45,520 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.04ms. Allocated memory is still 185.6MB. Free memory was 150.7MB in the beginning and 149.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 17:13:45,520 INFO L158 Benchmark]: Boogie Preprocessor took 24.87ms. Allocated memory is still 185.6MB. Free memory was 149.2MB in the beginning and 147.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 17:13:45,520 INFO L158 Benchmark]: RCFGBuilder took 417.11ms. Allocated memory is still 185.6MB. Free memory was 147.6MB in the beginning and 133.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 17:13:45,520 INFO L158 Benchmark]: TraceAbstraction took 862192.21ms. Allocated memory was 185.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 132.4MB in the beginning and 455.4MB in the end (delta: -323.0MB). Peak memory consumption was 951.1MB. Max. memory is 8.0GB. [2022-12-06 17:13:45,521 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 185.6MB. Free memory is still 162.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 260.78ms. Allocated memory is still 185.6MB. Free memory was 161.8MB in the beginning and 150.7MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.04ms. Allocated memory is still 185.6MB. Free memory was 150.7MB in the beginning and 149.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.87ms. Allocated memory is still 185.6MB. Free memory was 149.2MB in the beginning and 147.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 417.11ms. Allocated memory is still 185.6MB. Free memory was 147.6MB in the beginning and 133.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 862192.21ms. Allocated memory was 185.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 132.4MB in the beginning and 455.4MB in the end (delta: -323.0MB). Peak memory consumption was 951.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 91 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 9 for 3ms.. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 91 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 9 for 3ms.. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 91 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 9 for 3ms.. - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 91 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 9 for 3ms.. - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 91 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 9 for 3ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 133 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 862.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 724.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 119 mSolverCounterUnknown, 1531 SdHoareTripleChecker+Valid, 355.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1531 mSDsluCounter, 500 SdHoareTripleChecker+Invalid, 353.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 349 mSDsCounter, 231 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4431 IncrementalHoareTripleChecker+Invalid, 4781 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 231 mSolverCounterUnsat, 151 mSDtfsCounter, 4431 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1061 GetRequests, 857 SyntacticMatches, 21 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3560 ImplicationChecksByTransitivity, 401.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136142occurred in iteration=9, InterpolantAutomatonStates: 172, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 106.9s InterpolantComputationTime, 1234 NumberOfCodeBlocks, 1234 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1657 ConstructedInterpolants, 0 QuantifiedInterpolants, 21884 SizeOfPredicates, 53 NumberOfNonLiveVariables, 1228 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 19 InterpolantComputations, 4 PerfectInterpolantSequences, 3/21 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown