/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-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 22:04:27,845 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 22:04:27,847 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 22:04:27,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 22:04:27,888 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 22:04:27,890 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 22:04:27,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 22:04:27,897 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 22:04:27,900 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 22:04:27,904 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 22:04:27,905 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 22:04:27,907 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 22:04:27,907 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 22:04:27,909 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 22:04:27,910 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 22:04:27,913 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 22:04:27,913 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 22:04:27,914 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 22:04:27,916 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 22:04:27,921 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 22:04:27,922 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 22:04:27,923 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 22:04:27,924 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 22:04:27,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 22:04:27,931 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 22:04:27,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 22:04:27,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 22:04:27,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 22:04:27,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 22:04:27,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 22:04:27,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 22:04:27,939 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 22:04:27,940 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 22:04:27,941 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 22:04:27,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 22:04:27,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 22:04:27,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 22:04:27,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 22:04:27,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 22:04:27,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 22:04:27,944 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 22:04:27,945 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-SemanticLbe.epf [2022-12-12 22:04:27,974 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 22:04:27,974 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 22:04:27,976 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 22:04:27,976 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 22:04:27,976 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 22:04:27,977 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 22:04:27,977 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 22:04:27,977 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 22:04:27,978 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 22:04:27,978 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 22:04:27,978 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 22:04:27,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 22:04:27,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 22:04:27,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 22:04:27,979 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 22:04:27,979 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 22:04:27,980 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 22:04:27,980 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 22:04:27,980 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 22:04:27,980 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 22:04:27,980 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 22:04:27,980 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 22:04:27,981 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 22:04:27,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 22:04:27,981 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 22:04:27,981 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 22:04:27,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 22:04:27,981 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 22:04:27,982 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 22:04:27,982 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 22:04:27,982 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-12 22:04:28,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 22:04:28,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 22:04:28,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 22:04:28,315 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 22:04:28,316 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 22:04:28,317 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2022-12-12 22:04:29,349 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 22:04:29,576 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 22:04:29,577 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2022-12-12 22:04:29,582 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67085668f/c18b6ac7a0b64d8991536887cbc24b59/FLAG5446db85b [2022-12-12 22:04:29,594 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67085668f/c18b6ac7a0b64d8991536887cbc24b59 [2022-12-12 22:04:29,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 22:04:29,597 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 22:04:29,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 22:04:29,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 22:04:29,600 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 22:04:29,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 10:04:29" (1/1) ... [2022-12-12 22:04:29,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@273ce1b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 10:04:29, skipping insertion in model container [2022-12-12 22:04:29,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 10:04:29" (1/1) ... [2022-12-12 22:04:29,607 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 22:04:29,624 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 22:04:29,757 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-exp2x4.wvr.c[2309,2322] [2022-12-12 22:04:29,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 22:04:29,775 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 22:04:29,806 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-exp2x4.wvr.c[2309,2322] [2022-12-12 22:04:29,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 22:04:29,820 INFO L208 MainTranslator]: Completed translation [2022-12-12 22:04:29,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 10:04:29 WrapperNode [2022-12-12 22:04:29,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 22:04:29,823 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 22:04:29,824 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 22:04:29,824 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 22:04:29,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 10:04:29" (1/1) ... [2022-12-12 22:04:29,842 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 10:04:29" (1/1) ... [2022-12-12 22:04:29,866 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2022-12-12 22:04:29,867 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 22:04:29,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 22:04:29,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 22:04:29,867 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 22:04:29,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 10:04:29" (1/1) ... [2022-12-12 22:04:29,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 10:04:29" (1/1) ... [2022-12-12 22:04:29,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 10:04:29" (1/1) ... [2022-12-12 22:04:29,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 10:04:29" (1/1) ... [2022-12-12 22:04:29,894 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 10:04:29" (1/1) ... [2022-12-12 22:04:29,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 10:04:29" (1/1) ... [2022-12-12 22:04:29,898 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 10:04:29" (1/1) ... [2022-12-12 22:04:29,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 10:04:29" (1/1) ... [2022-12-12 22:04:29,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 22:04:29,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 22:04:29,902 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 22:04:29,902 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 22:04:29,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 10:04:29" (1/1) ... [2022-12-12 22:04:29,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 22:04:29,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 22:04:29,936 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-12 22:04:29,962 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-12 22:04:29,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 22:04:29,979 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-12 22:04:29,979 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-12 22:04:29,979 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-12 22:04:29,980 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-12 22:04:29,980 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-12 22:04:29,980 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-12 22:04:29,980 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-12 22:04:29,980 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-12 22:04:29,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 22:04:29,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 22:04:29,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 22:04:29,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 22:04:29,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 22:04:29,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 22:04:29,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 22:04:29,982 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 22:04:30,097 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 22:04:30,100 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 22:04:30,369 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 22:04:30,381 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 22:04:30,381 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-12 22:04:30,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 10:04:30 BoogieIcfgContainer [2022-12-12 22:04:30,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 22:04:30,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 22:04:30,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 22:04:30,390 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 22:04:30,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 10:04:29" (1/3) ... [2022-12-12 22:04:30,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f36d1cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 10:04:30, skipping insertion in model container [2022-12-12 22:04:30,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 10:04:29" (2/3) ... [2022-12-12 22:04:30,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f36d1cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 10:04:30, skipping insertion in model container [2022-12-12 22:04:30,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 10:04:30" (3/3) ... [2022-12-12 22:04:30,393 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x4.wvr.c [2022-12-12 22:04:30,409 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 22:04:30,410 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-12 22:04:30,410 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 22:04:30,506 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-12 22:04:30,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 122 transitions, 276 flow [2022-12-12 22:04:30,636 INFO L130 PetriNetUnfolder]: 10/118 cut-off events. [2022-12-12 22:04:30,636 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-12 22:04:30,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 118 events. 10/118 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-12-12 22:04:30,641 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 122 transitions, 276 flow [2022-12-12 22:04:30,647 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 106 transitions, 236 flow [2022-12-12 22:04:30,649 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 22:04:30,673 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 106 transitions, 236 flow [2022-12-12 22:04:30,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 106 transitions, 236 flow [2022-12-12 22:04:30,725 INFO L130 PetriNetUnfolder]: 10/106 cut-off events. [2022-12-12 22:04:30,725 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-12 22:04:30,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 106 events. 10/106 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-12-12 22:04:30,730 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 106 transitions, 236 flow [2022-12-12 22:04:30,730 INFO L226 LiptonReduction]: Number of co-enabled transitions 1512 [2022-12-12 22:04:34,675 INFO L241 LiptonReduction]: Total number of compositions: 81 [2022-12-12 22:04:34,693 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 22:04:34,703 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;@47dc8d53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 22:04:34,703 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-12 22:04:34,722 INFO L130 PetriNetUnfolder]: 4/24 cut-off events. [2022-12-12 22:04:34,722 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-12 22:04:34,722 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 22:04:34,724 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 22:04:34,724 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-12 22:04:34,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 22:04:34,728 INFO L85 PathProgramCache]: Analyzing trace with hash -2713954, now seen corresponding path program 1 times [2022-12-12 22:04:34,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 22:04:34,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955130034] [2022-12-12 22:04:34,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 22:04:34,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 22:04:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 22:04:35,422 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-12 22:04:35,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 22:04:35,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955130034] [2022-12-12 22:04:35,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955130034] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 22:04:35,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 22:04:35,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 22:04:35,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61366991] [2022-12-12 22:04:35,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 22:04:35,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 22:04:35,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 22:04:35,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 22:04:35,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 22:04:35,456 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 22:04:35,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 74 flow. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:04:35,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 22:04:35,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 22:04:35,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 22:04:35,614 INFO L130 PetriNetUnfolder]: 497/677 cut-off events. [2022-12-12 22:04:35,614 INFO L131 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2022-12-12 22:04:35,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1448 conditions, 677 events. 497/677 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1782 event pairs, 117 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 1016. Up to 471 conditions per place. [2022-12-12 22:04:35,623 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 41 selfloop transitions, 5 changer transitions 1/47 dead transitions. [2022-12-12 22:04:35,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 233 flow [2022-12-12 22:04:35,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 22:04:35,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 22:04:35,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-12 22:04:35,633 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-12 22:04:35,636 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2022-12-12 22:04:35,636 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 47 transitions, 233 flow [2022-12-12 22:04:35,639 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 46 transitions, 226 flow [2022-12-12 22:04:35,640 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 46 transitions, 226 flow [2022-12-12 22:04:35,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:04:35,641 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 22:04:35,641 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 22:04:35,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 22:04:35,642 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-12 22:04:35,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 22:04:35,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1247836044, now seen corresponding path program 1 times [2022-12-12 22:04:35,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 22:04:35,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244205357] [2022-12-12 22:04:35,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 22:04:35,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 22:04:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 22:04:35,877 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-12 22:04:35,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 22:04:35,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244205357] [2022-12-12 22:04:35,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244205357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 22:04:35,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 22:04:35,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 22:04:35,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586754195] [2022-12-12 22:04:35,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 22:04:35,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 22:04:35,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 22:04:35,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 22:04:35,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 22:04:35,880 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 22:04:35,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 46 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:04:35,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 22:04:35,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 22:04:35,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 22:04:36,060 INFO L130 PetriNetUnfolder]: 467/646 cut-off events. [2022-12-12 22:04:36,061 INFO L131 PetriNetUnfolder]: For 96/96 co-relation queries the response was YES. [2022-12-12 22:04:36,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2032 conditions, 646 events. 467/646 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1772 event pairs, 43 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 1448. Up to 441 conditions per place. [2022-12-12 22:04:36,065 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 46 selfloop transitions, 9 changer transitions 4/59 dead transitions. [2022-12-12 22:04:36,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 59 transitions, 405 flow [2022-12-12 22:04:36,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 22:04:36,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 22:04:36,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-12 22:04:36,066 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.61 [2022-12-12 22:04:36,067 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2022-12-12 22:04:36,067 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 59 transitions, 405 flow [2022-12-12 22:04:36,070 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 55 transitions, 375 flow [2022-12-12 22:04:36,070 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 55 transitions, 375 flow [2022-12-12 22:04:36,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:04:36,070 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 22:04:36,071 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 22:04:36,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 22:04:36,071 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-12 22:04:36,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 22:04:36,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1351314103, now seen corresponding path program 1 times [2022-12-12 22:04:36,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 22:04:36,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446950772] [2022-12-12 22:04:36,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 22:04:36,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 22:04:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 22:04:36,211 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-12 22:04:36,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 22:04:36,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446950772] [2022-12-12 22:04:36,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446950772] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 22:04:36,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246735606] [2022-12-12 22:04:36,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 22:04:36,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 22:04:36,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 22:04:36,215 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-12 22:04:36,216 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-12 22:04:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 22:04:36,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-12 22:04:36,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 22:04:36,507 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-12 22:04:36,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 22:04:36,598 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-12 22:04:36,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246735606] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 22:04:36,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 22:04:36,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-12 22:04:36,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123917759] [2022-12-12 22:04:36,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 22:04:36,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 22:04:36,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 22:04:36,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 22:04:36,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-12 22:04:36,600 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 22:04:36,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 55 transitions, 375 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:04:36,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 22:04:36,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 22:04:36,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 22:04:36,882 INFO L130 PetriNetUnfolder]: 837/1152 cut-off events. [2022-12-12 22:04:36,882 INFO L131 PetriNetUnfolder]: For 166/166 co-relation queries the response was YES. [2022-12-12 22:04:36,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4744 conditions, 1152 events. 837/1152 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3624 event pairs, 77 based on Foata normal form. 0/728 useless extension candidates. Maximal degree in co-relation 3272. Up to 959 conditions per place. [2022-12-12 22:04:36,890 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 90 selfloop transitions, 12 changer transitions 0/102 dead transitions. [2022-12-12 22:04:36,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 102 transitions, 897 flow [2022-12-12 22:04:36,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 22:04:36,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 22:04:36,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2022-12-12 22:04:36,894 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.62 [2022-12-12 22:04:36,895 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2022-12-12 22:04:36,896 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 102 transitions, 897 flow [2022-12-12 22:04:36,903 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 102 transitions, 897 flow [2022-12-12 22:04:36,903 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 102 transitions, 897 flow [2022-12-12 22:04:36,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:04:36,904 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 22:04:36,904 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 22:04:36,913 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-12 22:04:37,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 22:04:37,112 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-12 22:04:37,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 22:04:37,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1052302218, now seen corresponding path program 2 times [2022-12-12 22:04:37,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 22:04:37,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403077007] [2022-12-12 22:04:37,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 22:04:37,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 22:04:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 22:04:37,313 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-12 22:04:37,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 22:04:37,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403077007] [2022-12-12 22:04:37,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403077007] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 22:04:37,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 22:04:37,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 22:04:37,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103535662] [2022-12-12 22:04:37,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 22:04:37,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 22:04:37,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 22:04:37,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 22:04:37,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 22:04:37,316 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 22:04:37,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 102 transitions, 897 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:04:37,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 22:04:37,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 22:04:37,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 22:04:37,515 INFO L130 PetriNetUnfolder]: 925/1268 cut-off events. [2022-12-12 22:04:37,515 INFO L131 PetriNetUnfolder]: For 184/184 co-relation queries the response was YES. [2022-12-12 22:04:37,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6483 conditions, 1268 events. 925/1268 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4073 event pairs, 61 based on Foata normal form. 0/810 useless extension candidates. Maximal degree in co-relation 4432. Up to 1075 conditions per place. [2022-12-12 22:04:37,524 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 106 selfloop transitions, 8 changer transitions 0/114 dead transitions. [2022-12-12 22:04:37,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 114 transitions, 1227 flow [2022-12-12 22:04:37,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 22:04:37,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 22:04:37,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-12 22:04:37,528 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.57 [2022-12-12 22:04:37,529 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2022-12-12 22:04:37,530 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 114 transitions, 1227 flow [2022-12-12 22:04:37,538 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 114 transitions, 1227 flow [2022-12-12 22:04:37,538 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 114 transitions, 1227 flow [2022-12-12 22:04:37,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:04:37,538 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 22:04:37,538 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 22:04:37,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 22:04:37,539 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-12 22:04:37,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 22:04:37,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1474747795, now seen corresponding path program 1 times [2022-12-12 22:04:37,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 22:04:37,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600809842] [2022-12-12 22:04:37,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 22:04:37,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 22:04:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 22:04:37,703 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-12 22:04:37,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 22:04:37,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600809842] [2022-12-12 22:04:37,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600809842] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 22:04:37,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 22:04:37,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 22:04:37,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836031766] [2022-12-12 22:04:37,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 22:04:37,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 22:04:37,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 22:04:37,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 22:04:37,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 22:04:37,706 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 22:04:37,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 114 transitions, 1227 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:04:37,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 22:04:37,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 22:04:37,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 22:04:37,904 INFO L130 PetriNetUnfolder]: 889/1232 cut-off events. [2022-12-12 22:04:37,904 INFO L131 PetriNetUnfolder]: For 183/183 co-relation queries the response was YES. [2022-12-12 22:04:37,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7536 conditions, 1232 events. 889/1232 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3996 event pairs, 82 based on Foata normal form. 0/810 useless extension candidates. Maximal degree in co-relation 6951. Up to 1039 conditions per place. [2022-12-12 22:04:37,913 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 110 selfloop transitions, 11 changer transitions 13/134 dead transitions. [2022-12-12 22:04:37,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 134 transitions, 1707 flow [2022-12-12 22:04:37,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 22:04:37,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 22:04:37,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-12 22:04:37,915 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.59 [2022-12-12 22:04:37,915 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2022-12-12 22:04:37,915 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 134 transitions, 1707 flow [2022-12-12 22:04:37,924 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 121 transitions, 1545 flow [2022-12-12 22:04:37,924 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 121 transitions, 1545 flow [2022-12-12 22:04:37,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:04:37,925 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 22:04:37,925 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 22:04:37,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 22:04:37,925 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-12 22:04:37,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 22:04:37,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1667699092, now seen corresponding path program 1 times [2022-12-12 22:04:37,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 22:04:37,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592155923] [2022-12-12 22:04:37,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 22:04:37,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 22:04:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 22:04:38,042 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-12 22:04:38,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 22:04:38,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592155923] [2022-12-12 22:04:38,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592155923] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 22:04:38,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110097987] [2022-12-12 22:04:38,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 22:04:38,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 22:04:38,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 22:04:38,048 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-12 22:04:38,051 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-12 22:04:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 22:04:38,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-12 22:04:38,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 22:04:38,292 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-12 22:04:38,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 22:04:38,346 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-12 22:04:38,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110097987] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 22:04:38,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 22:04:38,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-12 22:04:38,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490324535] [2022-12-12 22:04:38,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 22:04:38,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 22:04:38,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 22:04:38,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 22:04:38,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-12 22:04:38,349 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 22:04:38,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 121 transitions, 1545 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:04:38,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 22:04:38,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 22:04:38,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 22:04:38,744 INFO L130 PetriNetUnfolder]: 1708/2329 cut-off events. [2022-12-12 22:04:38,745 INFO L131 PetriNetUnfolder]: For 332/332 co-relation queries the response was YES. [2022-12-12 22:04:38,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16542 conditions, 2329 events. 1708/2329 cut-off events. For 332/332 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8495 event pairs, 84 based on Foata normal form. 0/1577 useless extension candidates. Maximal degree in co-relation 15574. Up to 2255 conditions per place. [2022-12-12 22:04:38,771 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 248 selfloop transitions, 32 changer transitions 0/280 dead transitions. [2022-12-12 22:04:38,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 280 transitions, 4115 flow [2022-12-12 22:04:38,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 22:04:38,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 22:04:38,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2022-12-12 22:04:38,774 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6466666666666666 [2022-12-12 22:04:38,776 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2022-12-12 22:04:38,776 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 280 transitions, 4115 flow [2022-12-12 22:04:38,794 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 280 transitions, 4115 flow [2022-12-12 22:04:38,794 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 280 transitions, 4115 flow [2022-12-12 22:04:38,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:04:38,795 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 22:04:38,795 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 22:04:38,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-12 22:04:39,000 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,SelfDestructingSolverStorable5 [2022-12-12 22:04:39,000 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-12 22:04:39,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 22:04:39,001 INFO L85 PathProgramCache]: Analyzing trace with hash -13358859, now seen corresponding path program 2 times [2022-12-12 22:04:39,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 22:04:39,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512293634] [2022-12-12 22:04:39,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 22:04:39,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 22:04:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 22:04:39,131 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-12 22:04:39,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 22:04:39,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512293634] [2022-12-12 22:04:39,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512293634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 22:04:39,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 22:04:39,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 22:04:39,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213098754] [2022-12-12 22:04:39,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 22:04:39,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 22:04:39,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 22:04:39,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 22:04:39,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 22:04:39,133 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 22:04:39,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 280 transitions, 4115 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:04:39,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 22:04:39,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 22:04:39,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 22:04:39,448 INFO L130 PetriNetUnfolder]: 1924/2613 cut-off events. [2022-12-12 22:04:39,448 INFO L131 PetriNetUnfolder]: For 344/344 co-relation queries the response was YES. [2022-12-12 22:04:39,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21164 conditions, 2613 events. 1924/2613 cut-off events. For 344/344 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9674 event pairs, 16 based on Foata normal form. 0/1779 useless extension candidates. Maximal degree in co-relation 19965. Up to 2539 conditions per place. [2022-12-12 22:04:39,496 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 303 selfloop transitions, 13 changer transitions 0/316 dead transitions. [2022-12-12 22:04:39,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 316 transitions, 5263 flow [2022-12-12 22:04:39,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 22:04:39,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 22:04:39,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-12 22:04:39,498 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.57 [2022-12-12 22:04:39,498 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 24 predicate places. [2022-12-12 22:04:39,498 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 316 transitions, 5263 flow [2022-12-12 22:04:39,517 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 316 transitions, 5263 flow [2022-12-12 22:04:39,517 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 316 transitions, 5263 flow [2022-12-12 22:04:39,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:04:39,517 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 22:04:39,517 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 22:04:39,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 22:04:39,518 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-12 22:04:39,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 22:04:39,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1457115743, now seen corresponding path program 1 times [2022-12-12 22:04:39,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 22:04:39,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124626660] [2022-12-12 22:04:39,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 22:04:39,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 22:04:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 22:04:40,017 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-12 22:04:40,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 22:04:40,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124626660] [2022-12-12 22:04:40,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124626660] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 22:04:40,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848565817] [2022-12-12 22:04:40,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 22:04:40,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 22:04:40,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 22:04:40,020 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-12 22:04:40,064 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-12 22:04:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 22:04:51,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-12 22:04:51,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 22:05:14,999 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-12 22:05:15,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 22:05:21,782 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-12 22:05:21,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848565817] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 22:05:21,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 22:05:21,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-12 22:05:21,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758486396] [2022-12-12 22:05:21,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 22:05:21,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-12 22:05:21,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 22:05:21,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-12 22:05:21,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=168, Unknown=9, NotChecked=0, Total=240 [2022-12-12 22:05:21,785 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 22:05:21,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 316 transitions, 5263 flow. Second operand has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:05:21,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 22:05:21,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 22:05:21,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 22:06:30,110 WARN L233 SmtUtils]: Spent 1.04m on a formula simplification. DAG size of input: 84 DAG size of output: 82 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 22:06:32,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:06:34,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:06:36,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:06:38,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:06:41,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:06:43,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:06:47,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:06:49,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:06:54,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:06:57,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:06:59,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:07:12,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:07:22,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:07:27,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-12 22:07:29,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:07:32,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:07:34,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:07:36,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:07:38,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:07:40,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:07:42,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-12 22:07:45,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-12 22:07:48,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-12 22:07:50,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:07:57,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:08:00,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:08:03,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:08:06,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:08:08,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:08:10,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:08:12,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:08:15,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:08:17,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-12 22:08:20,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:08:22,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:08:25,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:08:33,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:08:35,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:08:39,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:08:40,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:08:42,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:08:44,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:08:47,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:09:08,047 WARN L233 SmtUtils]: Spent 10.61s on a formula simplification. DAG size of input: 85 DAG size of output: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 22:09:10,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:09:12,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:09:15,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:09:17,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:09:19,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:09:21,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:09:24,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:09:26,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:09:42,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-12 22:09:44,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:09:46,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:09:50,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:09:52,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:09:54,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:09:56,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:09:59,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:10:01,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:10:09,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:10:11,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:10:13,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:10:15,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:10:18,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:10:20,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:10:21,797 INFO L130 PetriNetUnfolder]: 3174/4383 cut-off events. [2022-12-12 22:10:21,797 INFO L131 PetriNetUnfolder]: For 619/619 co-relation queries the response was YES. [2022-12-12 22:10:21,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39916 conditions, 4383 events. 3174/4383 cut-off events. For 619/619 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 18474 event pairs, 28 based on Foata normal form. 2/2993 useless extension candidates. Maximal degree in co-relation 37901. Up to 4309 conditions per place. [2022-12-12 22:10:21,832 INFO L137 encePairwiseOnDemand]: 6/25 looper letters, 454 selfloop transitions, 165 changer transitions 25/644 dead transitions. [2022-12-12 22:10:21,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 644 transitions, 12045 flow [2022-12-12 22:10:21,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-12 22:10:21,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-12 22:10:21,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 254 transitions. [2022-12-12 22:10:21,834 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.508 [2022-12-12 22:10:21,835 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 43 predicate places. [2022-12-12 22:10:21,835 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 644 transitions, 12045 flow [2022-12-12 22:10:21,869 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 619 transitions, 11559 flow [2022-12-12 22:10:21,869 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 619 transitions, 11559 flow [2022-12-12 22:10:21,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:10:21,870 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 22:10:21,870 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 22:10:21,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-12 22:10:22,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 22:10:22,078 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-12 22:10:22,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 22:10:22,078 INFO L85 PathProgramCache]: Analyzing trace with hash 223241117, now seen corresponding path program 2 times [2022-12-12 22:10:22,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 22:10:22,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565184679] [2022-12-12 22:10:22,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 22:10:22,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 22:10:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 22:10:22,767 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-12 22:10:22,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 22:10:22,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565184679] [2022-12-12 22:10:22,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565184679] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 22:10:22,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124662535] [2022-12-12 22:10:22,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 22:10:22,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 22:10:22,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 22:10:22,769 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-12 22:10:22,772 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-12 22:10:30,143 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 22:10:30,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 22:10:30,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-12 22:10:30,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 22:10:49,717 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-12 22:10:49,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 22:10:57,242 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-12 22:10:57,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124662535] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 22:10:57,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 22:10:57,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2022-12-12 22:10:57,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695182023] [2022-12-12 22:10:57,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 22:10:57,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-12 22:10:57,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 22:10:57,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-12 22:10:57,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=146, Unknown=10, NotChecked=0, Total=210 [2022-12-12 22:10:57,244 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 22:10:57,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 619 transitions, 11559 flow. Second operand has 15 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:10:57,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 22:10:57,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 22:10:57,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 22:10:59,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:11:26,195 WARN L233 SmtUtils]: Spent 20.15s on a formula simplification. DAG size of input: 61 DAG size of output: 22 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 22:11:33,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:11:36,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:11:38,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:11:40,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:11:42,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:11:44,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:11:46,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-12 22:11:48,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:11:50,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:11:56,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:11:58,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:12:00,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:12:03,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:12:05,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:12:14,690 WARN L233 SmtUtils]: Spent 5.32s on a formula simplification. DAG size of input: 63 DAG size of output: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 22:12:17,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:12:20,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:12:22,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:12:24,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:12:26,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:12:28,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:12:31,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:12:33,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:12:35,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:12:37,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:12:39,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:12:41,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:13:05,829 WARN L233 SmtUtils]: Spent 19.86s on a formula simplification. DAG size of input: 75 DAG size of output: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 22:13:07,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:13:09,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:13:11,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:13:13,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:13:15,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:13:17,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:13:19,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:13:21,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:13:32,884 WARN L233 SmtUtils]: Spent 5.02s on a formula simplification. DAG size of input: 70 DAG size of output: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 22:13:34,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:13:37,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:13:39,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:13:41,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:13:43,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:13:45,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:13:47,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:13:49,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-12 22:13:51,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:13:53,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:13:56,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:13:59,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:14:01,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:14:03,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:14:06,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:14:11,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:14:13,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:14:15,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:14:24,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:14:39,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:14:41,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:14:42,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:14:44,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:14:46,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:14:48,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:14:50,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:14:51,747 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-12 22:14:54,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:14:57,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:15:00,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:15:02,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:15:04,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:15:05,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:15:07,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:15:22,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:15:25,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:15:27,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:15:33,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:15:34,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:15:36,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:15:38,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:15:40,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:15:43,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:15:45,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:15:47,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:15:49,085 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-12 22:15:50,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:15:54,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:15:56,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:15:58,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:16:00,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:16:02,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:16:04,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:16:06,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:16:08,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-12 22:16:10,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:16:12,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:16:14,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:16:17,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:16:19,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:16:22,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:16:24,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:16:28,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:16:29,987 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-12 22:16:31,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:16:33,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:16:35,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:16:38,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:16:39,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:16:41,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:17:14,944 WARN L233 SmtUtils]: Spent 16.98s on a formula simplification. DAG size of input: 56 DAG size of output: 24 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 22:17:18,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:17:20,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:17:21,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:17:23,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:17:27,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:17:27,321 INFO L130 PetriNetUnfolder]: 5395/7670 cut-off events. [2022-12-12 22:17:27,321 INFO L131 PetriNetUnfolder]: For 1207/1207 co-relation queries the response was YES. [2022-12-12 22:17:27,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77478 conditions, 7670 events. 5395/7670 cut-off events. For 1207/1207 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 37291 event pairs, 45 based on Foata normal form. 6/5145 useless extension candidates. Maximal degree in co-relation 73590. Up to 7596 conditions per place. [2022-12-12 22:17:27,372 INFO L137 encePairwiseOnDemand]: 5/25 looper letters, 914 selfloop transitions, 298 changer transitions 66/1278 dead transitions. [2022-12-12 22:17:27,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 1278 transitions, 26484 flow [2022-12-12 22:17:27,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-12 22:17:27,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-12 22:17:27,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 359 transitions. [2022-12-12 22:17:27,376 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5744 [2022-12-12 22:17:27,376 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 65 predicate places. [2022-12-12 22:17:27,376 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 1278 transitions, 26484 flow [2022-12-12 22:17:27,431 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 1212 transitions, 25080 flow [2022-12-12 22:17:27,431 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 1212 transitions, 25080 flow [2022-12-12 22:17:27,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:17:27,431 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 22:17:27,431 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 22:17:27,440 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-12 22:17:27,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 22:17:27,640 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-12 22:17:27,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 22:17:27,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1384987553, now seen corresponding path program 3 times [2022-12-12 22:17:27,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 22:17:27,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84616847] [2022-12-12 22:17:27,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 22:17:27,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 22:17:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 22:17:28,195 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-12 22:17:28,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 22:17:28,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84616847] [2022-12-12 22:17:28,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84616847] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 22:17:28,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573051389] [2022-12-12 22:17:28,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 22:17:28,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 22:17:28,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 22:17:28,197 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-12 22:17:28,200 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-12 22:17:28,520 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-12 22:17:28,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 22:17:28,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-12 22:17:28,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 22:17:53,805 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-12 22:17:53,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 22:18:14,679 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-12 22:18:14,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573051389] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 22:18:14,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 22:18:14,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-12 22:18:14,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690228967] [2022-12-12 22:18:14,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 22:18:14,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-12 22:18:14,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 22:18:14,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-12 22:18:14,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=172, Unknown=16, NotChecked=0, Total=240 [2022-12-12 22:18:14,680 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 22:18:14,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 1212 transitions, 25080 flow. Second operand has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:18:14,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 22:18:14,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 22:18:14,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 22:18:17,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:18:19,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2022-12-12 22:19:03,343 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 22:19:03,343 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 22:19:04,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-12 22:19:04,549 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-12-12 22:19:04,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2022-12-12 22:19:04,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 22:19:04,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 22:19:04,557 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:391) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:230) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:482) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfoldingHelper(PetriNetUnfolder.java:209) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfolding(PetriNetUnfolder.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:129) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:491) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-12 22:19:04,559 INFO L158 Benchmark]: Toolchain (without parser) took 874962.55ms. Allocated memory was 185.6MB in the beginning and 323.0MB in the end (delta: 137.4MB). Free memory was 162.1MB in the beginning and 155.2MB in the end (delta: 6.8MB). Peak memory consumption was 146.0MB. Max. memory is 8.0GB. [2022-12-12 22:19:04,560 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 185.6MB. Free memory was 161.7MB in the beginning and 161.5MB in the end (delta: 152.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 22:19:04,560 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.14ms. Allocated memory is still 185.6MB. Free memory was 162.1MB in the beginning and 150.9MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-12 22:19:04,560 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.42ms. Allocated memory is still 185.6MB. Free memory was 150.9MB in the beginning and 149.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-12 22:19:04,560 INFO L158 Benchmark]: Boogie Preprocessor took 33.78ms. Allocated memory is still 185.6MB. Free memory was 149.5MB in the beginning and 147.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-12 22:19:04,561 INFO L158 Benchmark]: RCFGBuilder took 481.55ms. Allocated memory is still 185.6MB. Free memory was 147.9MB in the beginning and 132.7MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-12 22:19:04,561 INFO L158 Benchmark]: TraceAbstraction took 874173.42ms. Allocated memory was 185.6MB in the beginning and 323.0MB in the end (delta: 137.4MB). Free memory was 131.1MB in the beginning and 155.2MB in the end (delta: -24.1MB). Peak memory consumption was 114.6MB. Max. memory is 8.0GB. [2022-12-12 22:19:04,562 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.11ms. Allocated memory is still 185.6MB. Free memory was 161.7MB in the beginning and 161.5MB in the end (delta: 152.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 224.14ms. Allocated memory is still 185.6MB. Free memory was 162.1MB in the beginning and 150.9MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.42ms. Allocated memory is still 185.6MB. Free memory was 150.9MB in the beginning and 149.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.78ms. Allocated memory is still 185.6MB. Free memory was 149.5MB in the beginning and 147.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 481.55ms. Allocated memory is still 185.6MB. Free memory was 147.9MB in the beginning and 132.7MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 874173.42ms. Allocated memory was 185.6MB in the beginning and 323.0MB in the end (delta: 137.4MB). Free memory was 131.1MB in the beginning and 155.2MB in the end (delta: -24.1MB). Peak memory consumption was 114.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 109 PlacesBefore, 34 PlacesAfterwards, 106 TransitionsBefore, 25 TransitionsAfterwards, 1512 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 33 ConcurrentYvCompositions, 6 ChoiceCompositions, 81 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 763, independent: 763, independent conditional: 763, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 763, independent: 763, independent conditional: 0, independent unconditional: 763, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 763, independent: 763, independent conditional: 0, independent unconditional: 763, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 763, independent: 763, independent conditional: 0, independent unconditional: 763, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 763, independent: 763, independent conditional: 0, independent unconditional: 763, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 763, independent: 763, independent conditional: 0, independent unconditional: 763, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 763, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 763, unknown conditional: 0, unknown unconditional: 763] , Statistics on independence cache: Total cache size (in pairs): 1257, Positive cache size: 1257, Positive conditional cache size: 0, Positive unconditional cache size: 1257, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown