/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 21:54:06,101 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 21:54:06,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 21:54:06,179 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 21:54:06,180 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 21:54:06,181 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 21:54:06,183 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 21:54:06,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 21:54:06,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 21:54:06,192 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 21:54:06,193 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 21:54:06,195 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 21:54:06,195 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 21:54:06,196 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 21:54:06,197 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 21:54:06,198 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 21:54:06,198 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 21:54:06,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 21:54:06,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 21:54:06,205 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 21:54:06,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 21:54:06,207 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 21:54:06,207 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 21:54:06,208 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 21:54:06,213 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 21:54:06,213 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 21:54:06,213 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 21:54:06,214 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 21:54:06,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 21:54:06,215 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 21:54:06,215 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 21:54:06,216 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 21:54:06,217 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 21:54:06,218 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 21:54:06,218 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 21:54:06,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 21:54:06,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 21:54:06,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 21:54:06,219 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 21:54:06,219 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 21:54:06,220 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 21:54:06,221 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-05 21:54:06,261 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 21:54:06,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 21:54:06,263 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 21:54:06,263 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 21:54:06,263 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 21:54:06,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 21:54:06,264 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 21:54:06,264 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 21:54:06,264 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 21:54:06,264 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 21:54:06,265 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 21:54:06,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 21:54:06,265 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 21:54:06,265 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 21:54:06,265 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 21:54:06,265 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 21:54:06,266 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 21:54:06,266 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 21:54:06,266 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 21:54:06,266 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 21:54:06,266 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 21:54:06,266 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 21:54:06,266 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 21:54:06,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 21:54:06,266 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 21:54:06,266 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 21:54:06,267 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 21:54:06,267 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 21:54:06,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 21:54:06,267 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 21:54:06,267 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 21:54:06,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 21:54:06,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 21:54:06,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 21:54:06,542 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 21:54:06,542 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 21:54:06,543 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c [2022-12-05 21:54:07,535 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 21:54:07,713 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 21:54:07,713 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c [2022-12-05 21:54:07,717 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93417fd6d/d37c31df423743859004874360e9fddf/FLAG682441e74 [2022-12-05 21:54:07,726 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93417fd6d/d37c31df423743859004874360e9fddf [2022-12-05 21:54:07,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 21:54:07,729 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 21:54:07,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 21:54:07,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 21:54:07,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 21:54:07,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:54:07" (1/1) ... [2022-12-05 21:54:07,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c02feb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:54:07, skipping insertion in model container [2022-12-05 21:54:07,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:54:07" (1/1) ... [2022-12-05 21:54:07,737 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 21:54:07,747 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 21:54:07,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:54:07,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:54:07,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:54:07,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:54:07,840 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/popl20-more-nonblocking-counter-alt2.wvr.c[2147,2160] [2022-12-05 21:54:07,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 21:54:07,850 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 21:54:07,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:54:07,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:54:07,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:54:07,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:54:07,866 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/popl20-more-nonblocking-counter-alt2.wvr.c[2147,2160] [2022-12-05 21:54:07,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 21:54:07,875 INFO L208 MainTranslator]: Completed translation [2022-12-05 21:54:07,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:54:07 WrapperNode [2022-12-05 21:54:07,875 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 21:54:07,876 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 21:54:07,876 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 21:54:07,876 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 21:54:07,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:54:07" (1/1) ... [2022-12-05 21:54:07,885 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:54:07" (1/1) ... [2022-12-05 21:54:07,896 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2022-12-05 21:54:07,897 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 21:54:07,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 21:54:07,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 21:54:07,897 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 21:54:07,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:54:07" (1/1) ... [2022-12-05 21:54:07,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:54:07" (1/1) ... [2022-12-05 21:54:07,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:54:07" (1/1) ... [2022-12-05 21:54:07,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:54:07" (1/1) ... [2022-12-05 21:54:07,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:54:07" (1/1) ... [2022-12-05 21:54:07,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:54:07" (1/1) ... [2022-12-05 21:54:07,910 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:54:07" (1/1) ... [2022-12-05 21:54:07,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:54:07" (1/1) ... [2022-12-05 21:54:07,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 21:54:07,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 21:54:07,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 21:54:07,912 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 21:54:07,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:54:07" (1/1) ... [2022-12-05 21:54:07,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 21:54:07,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:54:07,943 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-05 21:54:07,968 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-05 21:54:07,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 21:54:07,980 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-05 21:54:07,980 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-05 21:54:07,980 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-05 21:54:07,981 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-05 21:54:07,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 21:54:07,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 21:54:07,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 21:54:07,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 21:54:07,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 21:54:07,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 21:54:07,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 21:54:07,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 21:54:07,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 21:54:07,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-05 21:54:08,039 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 21:54:08,040 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 21:54:08,165 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 21:54:08,220 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 21:54:08,220 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-05 21:54:08,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:54:08 BoogieIcfgContainer [2022-12-05 21:54:08,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 21:54:08,224 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 21:54:08,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 21:54:08,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 21:54:08,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:54:07" (1/3) ... [2022-12-05 21:54:08,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b44078d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:54:08, skipping insertion in model container [2022-12-05 21:54:08,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:54:07" (2/3) ... [2022-12-05 21:54:08,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b44078d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:54:08, skipping insertion in model container [2022-12-05 21:54:08,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:54:08" (3/3) ... [2022-12-05 21:54:08,228 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-nonblocking-counter-alt2.wvr.c [2022-12-05 21:54:08,257 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 21:54:08,257 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 21:54:08,257 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 21:54:08,330 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-05 21:54:08,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 77 transitions, 170 flow [2022-12-05 21:54:08,386 INFO L130 PetriNetUnfolder]: 6/75 cut-off events. [2022-12-05 21:54:08,386 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 21:54:08,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 75 events. 6/75 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 39 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2022-12-05 21:54:08,389 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 77 transitions, 170 flow [2022-12-05 21:54:08,392 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 67 transitions, 146 flow [2022-12-05 21:54:08,393 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 21:54:08,408 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 67 transitions, 146 flow [2022-12-05 21:54:08,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 67 transitions, 146 flow [2022-12-05 21:54:08,425 INFO L130 PetriNetUnfolder]: 6/67 cut-off events. [2022-12-05 21:54:08,426 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 21:54:08,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 67 events. 6/67 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 38 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2022-12-05 21:54:08,428 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 67 transitions, 146 flow [2022-12-05 21:54:08,428 INFO L188 LiptonReduction]: Number of co-enabled transitions 404 [2022-12-05 21:54:10,307 INFO L203 LiptonReduction]: Total number of compositions: 52 [2022-12-05 21:54:10,324 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 21:54:10,330 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;@57dc62d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 21:54:10,330 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-05 21:54:10,340 INFO L130 PetriNetUnfolder]: 2/14 cut-off events. [2022-12-05 21:54:10,340 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 21:54:10,340 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:54:10,341 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:54:10,342 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 21:54:10,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:54:10,347 INFO L85 PathProgramCache]: Analyzing trace with hash 791724945, now seen corresponding path program 1 times [2022-12-05 21:54:10,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:54:10,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648836539] [2022-12-05 21:54:10,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:54:10,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:54:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:54:10,689 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-05 21:54:10,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:54:10,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648836539] [2022-12-05 21:54:10,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648836539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 21:54:10,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 21:54:10,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 21:54:10,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913840157] [2022-12-05 21:54:10,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:54:10,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 21:54:10,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:54:10,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 21:54:10,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 21:54:10,712 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-05 21:54:10,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:54:10,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:54:10,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-05 21:54:10,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:54:10,760 INFO L130 PetriNetUnfolder]: 63/112 cut-off events. [2022-12-05 21:54:10,760 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-05 21:54:10,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 112 events. 63/112 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 325 event pairs, 13 based on Foata normal form. 1/76 useless extension candidates. Maximal degree in co-relation 163. Up to 66 conditions per place. [2022-12-05 21:54:10,761 INFO L137 encePairwiseOnDemand]: 12/15 looper letters, 17 selfloop transitions, 2 changer transitions 4/25 dead transitions. [2022-12-05 21:54:10,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 25 transitions, 117 flow [2022-12-05 21:54:10,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 21:54:10,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 21:54:10,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-05 21:54:10,769 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-05 21:54:10,771 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 42 flow. Second operand 3 states and 30 transitions. [2022-12-05 21:54:10,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 25 transitions, 117 flow [2022-12-05 21:54:10,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 25 transitions, 103 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 21:54:10,774 INFO L231 Difference]: Finished difference. Result has 19 places, 16 transitions, 46 flow [2022-12-05 21:54:10,775 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=19, PETRI_TRANSITIONS=16} [2022-12-05 21:54:10,777 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, -1 predicate places. [2022-12-05 21:54:10,778 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 16 transitions, 46 flow [2022-12-05 21:54:10,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:54:10,778 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:54:10,778 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:54:10,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 21:54:10,778 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 21:54:10,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:54:10,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1574486509, now seen corresponding path program 1 times [2022-12-05 21:54:10,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:54:10,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182969714] [2022-12-05 21:54:10,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:54:10,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:54:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:54:10,878 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-05 21:54:10,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:54:10,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182969714] [2022-12-05 21:54:10,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182969714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 21:54:10,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 21:54:10,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 21:54:10,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883733558] [2022-12-05 21:54:10,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:54:10,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 21:54:10,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:54:10,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 21:54:10,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 21:54:10,887 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 21:54:10,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 16 transitions, 46 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-05 21:54:10,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:54:10,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 21:54:10,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:54:10,966 INFO L130 PetriNetUnfolder]: 102/196 cut-off events. [2022-12-05 21:54:10,967 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-05 21:54:10,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 196 events. 102/196 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 648 event pairs, 46 based on Foata normal form. 6/174 useless extension candidates. Maximal degree in co-relation 214. Up to 125 conditions per place. [2022-12-05 21:54:10,968 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 28 selfloop transitions, 3 changer transitions 6/37 dead transitions. [2022-12-05 21:54:10,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 37 transitions, 174 flow [2022-12-05 21:54:10,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 21:54:10,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 21:54:10,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-12-05 21:54:10,969 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2022-12-05 21:54:10,969 INFO L175 Difference]: Start difference. First operand has 19 places, 16 transitions, 46 flow. Second operand 5 states and 37 transitions. [2022-12-05 21:54:10,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 37 transitions, 174 flow [2022-12-05 21:54:10,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 37 transitions, 171 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 21:54:10,970 INFO L231 Difference]: Finished difference. Result has 25 places, 18 transitions, 70 flow [2022-12-05 21:54:10,970 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70, PETRI_PLACES=25, PETRI_TRANSITIONS=18} [2022-12-05 21:54:10,971 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 5 predicate places. [2022-12-05 21:54:10,971 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 70 flow [2022-12-05 21:54:10,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-05 21:54:10,971 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:54:10,971 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:54:10,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 21:54:10,972 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 21:54:10,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:54:10,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1000603623, now seen corresponding path program 2 times [2022-12-05 21:54:10,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:54:10,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127810795] [2022-12-05 21:54:10,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:54:10,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:54:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:54:11,020 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-05 21:54:11,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:54:11,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127810795] [2022-12-05 21:54:11,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127810795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 21:54:11,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 21:54:11,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 21:54:11,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326553953] [2022-12-05 21:54:11,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:54:11,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 21:54:11,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:54:11,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 21:54:11,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 21:54:11,022 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-05 21:54:11,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:54:11,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:54:11,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-05 21:54:11,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:54:11,054 INFO L130 PetriNetUnfolder]: 73/134 cut-off events. [2022-12-05 21:54:11,054 INFO L131 PetriNetUnfolder]: For 160/169 co-relation queries the response was YES. [2022-12-05 21:54:11,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 134 events. 73/134 cut-off events. For 160/169 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 408 event pairs, 37 based on Foata normal form. 12/134 useless extension candidates. Maximal degree in co-relation 185. Up to 105 conditions per place. [2022-12-05 21:54:11,055 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 19 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2022-12-05 21:54:11,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 23 transitions, 131 flow [2022-12-05 21:54:11,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 21:54:11,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 21:54:11,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-12-05 21:54:11,056 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-05 21:54:11,056 INFO L175 Difference]: Start difference. First operand has 25 places, 18 transitions, 70 flow. Second operand 4 states and 25 transitions. [2022-12-05 21:54:11,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 23 transitions, 131 flow [2022-12-05 21:54:11,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 23 transitions, 113 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-05 21:54:11,057 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 58 flow [2022-12-05 21:54:11,057 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=58, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2022-12-05 21:54:11,058 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places. [2022-12-05 21:54:11,058 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 58 flow [2022-12-05 21:54:11,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:54:11,058 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:54:11,058 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:54:11,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 21:54:11,058 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 21:54:11,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:54:11,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1230156987, now seen corresponding path program 1 times [2022-12-05 21:54:11,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:54:11,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024109004] [2022-12-05 21:54:11,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:54:11,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:54:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:54:11,239 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-05 21:54:11,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:54:11,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024109004] [2022-12-05 21:54:11,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024109004] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:54:11,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519099454] [2022-12-05 21:54:11,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:54:11,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:54:11,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:54:11,242 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-05 21:54:11,309 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-05 21:54:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:54:11,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-05 21:54:11,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:54:11,386 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-05 21:54:11,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:54:11,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:11,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519099454] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:54:11,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:54:11,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 2] total 8 [2022-12-05 21:54:11,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257404201] [2022-12-05 21:54:11,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:54:11,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 21:54:11,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:54:11,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 21:54:11,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-05 21:54:11,498 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-05 21:54:11,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 58 flow. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 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-05 21:54:11,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:54:11,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-05 21:54:11,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:54:11,674 INFO L130 PetriNetUnfolder]: 173/316 cut-off events. [2022-12-05 21:54:11,674 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-05 21:54:11,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 316 events. 173/316 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1190 event pairs, 15 based on Foata normal form. 2/282 useless extension candidates. Maximal degree in co-relation 146. Up to 103 conditions per place. [2022-12-05 21:54:11,676 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 47 selfloop transitions, 19 changer transitions 21/88 dead transitions. [2022-12-05 21:54:11,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 88 transitions, 446 flow [2022-12-05 21:54:11,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 21:54:11,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 21:54:11,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 98 transitions. [2022-12-05 21:54:11,678 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.593939393939394 [2022-12-05 21:54:11,678 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 58 flow. Second operand 11 states and 98 transitions. [2022-12-05 21:54:11,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 88 transitions, 446 flow [2022-12-05 21:54:11,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 88 transitions, 428 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 21:54:11,680 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 191 flow [2022-12-05 21:54:11,680 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=191, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2022-12-05 21:54:11,681 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 16 predicate places. [2022-12-05 21:54:11,681 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 191 flow [2022-12-05 21:54:11,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 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-05 21:54:11,681 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:54:11,681 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:54:11,694 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-05 21:54:11,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:54:11,882 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 21:54:11,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:54:11,882 INFO L85 PathProgramCache]: Analyzing trace with hash 40306777, now seen corresponding path program 2 times [2022-12-05 21:54:11,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:54:11,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035916342] [2022-12-05 21:54:11,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:54:11,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:54:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:54:12,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:54:12,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:54:12,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035916342] [2022-12-05 21:54:12,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035916342] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:54:12,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082382885] [2022-12-05 21:54:12,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 21:54:12,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:54:12,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:54:12,012 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-05 21:54:12,052 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-05 21:54:12,088 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 21:54:12,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:54:12,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-05 21:54:12,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:54:12,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:54:12,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:54:12,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:54:12,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082382885] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:54:12,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:54:12,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-05 21:54:12,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932235211] [2022-12-05 21:54:12,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:54:12,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 21:54:12,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:54:12,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 21:54:12,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-05 21:54:12,205 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-05 21:54:12,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 191 flow. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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-05 21:54:12,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:54:12,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-05 21:54:12,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:54:12,311 INFO L130 PetriNetUnfolder]: 173/313 cut-off events. [2022-12-05 21:54:12,312 INFO L131 PetriNetUnfolder]: For 474/474 co-relation queries the response was YES. [2022-12-05 21:54:12,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1039 conditions, 313 events. 173/313 cut-off events. For 474/474 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1138 event pairs, 59 based on Foata normal form. 18/331 useless extension candidates. Maximal degree in co-relation 964. Up to 233 conditions per place. [2022-12-05 21:54:12,317 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 38 selfloop transitions, 11 changer transitions 9/59 dead transitions. [2022-12-05 21:54:12,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 59 transitions, 399 flow [2022-12-05 21:54:12,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 21:54:12,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 21:54:12,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-12-05 21:54:12,319 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-05 21:54:12,319 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 191 flow. Second operand 6 states and 48 transitions. [2022-12-05 21:54:12,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 59 transitions, 399 flow [2022-12-05 21:54:12,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 59 transitions, 378 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-05 21:54:12,325 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 249 flow [2022-12-05 21:54:12,326 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=249, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2022-12-05 21:54:12,327 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 23 predicate places. [2022-12-05 21:54:12,327 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 249 flow [2022-12-05 21:54:12,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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-05 21:54:12,328 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:54:12,328 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:54:12,343 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-05 21:54:12,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:54:12,536 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 21:54:12,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:54:12,536 INFO L85 PathProgramCache]: Analyzing trace with hash -2049087221, now seen corresponding path program 3 times [2022-12-05 21:54:12,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:54:12,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239920329] [2022-12-05 21:54:12,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:54:12,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:54:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:54:12,702 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:12,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:54:12,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239920329] [2022-12-05 21:54:12,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239920329] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:54:12,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896621144] [2022-12-05 21:54:12,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-05 21:54:12,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:54:12,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:54:12,704 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-05 21:54:12,706 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-05 21:54:12,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-05 21:54:12,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:54:12,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-05 21:54:12,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:54:12,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:12,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:54:12,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:12,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896621144] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:54:12,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:54:12,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-12-05 21:54:12,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952006487] [2022-12-05 21:54:12,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:54:12,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 21:54:12,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:54:12,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 21:54:12,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-12-05 21:54:12,929 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 21:54:12,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 249 flow. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 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-05 21:54:12,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:54:12,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 21:54:12,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:54:13,266 INFO L130 PetriNetUnfolder]: 316/569 cut-off events. [2022-12-05 21:54:13,266 INFO L131 PetriNetUnfolder]: For 1391/1391 co-relation queries the response was YES. [2022-12-05 21:54:13,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2137 conditions, 569 events. 316/569 cut-off events. For 1391/1391 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2396 event pairs, 58 based on Foata normal form. 18/587 useless extension candidates. Maximal degree in co-relation 2054. Up to 197 conditions per place. [2022-12-05 21:54:13,269 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 76 selfloop transitions, 25 changer transitions 7/108 dead transitions. [2022-12-05 21:54:13,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 108 transitions, 783 flow [2022-12-05 21:54:13,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-05 21:54:13,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-05 21:54:13,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 85 transitions. [2022-12-05 21:54:13,270 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-12-05 21:54:13,270 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 249 flow. Second operand 12 states and 85 transitions. [2022-12-05 21:54:13,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 108 transitions, 783 flow [2022-12-05 21:54:13,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 108 transitions, 737 flow, removed 16 selfloop flow, removed 2 redundant places. [2022-12-05 21:54:13,275 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 410 flow [2022-12-05 21:54:13,275 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=410, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2022-12-05 21:54:13,275 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 36 predicate places. [2022-12-05 21:54:13,275 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 410 flow [2022-12-05 21:54:13,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 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-05 21:54:13,276 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:54:13,276 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:54:13,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-05 21:54:13,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:54:13,481 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 21:54:13,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:54:13,481 INFO L85 PathProgramCache]: Analyzing trace with hash 585713, now seen corresponding path program 4 times [2022-12-05 21:54:13,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:54:13,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163147252] [2022-12-05 21:54:13,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:54:13,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:54:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:54:13,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:13,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:54:13,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163147252] [2022-12-05 21:54:13,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163147252] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:54:13,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25822339] [2022-12-05 21:54:13,646 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-05 21:54:13,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:54:13,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:54:13,647 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-05 21:54:13,674 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-05 21:54:13,695 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-05 21:54:13,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:54:13,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-05 21:54:13,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:54:13,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:13,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:54:13,916 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:13,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25822339] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:54:13,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:54:13,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 15 [2022-12-05 21:54:13,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909077753] [2022-12-05 21:54:13,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:54:13,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-05 21:54:13,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:54:13,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-05 21:54:13,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-12-05 21:54:13,918 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 21:54:13,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 410 flow. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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-05 21:54:13,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:54:13,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 21:54:13,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:54:14,739 INFO L130 PetriNetUnfolder]: 576/1080 cut-off events. [2022-12-05 21:54:14,739 INFO L131 PetriNetUnfolder]: For 6356/6356 co-relation queries the response was YES. [2022-12-05 21:54:14,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4967 conditions, 1080 events. 576/1080 cut-off events. For 6356/6356 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5734 event pairs, 9 based on Foata normal form. 40/1120 useless extension candidates. Maximal degree in co-relation 4685. Up to 419 conditions per place. [2022-12-05 21:54:14,745 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 100 selfloop transitions, 71 changer transitions 60/231 dead transitions. [2022-12-05 21:54:14,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 231 transitions, 1893 flow [2022-12-05 21:54:14,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-05 21:54:14,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-05 21:54:14,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 181 transitions. [2022-12-05 21:54:14,766 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.430952380952381 [2022-12-05 21:54:14,766 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 410 flow. Second operand 28 states and 181 transitions. [2022-12-05 21:54:14,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 231 transitions, 1893 flow [2022-12-05 21:54:14,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 231 transitions, 1766 flow, removed 58 selfloop flow, removed 3 redundant places. [2022-12-05 21:54:14,777 INFO L231 Difference]: Finished difference. Result has 98 places, 103 transitions, 1089 flow [2022-12-05 21:54:14,777 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1089, PETRI_PLACES=98, PETRI_TRANSITIONS=103} [2022-12-05 21:54:14,778 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 78 predicate places. [2022-12-05 21:54:14,778 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 103 transitions, 1089 flow [2022-12-05 21:54:14,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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-05 21:54:14,778 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:54:14,778 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:54:14,789 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-05 21:54:14,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:54:14,985 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 21:54:14,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:54:14,986 INFO L85 PathProgramCache]: Analyzing trace with hash -2082959363, now seen corresponding path program 5 times [2022-12-05 21:54:14,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:54:14,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894839101] [2022-12-05 21:54:14,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:54:14,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:54:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:54:15,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:15,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:54:15,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894839101] [2022-12-05 21:54:15,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894839101] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:54:15,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145350204] [2022-12-05 21:54:15,088 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-05 21:54:15,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:54:15,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:54:15,090 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-05 21:54:15,092 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-05 21:54:15,136 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-05 21:54:15,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:54:15,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-05 21:54:15,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:54:15,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:15,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:54:15,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:15,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145350204] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:54:15,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:54:15,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 15 [2022-12-05 21:54:15,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299264307] [2022-12-05 21:54:15,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:54:15,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-05 21:54:15,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:54:15,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-05 21:54:15,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-12-05 21:54:15,359 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 21:54:15,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 103 transitions, 1089 flow. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 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-05 21:54:15,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:54:15,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 21:54:15,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:54:16,264 INFO L130 PetriNetUnfolder]: 702/1383 cut-off events. [2022-12-05 21:54:16,264 INFO L131 PetriNetUnfolder]: For 18312/18312 co-relation queries the response was YES. [2022-12-05 21:54:16,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8986 conditions, 1383 events. 702/1383 cut-off events. For 18312/18312 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8192 event pairs, 80 based on Foata normal form. 18/1401 useless extension candidates. Maximal degree in co-relation 8935. Up to 525 conditions per place. [2022-12-05 21:54:16,273 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 149 selfloop transitions, 106 changer transitions 13/268 dead transitions. [2022-12-05 21:54:16,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 268 transitions, 3360 flow [2022-12-05 21:54:16,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-05 21:54:16,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-05 21:54:16,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 149 transitions. [2022-12-05 21:54:16,275 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36790123456790125 [2022-12-05 21:54:16,275 INFO L175 Difference]: Start difference. First operand has 98 places, 103 transitions, 1089 flow. Second operand 27 states and 149 transitions. [2022-12-05 21:54:16,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 268 transitions, 3360 flow [2022-12-05 21:54:16,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 268 transitions, 2888 flow, removed 223 selfloop flow, removed 7 redundant places. [2022-12-05 21:54:16,357 INFO L231 Difference]: Finished difference. Result has 120 places, 165 transitions, 1973 flow [2022-12-05 21:54:16,357 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1973, PETRI_PLACES=120, PETRI_TRANSITIONS=165} [2022-12-05 21:54:16,358 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 100 predicate places. [2022-12-05 21:54:16,358 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 165 transitions, 1973 flow [2022-12-05 21:54:16,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 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-05 21:54:16,358 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:54:16,358 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:54:16,363 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-05 21:54:16,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:54:16,563 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 21:54:16,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:54:16,563 INFO L85 PathProgramCache]: Analyzing trace with hash -594692675, now seen corresponding path program 6 times [2022-12-05 21:54:16,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:54:16,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735546879] [2022-12-05 21:54:16,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:54:16,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:54:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:54:16,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:16,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:54:16,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735546879] [2022-12-05 21:54:16,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735546879] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:54:16,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663838535] [2022-12-05 21:54:16,685 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-05 21:54:16,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:54:16,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:54:16,687 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 21:54:16,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-05 21:54:16,748 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-05 21:54:16,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:54:16,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-05 21:54:16,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:54:16,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:16,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:54:16,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:16,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663838535] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:54:16,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:54:16,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-12-05 21:54:16,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138930542] [2022-12-05 21:54:16,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:54:16,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-05 21:54:16,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:54:16,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-05 21:54:16,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-12-05 21:54:16,937 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 21:54:16,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 165 transitions, 1973 flow. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 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-05 21:54:16,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:54:16,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 21:54:16,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:54:17,726 INFO L130 PetriNetUnfolder]: 987/1933 cut-off events. [2022-12-05 21:54:17,726 INFO L131 PetriNetUnfolder]: For 47319/47319 co-relation queries the response was YES. [2022-12-05 21:54:17,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13307 conditions, 1933 events. 987/1933 cut-off events. For 47319/47319 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 12316 event pairs, 152 based on Foata normal form. 84/2017 useless extension candidates. Maximal degree in co-relation 12960. Up to 1278 conditions per place. [2022-12-05 21:54:17,741 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 233 selfloop transitions, 102 changer transitions 7/342 dead transitions. [2022-12-05 21:54:17,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 342 transitions, 4560 flow [2022-12-05 21:54:17,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-05 21:54:17,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-05 21:54:17,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 147 transitions. [2022-12-05 21:54:17,742 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-05 21:54:17,743 INFO L175 Difference]: Start difference. First operand has 120 places, 165 transitions, 1973 flow. Second operand 21 states and 147 transitions. [2022-12-05 21:54:17,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 342 transitions, 4560 flow [2022-12-05 21:54:17,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 342 transitions, 3950 flow, removed 267 selfloop flow, removed 7 redundant places. [2022-12-05 21:54:17,838 INFO L231 Difference]: Finished difference. Result has 147 places, 238 transitions, 3113 flow [2022-12-05 21:54:17,838 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=1620, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3113, PETRI_PLACES=147, PETRI_TRANSITIONS=238} [2022-12-05 21:54:17,839 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 127 predicate places. [2022-12-05 21:54:17,839 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 238 transitions, 3113 flow [2022-12-05 21:54:17,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 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-05 21:54:17,839 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:54:17,839 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:54:17,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-05 21:54:18,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:54:18,057 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 21:54:18,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:54:18,057 INFO L85 PathProgramCache]: Analyzing trace with hash -988867775, now seen corresponding path program 7 times [2022-12-05 21:54:18,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:54:18,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3035513] [2022-12-05 21:54:18,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:54:18,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:54:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:54:18,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:18,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:54:18,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3035513] [2022-12-05 21:54:18,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3035513] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:54:18,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595851881] [2022-12-05 21:54:18,180 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-05 21:54:18,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:54:18,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:54:18,182 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 21:54:18,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-05 21:54:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:54:18,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-05 21:54:18,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:54:18,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:18,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:54:18,399 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:18,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595851881] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:54:18,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:54:18,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 14 [2022-12-05 21:54:18,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220005951] [2022-12-05 21:54:18,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:54:18,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 21:54:18,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:54:18,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 21:54:18,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-12-05 21:54:18,400 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 21:54:18,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 238 transitions, 3113 flow. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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-05 21:54:18,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:54:18,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 21:54:18,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:54:19,018 INFO L130 PetriNetUnfolder]: 958/1922 cut-off events. [2022-12-05 21:54:19,018 INFO L131 PetriNetUnfolder]: For 71579/71579 co-relation queries the response was YES. [2022-12-05 21:54:19,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15351 conditions, 1922 events. 958/1922 cut-off events. For 71579/71579 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 12519 event pairs, 59 based on Foata normal form. 6/1928 useless extension candidates. Maximal degree in co-relation 14327. Up to 809 conditions per place. [2022-12-05 21:54:19,034 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 156 selfloop transitions, 132 changer transitions 4/292 dead transitions. [2022-12-05 21:54:19,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 292 transitions, 4314 flow [2022-12-05 21:54:19,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-05 21:54:19,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-05 21:54:19,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2022-12-05 21:54:19,037 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3157894736842105 [2022-12-05 21:54:19,037 INFO L175 Difference]: Start difference. First operand has 147 places, 238 transitions, 3113 flow. Second operand 19 states and 90 transitions. [2022-12-05 21:54:19,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 292 transitions, 4314 flow [2022-12-05 21:54:19,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 292 transitions, 3798 flow, removed 258 selfloop flow, removed 0 redundant places. [2022-12-05 21:54:19,208 INFO L231 Difference]: Finished difference. Result has 169 places, 248 transitions, 3159 flow [2022-12-05 21:54:19,209 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=2627, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3159, PETRI_PLACES=169, PETRI_TRANSITIONS=248} [2022-12-05 21:54:19,209 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 149 predicate places. [2022-12-05 21:54:19,210 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 248 transitions, 3159 flow [2022-12-05 21:54:19,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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-05 21:54:19,210 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:54:19,210 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:54:19,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-05 21:54:19,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:54:19,415 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 21:54:19,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:54:19,416 INFO L85 PathProgramCache]: Analyzing trace with hash -363426365, now seen corresponding path program 8 times [2022-12-05 21:54:19,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:54:19,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250430818] [2022-12-05 21:54:19,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:54:19,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:54:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:54:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:19,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:54:19,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250430818] [2022-12-05 21:54:19,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250430818] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:54:19,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184484111] [2022-12-05 21:54:19,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 21:54:19,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:54:19,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:54:19,590 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 21:54:19,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-05 21:54:19,658 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 21:54:19,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:54:19,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-05 21:54:19,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:54:19,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:19,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:54:19,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:19,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184484111] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:54:19,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:54:19,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 14 [2022-12-05 21:54:19,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750183124] [2022-12-05 21:54:19,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:54:19,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 21:54:19,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:54:19,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 21:54:19,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-12-05 21:54:19,960 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 21:54:19,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 248 transitions, 3159 flow. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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-05 21:54:19,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:54:19,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 21:54:19,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:54:20,695 INFO L130 PetriNetUnfolder]: 984/1970 cut-off events. [2022-12-05 21:54:20,696 INFO L131 PetriNetUnfolder]: For 71105/71105 co-relation queries the response was YES. [2022-12-05 21:54:20,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15478 conditions, 1970 events. 984/1970 cut-off events. For 71105/71105 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 12895 event pairs, 171 based on Foata normal form. 24/1994 useless extension candidates. Maximal degree in co-relation 14623. Up to 802 conditions per place. [2022-12-05 21:54:20,712 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 155 selfloop transitions, 151 changer transitions 5/311 dead transitions. [2022-12-05 21:54:20,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 311 transitions, 4317 flow [2022-12-05 21:54:20,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-05 21:54:20,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-05 21:54:20,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 90 transitions. [2022-12-05 21:54:20,713 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-05 21:54:20,713 INFO L175 Difference]: Start difference. First operand has 169 places, 248 transitions, 3159 flow. Second operand 15 states and 90 transitions. [2022-12-05 21:54:20,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 311 transitions, 4317 flow [2022-12-05 21:54:20,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 311 transitions, 4213 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-12-05 21:54:20,855 INFO L231 Difference]: Finished difference. Result has 178 places, 263 transitions, 3763 flow [2022-12-05 21:54:20,856 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=3012, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3763, PETRI_PLACES=178, PETRI_TRANSITIONS=263} [2022-12-05 21:54:20,856 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 158 predicate places. [2022-12-05 21:54:20,856 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 263 transitions, 3763 flow [2022-12-05 21:54:20,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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-05 21:54:20,856 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:54:20,856 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:54:20,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-05 21:54:21,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-05 21:54:21,059 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 21:54:21,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:54:21,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1612068855, now seen corresponding path program 9 times [2022-12-05 21:54:21,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:54:21,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107298684] [2022-12-05 21:54:21,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:54:21,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:54:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:54:21,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:21,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:54:21,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107298684] [2022-12-05 21:54:21,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107298684] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:54:21,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970455723] [2022-12-05 21:54:21,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-05 21:54:21,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:54:21,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:54:21,204 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 21:54:21,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-05 21:54:21,260 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-05 21:54:21,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:54:21,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-05 21:54:21,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:54:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:21,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:54:21,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:21,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970455723] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:54:21,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:54:21,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-12-05 21:54:21,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191280414] [2022-12-05 21:54:21,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:54:21,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 21:54:21,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:54:21,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 21:54:21,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-05 21:54:21,520 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 21:54:21,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 263 transitions, 3763 flow. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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-05 21:54:21,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:54:21,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 21:54:21,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:54:22,649 INFO L130 PetriNetUnfolder]: 1094/2168 cut-off events. [2022-12-05 21:54:22,649 INFO L131 PetriNetUnfolder]: For 95768/95768 co-relation queries the response was YES. [2022-12-05 21:54:22,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18419 conditions, 2168 events. 1094/2168 cut-off events. For 95768/95768 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 14392 event pairs, 229 based on Foata normal form. 66/2234 useless extension candidates. Maximal degree in co-relation 17443. Up to 1197 conditions per place. [2022-12-05 21:54:22,666 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 280 selfloop transitions, 125 changer transitions 3/408 dead transitions. [2022-12-05 21:54:22,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 408 transitions, 6284 flow [2022-12-05 21:54:22,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-05 21:54:22,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-05 21:54:22,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 141 transitions. [2022-12-05 21:54:22,668 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40869565217391307 [2022-12-05 21:54:22,668 INFO L175 Difference]: Start difference. First operand has 178 places, 263 transitions, 3763 flow. Second operand 23 states and 141 transitions. [2022-12-05 21:54:22,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 408 transitions, 6284 flow [2022-12-05 21:54:22,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 408 transitions, 6218 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-12-05 21:54:22,867 INFO L231 Difference]: Finished difference. Result has 204 places, 309 transitions, 5106 flow [2022-12-05 21:54:22,867 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=3715, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=5106, PETRI_PLACES=204, PETRI_TRANSITIONS=309} [2022-12-05 21:54:22,868 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 184 predicate places. [2022-12-05 21:54:22,868 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 309 transitions, 5106 flow [2022-12-05 21:54:22,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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-05 21:54:22,868 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:54:22,868 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:54:22,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-05 21:54:23,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:54:23,073 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 21:54:23,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:54:23,073 INFO L85 PathProgramCache]: Analyzing trace with hash 780870219, now seen corresponding path program 10 times [2022-12-05 21:54:23,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:54:23,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598250449] [2022-12-05 21:54:23,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:54:23,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:54:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:54:23,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:23,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:54:23,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598250449] [2022-12-05 21:54:23,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598250449] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:54:23,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354070716] [2022-12-05 21:54:23,196 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-05 21:54:23,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:54:23,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:54:23,209 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 21:54:23,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-05 21:54:23,256 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-05 21:54:23,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:54:23,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-05 21:54:23,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:54:23,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:23,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:54:23,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:23,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354070716] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:54:23,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:54:23,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-12-05 21:54:23,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460887428] [2022-12-05 21:54:23,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:54:23,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-05 21:54:23,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:54:23,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-05 21:54:23,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-12-05 21:54:23,471 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 21:54:23,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 309 transitions, 5106 flow. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 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-05 21:54:23,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:54:23,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 21:54:23,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:54:24,484 INFO L130 PetriNetUnfolder]: 1111/2199 cut-off events. [2022-12-05 21:54:24,484 INFO L131 PetriNetUnfolder]: For 94223/94223 co-relation queries the response was YES. [2022-12-05 21:54:24,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19559 conditions, 2199 events. 1111/2199 cut-off events. For 94223/94223 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 14539 event pairs, 182 based on Foata normal form. 24/2223 useless extension candidates. Maximal degree in co-relation 19291. Up to 1154 conditions per place. [2022-12-05 21:54:24,503 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 214 selfloop transitions, 183 changer transitions 2/399 dead transitions. [2022-12-05 21:54:24,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 399 transitions, 6635 flow [2022-12-05 21:54:24,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-05 21:54:24,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-05 21:54:24,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 135 transitions. [2022-12-05 21:54:24,505 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2022-12-05 21:54:24,505 INFO L175 Difference]: Start difference. First operand has 204 places, 309 transitions, 5106 flow. Second operand 22 states and 135 transitions. [2022-12-05 21:54:24,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 399 transitions, 6635 flow [2022-12-05 21:54:24,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 399 transitions, 6211 flow, removed 129 selfloop flow, removed 9 redundant places. [2022-12-05 21:54:24,830 INFO L231 Difference]: Finished difference. Result has 220 places, 320 transitions, 5399 flow [2022-12-05 21:54:24,831 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=4508, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=5399, PETRI_PLACES=220, PETRI_TRANSITIONS=320} [2022-12-05 21:54:24,831 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 200 predicate places. [2022-12-05 21:54:24,831 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 320 transitions, 5399 flow [2022-12-05 21:54:24,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 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-05 21:54:24,832 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:54:24,832 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:54:24,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-05 21:54:25,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-05 21:54:25,037 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 21:54:25,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:54:25,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1482114179, now seen corresponding path program 11 times [2022-12-05 21:54:25,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:54:25,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501067317] [2022-12-05 21:54:25,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:54:25,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:54:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:54:25,246 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:25,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:54:25,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501067317] [2022-12-05 21:54:25,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501067317] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:54:25,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364322889] [2022-12-05 21:54:25,246 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-05 21:54:25,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:54:25,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:54:25,261 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 21:54:25,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-05 21:54:25,312 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-05 21:54:25,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:54:25,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-05 21:54:25,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:54:25,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:25,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:54:25,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:54:25,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364322889] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:54:25,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:54:25,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 4] total 12 [2022-12-05 21:54:25,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881392606] [2022-12-05 21:54:25,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:54:25,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 21:54:25,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:54:25,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 21:54:25,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-12-05 21:54:25,627 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-05 21:54:25,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 320 transitions, 5399 flow. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 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-05 21:54:25,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:54:25,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-05 21:54:25,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:54:26,485 INFO L130 PetriNetUnfolder]: 1514/2978 cut-off events. [2022-12-05 21:54:26,485 INFO L131 PetriNetUnfolder]: For 137419/137422 co-relation queries the response was YES. [2022-12-05 21:54:26,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28143 conditions, 2978 events. 1514/2978 cut-off events. For 137419/137422 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 21051 event pairs, 145 based on Foata normal form. 31/3007 useless extension candidates. Maximal degree in co-relation 26376. Up to 1078 conditions per place. [2022-12-05 21:54:26,518 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 282 selfloop transitions, 154 changer transitions 89/527 dead transitions. [2022-12-05 21:54:26,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 527 transitions, 9926 flow [2022-12-05 21:54:26,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 21:54:26,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 21:54:26,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 117 transitions. [2022-12-05 21:54:26,520 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2022-12-05 21:54:26,520 INFO L175 Difference]: Start difference. First operand has 220 places, 320 transitions, 5399 flow. Second operand 14 states and 117 transitions. [2022-12-05 21:54:26,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 527 transitions, 9926 flow [2022-12-05 21:54:26,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 527 transitions, 9662 flow, removed 95 selfloop flow, removed 10 redundant places. [2022-12-05 21:54:26,981 INFO L231 Difference]: Finished difference. Result has 230 places, 365 transitions, 6744 flow [2022-12-05 21:54:26,981 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=5214, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=6744, PETRI_PLACES=230, PETRI_TRANSITIONS=365} [2022-12-05 21:54:26,982 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 210 predicate places. [2022-12-05 21:54:26,982 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 365 transitions, 6744 flow [2022-12-05 21:54:26,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 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-05 21:54:26,983 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:54:26,983 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:54:26,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-05 21:54:27,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-05 21:54:27,187 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 21:54:27,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:54:27,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1645579031, now seen corresponding path program 12 times [2022-12-05 21:54:27,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:54:27,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600252924] [2022-12-05 21:54:27,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:54:27,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:54:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:54:27,439 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:54:27,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:54:27,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600252924] [2022-12-05 21:54:27,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600252924] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:54:27,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088888153] [2022-12-05 21:54:27,439 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-05 21:54:27,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:54:27,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:54:27,456 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 21:54:27,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-05 21:54:27,534 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-05 21:54:27,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:54:27,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-05 21:54:27,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:54:27,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:54:27,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:54:27,783 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:54:27,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088888153] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:54:27,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:54:27,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 15 [2022-12-05 21:54:27,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389794092] [2022-12-05 21:54:27,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:54:27,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-05 21:54:27,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:54:27,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-05 21:54:27,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-05 21:54:27,784 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 21:54:27,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 365 transitions, 6744 flow. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 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-05 21:54:27,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:54:27,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 21:54:27,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:54:28,581 INFO L130 PetriNetUnfolder]: 1197/2376 cut-off events. [2022-12-05 21:54:28,582 INFO L131 PetriNetUnfolder]: For 135118/135118 co-relation queries the response was YES. [2022-12-05 21:54:28,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23198 conditions, 2376 events. 1197/2376 cut-off events. For 135118/135118 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 15987 event pairs, 169 based on Foata normal form. 68/2444 useless extension candidates. Maximal degree in co-relation 22252. Up to 1841 conditions per place. [2022-12-05 21:54:28,601 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 332 selfloop transitions, 92 changer transitions 27/451 dead transitions. [2022-12-05 21:54:28,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 451 transitions, 9066 flow [2022-12-05 21:54:28,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-05 21:54:28,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-05 21:54:28,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 103 transitions. [2022-12-05 21:54:28,602 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3814814814814815 [2022-12-05 21:54:28,602 INFO L175 Difference]: Start difference. First operand has 230 places, 365 transitions, 6744 flow. Second operand 18 states and 103 transitions. [2022-12-05 21:54:28,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 451 transitions, 9066 flow [2022-12-05 21:54:28,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 451 transitions, 8748 flow, removed 135 selfloop flow, removed 9 redundant places. [2022-12-05 21:54:28,938 INFO L231 Difference]: Finished difference. Result has 236 places, 378 transitions, 7150 flow [2022-12-05 21:54:28,938 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=6425, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=7150, PETRI_PLACES=236, PETRI_TRANSITIONS=378} [2022-12-05 21:54:28,938 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 216 predicate places. [2022-12-05 21:54:28,938 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 378 transitions, 7150 flow [2022-12-05 21:54:28,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 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-05 21:54:28,939 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:54:28,939 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:54:28,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-05 21:54:29,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-05 21:54:29,144 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 21:54:29,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:54:29,144 INFO L85 PathProgramCache]: Analyzing trace with hash -842654569, now seen corresponding path program 13 times [2022-12-05 21:54:29,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:54:29,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669927046] [2022-12-05 21:54:29,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:54:29,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:54:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:54:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:29,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:54:29,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669927046] [2022-12-05 21:54:29,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669927046] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:54:29,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226340488] [2022-12-05 21:54:29,291 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-05 21:54:29,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:54:29,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:54:29,293 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 21:54:29,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-05 21:54:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:54:29,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-05 21:54:29,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:54:29,412 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:29,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:54:29,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:29,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226340488] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:54:29,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:54:29,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-12-05 21:54:29,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151811181] [2022-12-05 21:54:29,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:54:29,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-05 21:54:29,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:54:29,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-05 21:54:29,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-12-05 21:54:29,843 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 21:54:29,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 378 transitions, 7150 flow. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 states have internal predecessors, (32), 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-05 21:54:29,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:54:29,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 21:54:29,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:54:32,270 INFO L130 PetriNetUnfolder]: 1429/2914 cut-off events. [2022-12-05 21:54:32,271 INFO L131 PetriNetUnfolder]: For 158257/158257 co-relation queries the response was YES. [2022-12-05 21:54:32,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29918 conditions, 2914 events. 1429/2914 cut-off events. For 158257/158257 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 21000 event pairs, 107 based on Foata normal form. 38/2952 useless extension candidates. Maximal degree in co-relation 28976. Up to 847 conditions per place. [2022-12-05 21:54:32,296 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 218 selfloop transitions, 277 changer transitions 7/502 dead transitions. [2022-12-05 21:54:32,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 502 transitions, 10788 flow [2022-12-05 21:54:32,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-05 21:54:32,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-05 21:54:32,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 117 transitions. [2022-12-05 21:54:32,298 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3391304347826087 [2022-12-05 21:54:32,298 INFO L175 Difference]: Start difference. First operand has 236 places, 378 transitions, 7150 flow. Second operand 23 states and 117 transitions. [2022-12-05 21:54:32,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 502 transitions, 10788 flow [2022-12-05 21:54:32,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 502 transitions, 10484 flow, removed 91 selfloop flow, removed 8 redundant places. [2022-12-05 21:54:32,783 INFO L231 Difference]: Finished difference. Result has 261 places, 434 transitions, 9559 flow [2022-12-05 21:54:32,783 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=6796, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=231, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=9559, PETRI_PLACES=261, PETRI_TRANSITIONS=434} [2022-12-05 21:54:32,783 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 241 predicate places. [2022-12-05 21:54:32,784 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 434 transitions, 9559 flow [2022-12-05 21:54:32,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 states have internal predecessors, (32), 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-05 21:54:32,784 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:54:32,784 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:54:32,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-05 21:54:32,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-05 21:54:32,989 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 21:54:32,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:54:32,989 INFO L85 PathProgramCache]: Analyzing trace with hash 847385339, now seen corresponding path program 14 times [2022-12-05 21:54:32,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:54:32,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184700576] [2022-12-05 21:54:32,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:54:32,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:54:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:54:33,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:33,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:54:33,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184700576] [2022-12-05 21:54:33,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184700576] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:54:33,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831985595] [2022-12-05 21:54:33,187 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 21:54:33,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:54:33,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:54:33,188 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 21:54:33,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-05 21:54:33,244 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 21:54:33,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:54:33,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-05 21:54:33,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:54:33,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:33,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:54:33,780 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:33,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831985595] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:54:33,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:54:33,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-12-05 21:54:33,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055023896] [2022-12-05 21:54:33,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:54:33,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 21:54:33,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:54:33,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 21:54:33,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2022-12-05 21:54:33,781 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 21:54:33,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 434 transitions, 9559 flow. Second operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 19 states have internal predecessors, (38), 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-05 21:54:33,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:54:33,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 21:54:33,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:54:35,827 INFO L130 PetriNetUnfolder]: 1563/3122 cut-off events. [2022-12-05 21:54:35,828 INFO L131 PetriNetUnfolder]: For 231928/231928 co-relation queries the response was YES. [2022-12-05 21:54:35,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35395 conditions, 3122 events. 1563/3122 cut-off events. For 231928/231928 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 22281 event pairs, 82 based on Foata normal form. 72/3194 useless extension candidates. Maximal degree in co-relation 34383. Up to 1081 conditions per place. [2022-12-05 21:54:35,859 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 242 selfloop transitions, 323 changer transitions 22/587 dead transitions. [2022-12-05 21:54:35,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 587 transitions, 13714 flow [2022-12-05 21:54:35,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-05 21:54:35,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-05 21:54:35,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 144 transitions. [2022-12-05 21:54:35,872 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35555555555555557 [2022-12-05 21:54:35,872 INFO L175 Difference]: Start difference. First operand has 261 places, 434 transitions, 9559 flow. Second operand 27 states and 144 transitions. [2022-12-05 21:54:35,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 587 transitions, 13714 flow [2022-12-05 21:54:36,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 587 transitions, 12633 flow, removed 503 selfloop flow, removed 10 redundant places. [2022-12-05 21:54:36,728 INFO L231 Difference]: Finished difference. Result has 285 places, 503 transitions, 11754 flow [2022-12-05 21:54:36,728 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=8804, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=258, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=11754, PETRI_PLACES=285, PETRI_TRANSITIONS=503} [2022-12-05 21:54:36,731 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 265 predicate places. [2022-12-05 21:54:36,732 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 503 transitions, 11754 flow [2022-12-05 21:54:36,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 19 states have internal predecessors, (38), 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-05 21:54:36,732 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:54:36,732 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:54:36,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-05 21:54:36,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:54:36,938 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 21:54:36,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:54:36,939 INFO L85 PathProgramCache]: Analyzing trace with hash -537612695, now seen corresponding path program 15 times [2022-12-05 21:54:36,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:54:36,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565274469] [2022-12-05 21:54:36,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:54:36,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:54:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:54:37,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:37,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:54:37,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565274469] [2022-12-05 21:54:37,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565274469] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:54:37,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809816125] [2022-12-05 21:54:37,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-05 21:54:37,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:54:37,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:54:37,104 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 21:54:37,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-05 21:54:37,158 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-05 21:54:37,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:54:37,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-05 21:54:37,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:54:37,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:37,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:54:37,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:37,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809816125] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:54:37,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:54:37,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 19 [2022-12-05 21:54:37,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527080331] [2022-12-05 21:54:37,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:54:37,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 21:54:37,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:54:37,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 21:54:37,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2022-12-05 21:54:37,746 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 21:54:37,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 503 transitions, 11754 flow. Second operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 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-05 21:54:37,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:54:37,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 21:54:37,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:54:42,519 INFO L130 PetriNetUnfolder]: 1743/3462 cut-off events. [2022-12-05 21:54:42,520 INFO L131 PetriNetUnfolder]: For 266228/266228 co-relation queries the response was YES. [2022-12-05 21:54:42,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40828 conditions, 3462 events. 1743/3462 cut-off events. For 266228/266228 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 25016 event pairs, 81 based on Foata normal form. 38/3500 useless extension candidates. Maximal degree in co-relation 39403. Up to 1849 conditions per place. [2022-12-05 21:54:42,555 INFO L137 encePairwiseOnDemand]: 6/15 looper letters, 346 selfloop transitions, 289 changer transitions 24/659 dead transitions. [2022-12-05 21:54:42,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 659 transitions, 16218 flow [2022-12-05 21:54:42,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-05 21:54:42,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-05 21:54:42,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 140 transitions. [2022-12-05 21:54:42,557 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-05 21:54:42,557 INFO L175 Difference]: Start difference. First operand has 285 places, 503 transitions, 11754 flow. Second operand 24 states and 140 transitions. [2022-12-05 21:54:42,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 659 transitions, 16218 flow [2022-12-05 21:54:43,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 659 transitions, 15928 flow, removed 120 selfloop flow, removed 11 redundant places. [2022-12-05 21:54:43,630 INFO L231 Difference]: Finished difference. Result has 310 places, 583 transitions, 14699 flow [2022-12-05 21:54:43,631 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=11483, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=221, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=14699, PETRI_PLACES=310, PETRI_TRANSITIONS=583} [2022-12-05 21:54:43,631 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 290 predicate places. [2022-12-05 21:54:43,631 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 583 transitions, 14699 flow [2022-12-05 21:54:43,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 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-05 21:54:43,631 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:54:43,631 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:54:43,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-05 21:54:43,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-05 21:54:43,836 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 21:54:43,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:54:43,837 INFO L85 PathProgramCache]: Analyzing trace with hash -740118249, now seen corresponding path program 16 times [2022-12-05 21:54:43,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:54:43,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411671673] [2022-12-05 21:54:43,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:54:43,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:54:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:54:43,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:43,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:54:43,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411671673] [2022-12-05 21:54:43,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411671673] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:54:43,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646529232] [2022-12-05 21:54:43,994 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-05 21:54:43,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:54:43,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:54:43,996 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 21:54:44,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-05 21:54:44,075 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-05 21:54:44,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:54:44,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-05 21:54:44,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:54:44,160 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:44,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:54:44,414 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:44,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646529232] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:54:44,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:54:44,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-12-05 21:54:44,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066618113] [2022-12-05 21:54:44,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:54:44,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-05 21:54:44,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:54:44,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-05 21:54:44,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-12-05 21:54:44,416 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 21:54:44,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 583 transitions, 14699 flow. Second operand has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 20 states have internal predecessors, (37), 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-05 21:54:44,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:54:44,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 21:54:44,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:54:46,464 INFO L130 PetriNetUnfolder]: 2073/4046 cut-off events. [2022-12-05 21:54:46,465 INFO L131 PetriNetUnfolder]: For 421832/421832 co-relation queries the response was YES. [2022-12-05 21:54:46,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51137 conditions, 4046 events. 2073/4046 cut-off events. For 421832/421832 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 29775 event pairs, 156 based on Foata normal form. 108/4154 useless extension candidates. Maximal degree in co-relation 49695. Up to 1209 conditions per place. [2022-12-05 21:54:46,512 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 379 selfloop transitions, 462 changer transitions 7/848 dead transitions. [2022-12-05 21:54:46,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 848 transitions, 22368 flow [2022-12-05 21:54:46,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-05 21:54:46,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-05 21:54:46,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 171 transitions. [2022-12-05 21:54:46,536 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36774193548387096 [2022-12-05 21:54:46,536 INFO L175 Difference]: Start difference. First operand has 310 places, 583 transitions, 14699 flow. Second operand 31 states and 171 transitions. [2022-12-05 21:54:46,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 848 transitions, 22368 flow [2022-12-05 21:54:48,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 848 transitions, 21022 flow, removed 622 selfloop flow, removed 10 redundant places. [2022-12-05 21:54:48,060 INFO L231 Difference]: Finished difference. Result has 342 places, 734 transitions, 19852 flow [2022-12-05 21:54:48,061 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=13729, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=328, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=19852, PETRI_PLACES=342, PETRI_TRANSITIONS=734} [2022-12-05 21:54:48,061 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 322 predicate places. [2022-12-05 21:54:48,061 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 734 transitions, 19852 flow [2022-12-05 21:54:48,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 20 states have internal predecessors, (37), 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-05 21:54:48,061 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:54:48,061 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:54:48,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-05 21:54:48,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:54:48,266 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 21:54:48,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:54:48,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1237817027, now seen corresponding path program 17 times [2022-12-05 21:54:48,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:54:48,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164269246] [2022-12-05 21:54:48,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:54:48,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:54:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:54:48,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:48,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:54:48,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164269246] [2022-12-05 21:54:48,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164269246] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:54:48,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331932923] [2022-12-05 21:54:48,421 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-05 21:54:48,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:54:48,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:54:48,424 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 21:54:48,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-05 21:54:48,477 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 21:54:48,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:54:48,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-05 21:54:48,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:54:48,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:48,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:54:49,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:49,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331932923] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:54:49,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:54:49,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-12-05 21:54:49,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12657274] [2022-12-05 21:54:49,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:54:49,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-05 21:54:49,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:54:49,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-05 21:54:49,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2022-12-05 21:54:49,026 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 21:54:49,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 734 transitions, 19852 flow. Second operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 18 states have internal predecessors, (33), 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-05 21:54:49,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:54:49,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 21:54:49,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:54:51,323 INFO L130 PetriNetUnfolder]: 2242/4337 cut-off events. [2022-12-05 21:54:51,323 INFO L131 PetriNetUnfolder]: For 449158/449158 co-relation queries the response was YES. [2022-12-05 21:54:51,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58252 conditions, 4337 events. 2242/4337 cut-off events. For 449158/449158 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 31972 event pairs, 275 based on Foata normal form. 18/4355 useless extension candidates. Maximal degree in co-relation 57675. Up to 1985 conditions per place. [2022-12-05 21:54:51,374 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 456 selfloop transitions, 373 changer transitions 18/847 dead transitions. [2022-12-05 21:54:51,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 847 transitions, 24236 flow [2022-12-05 21:54:51,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-05 21:54:51,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-05 21:54:51,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 102 transitions. [2022-12-05 21:54:51,375 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2956521739130435 [2022-12-05 21:54:51,375 INFO L175 Difference]: Start difference. First operand has 342 places, 734 transitions, 19852 flow. Second operand 23 states and 102 transitions. [2022-12-05 21:54:51,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 847 transitions, 24236 flow [2022-12-05 21:54:53,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 847 transitions, 23310 flow, removed 415 selfloop flow, removed 11 redundant places. [2022-12-05 21:54:53,604 INFO L231 Difference]: Finished difference. Result has 357 places, 774 transitions, 21668 flow [2022-12-05 21:54:53,605 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=18882, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=728, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=324, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=21668, PETRI_PLACES=357, PETRI_TRANSITIONS=774} [2022-12-05 21:54:53,605 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 337 predicate places. [2022-12-05 21:54:53,605 INFO L495 AbstractCegarLoop]: Abstraction has has 357 places, 774 transitions, 21668 flow [2022-12-05 21:54:53,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 18 states have internal predecessors, (33), 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-05 21:54:53,606 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:54:53,606 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:54:53,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-05 21:54:53,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:54:53,809 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 21:54:53,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:54:53,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1849166581, now seen corresponding path program 18 times [2022-12-05 21:54:53,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:54:53,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466264470] [2022-12-05 21:54:53,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:54:53,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:54:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:54:54,029 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:54,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:54:54,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466264470] [2022-12-05 21:54:54,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466264470] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:54:54,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116861934] [2022-12-05 21:54:54,030 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-05 21:54:54,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:54:54,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:54:54,031 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 21:54:54,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-05 21:54:54,107 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-05 21:54:54,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:54:54,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-05 21:54:54,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:54:54,243 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:54,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:54:54,393 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:54:54,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116861934] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:54:54,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:54:54,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-12-05 21:54:54,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545782608] [2022-12-05 21:54:54,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:54:54,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-05 21:54:54,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:54:54,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-05 21:54:54,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-12-05 21:54:54,394 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 21:54:54,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 774 transitions, 21668 flow. Second operand has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 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-05 21:54:54,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:54:54,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 21:54:54,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:54:58,194 INFO L130 PetriNetUnfolder]: 3577/7254 cut-off events. [2022-12-05 21:54:58,194 INFO L131 PetriNetUnfolder]: For 941155/941155 co-relation queries the response was YES. [2022-12-05 21:54:58,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99767 conditions, 7254 events. 3577/7254 cut-off events. For 941155/941155 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 60850 event pairs, 232 based on Foata normal form. 86/7340 useless extension candidates. Maximal degree in co-relation 98908. Up to 2335 conditions per place. [2022-12-05 21:54:58,281 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 1016 selfloop transitions, 358 changer transitions 40/1414 dead transitions. [2022-12-05 21:54:58,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 1414 transitions, 41433 flow [2022-12-05 21:54:58,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-05 21:54:58,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-05 21:54:58,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 192 transitions. [2022-12-05 21:54:58,285 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4413793103448276 [2022-12-05 21:54:58,285 INFO L175 Difference]: Start difference. First operand has 357 places, 774 transitions, 21668 flow. Second operand 29 states and 192 transitions. [2022-12-05 21:54:58,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 1414 transitions, 41433 flow [2022-12-05 21:55:03,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 1414 transitions, 40703 flow, removed 311 selfloop flow, removed 10 redundant places. [2022-12-05 21:55:03,044 INFO L231 Difference]: Finished difference. Result has 382 places, 990 transitions, 28388 flow [2022-12-05 21:55:03,045 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=21202, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=774, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=28388, PETRI_PLACES=382, PETRI_TRANSITIONS=990} [2022-12-05 21:55:03,046 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 362 predicate places. [2022-12-05 21:55:03,046 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 990 transitions, 28388 flow [2022-12-05 21:55:03,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 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-05 21:55:03,046 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:55:03,046 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:55:03,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-05 21:55:03,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:55:03,251 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 21:55:03,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:55:03,252 INFO L85 PathProgramCache]: Analyzing trace with hash -274847977, now seen corresponding path program 19 times [2022-12-05 21:55:03,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:55:03,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217990910] [2022-12-05 21:55:03,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:55:03,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:55:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:55:03,489 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:55:03,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:55:03,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217990910] [2022-12-05 21:55:03,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217990910] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:55:03,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820954924] [2022-12-05 21:55:03,490 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-05 21:55:03,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:55:03,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:55:03,491 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 21:55:03,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-05 21:55:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:55:03,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-05 21:55:03,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:55:03,752 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:55:03,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:55:04,009 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:55:04,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820954924] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:55:04,009 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:55:04,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-12-05 21:55:04,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102248892] [2022-12-05 21:55:04,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:55:04,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-05 21:55:04,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:55:04,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-05 21:55:04,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2022-12-05 21:55:04,010 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 21:55:04,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 990 transitions, 28388 flow. Second operand has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 states have internal predecessors, (43), 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-05 21:55:04,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:55:04,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 21:55:04,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:55:09,663 INFO L130 PetriNetUnfolder]: 3769/7617 cut-off events. [2022-12-05 21:55:09,664 INFO L131 PetriNetUnfolder]: For 903925/903925 co-relation queries the response was YES. [2022-12-05 21:55:09,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105491 conditions, 7617 events. 3769/7617 cut-off events. For 903925/903925 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 64348 event pairs, 241 based on Foata normal form. 88/7705 useless extension candidates. Maximal degree in co-relation 104600. Up to 2577 conditions per place. [2022-12-05 21:55:09,756 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 1040 selfloop transitions, 447 changer transitions 36/1523 dead transitions. [2022-12-05 21:55:09,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 1523 transitions, 44551 flow [2022-12-05 21:55:09,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-12-05 21:55:09,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-12-05 21:55:09,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 278 transitions. [2022-12-05 21:55:09,757 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3943262411347518 [2022-12-05 21:55:09,757 INFO L175 Difference]: Start difference. First operand has 382 places, 990 transitions, 28388 flow. Second operand 47 states and 278 transitions. [2022-12-05 21:55:09,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 1523 transitions, 44551 flow [2022-12-05 21:55:15,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 418 places, 1523 transitions, 42737 flow, removed 630 selfloop flow, removed 10 redundant places. [2022-12-05 21:55:15,880 INFO L231 Difference]: Finished difference. Result has 427 places, 1099 transitions, 31376 flow [2022-12-05 21:55:15,881 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=26995, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=990, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=355, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=31376, PETRI_PLACES=427, PETRI_TRANSITIONS=1099} [2022-12-05 21:55:15,881 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 407 predicate places. [2022-12-05 21:55:15,881 INFO L495 AbstractCegarLoop]: Abstraction has has 427 places, 1099 transitions, 31376 flow [2022-12-05 21:55:15,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 states have internal predecessors, (43), 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-05 21:55:15,882 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:55:15,882 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:55:15,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-05 21:55:16,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:55:16,087 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 21:55:16,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:55:16,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2139937641, now seen corresponding path program 20 times [2022-12-05 21:55:16,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:55:16,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044050008] [2022-12-05 21:55:16,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:55:16,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:55:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:55:16,261 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:55:16,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:55:16,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044050008] [2022-12-05 21:55:16,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044050008] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:55:16,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919372317] [2022-12-05 21:55:16,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 21:55:16,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:55:16,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:55:16,272 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 21:55:16,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-05 21:55:16,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 21:55:16,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:55:16,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-05 21:55:16,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:55:16,503 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:55:16,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:55:16,731 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:55:16,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919372317] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:55:16,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:55:16,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-12-05 21:55:16,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115498052] [2022-12-05 21:55:16,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:55:16,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-05 21:55:16,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:55:16,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-05 21:55:16,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-12-05 21:55:16,733 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 21:55:16,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 1099 transitions, 31376 flow. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 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-05 21:55:16,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:55:16,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 21:55:16,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:55:25,727 INFO L130 PetriNetUnfolder]: 4116/8418 cut-off events. [2022-12-05 21:55:25,727 INFO L131 PetriNetUnfolder]: For 916402/916402 co-relation queries the response was YES. [2022-12-05 21:55:25,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117494 conditions, 8418 events. 4116/8418 cut-off events. For 916402/916402 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 73606 event pairs, 414 based on Foata normal form. 32/8450 useless extension candidates. Maximal degree in co-relation 116595. Up to 2555 conditions per place. [2022-12-05 21:55:25,831 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 761 selfloop transitions, 869 changer transitions 59/1689 dead transitions. [2022-12-05 21:55:25,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 1689 transitions, 50437 flow [2022-12-05 21:55:25,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-12-05 21:55:25,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2022-12-05 21:55:25,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 362 transitions. [2022-12-05 21:55:25,834 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33059360730593607 [2022-12-05 21:55:25,835 INFO L175 Difference]: Start difference. First operand has 427 places, 1099 transitions, 31376 flow. Second operand 73 states and 362 transitions. [2022-12-05 21:55:25,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 499 places, 1689 transitions, 50437 flow [2022-12-05 21:55:32,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 1689 transitions, 49051 flow, removed 529 selfloop flow, removed 20 redundant places. [2022-12-05 21:55:32,290 INFO L231 Difference]: Finished difference. Result has 491 places, 1351 transitions, 41888 flow [2022-12-05 21:55:32,292 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=30225, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1099, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=628, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=73, PETRI_FLOW=41888, PETRI_PLACES=491, PETRI_TRANSITIONS=1351} [2022-12-05 21:55:32,292 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 471 predicate places. [2022-12-05 21:55:32,292 INFO L495 AbstractCegarLoop]: Abstraction has has 491 places, 1351 transitions, 41888 flow [2022-12-05 21:55:32,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 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-05 21:55:32,292 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:55:32,292 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:55:32,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-05 21:55:32,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-05 21:55:32,499 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 21:55:32,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:55:32,501 INFO L85 PathProgramCache]: Analyzing trace with hash -666762967, now seen corresponding path program 21 times [2022-12-05 21:55:32,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:55:32,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696978788] [2022-12-05 21:55:32,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:55:32,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:55:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:55:32,757 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:55:32,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:55:32,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696978788] [2022-12-05 21:55:32,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696978788] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:55:32,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039349296] [2022-12-05 21:55:32,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-05 21:55:32,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:55:32,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:55:32,768 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 21:55:32,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-05 21:55:32,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-05 21:55:32,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:55:32,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-05 21:55:32,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:55:32,961 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:55:32,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:55:33,199 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:55:33,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039349296] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:55:33,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:55:33,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-12-05 21:55:33,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672900761] [2022-12-05 21:55:33,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:55:33,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-05 21:55:33,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:55:33,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-05 21:55:33,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2022-12-05 21:55:33,201 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 21:55:33,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 491 places, 1351 transitions, 41888 flow. Second operand has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 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-05 21:55:33,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:55:33,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 21:55:33,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:55:40,021 INFO L130 PetriNetUnfolder]: 4086/8282 cut-off events. [2022-12-05 21:55:40,021 INFO L131 PetriNetUnfolder]: For 978836/978836 co-relation queries the response was YES. [2022-12-05 21:55:40,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118798 conditions, 8282 events. 4086/8282 cut-off events. For 978836/978836 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 71476 event pairs, 232 based on Foata normal form. 62/8344 useless extension candidates. Maximal degree in co-relation 118054. Up to 2501 conditions per place. [2022-12-05 21:55:40,132 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 657 selfloop transitions, 834 changer transitions 9/1500 dead transitions. [2022-12-05 21:55:40,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 1500 transitions, 47431 flow [2022-12-05 21:55:40,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-05 21:55:40,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2022-12-05 21:55:40,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 204 transitions. [2022-12-05 21:55:40,135 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35789473684210527 [2022-12-05 21:55:40,135 INFO L175 Difference]: Start difference. First operand has 491 places, 1351 transitions, 41888 flow. Second operand 38 states and 204 transitions. [2022-12-05 21:55:40,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 1500 transitions, 47431 flow [2022-12-05 21:55:48,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 491 places, 1500 transitions, 44763 flow, removed 1147 selfloop flow, removed 30 redundant places. [2022-12-05 21:55:48,134 INFO L231 Difference]: Finished difference. Result has 496 places, 1374 transitions, 42063 flow [2022-12-05 21:55:48,135 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=39229, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=802, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=42063, PETRI_PLACES=496, PETRI_TRANSITIONS=1374} [2022-12-05 21:55:48,136 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 476 predicate places. [2022-12-05 21:55:48,136 INFO L495 AbstractCegarLoop]: Abstraction has has 496 places, 1374 transitions, 42063 flow [2022-12-05 21:55:48,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 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-05 21:55:48,136 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:55:48,136 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:55:48,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-05 21:55:48,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-05 21:55:48,340 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 21:55:48,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:55:48,340 INFO L85 PathProgramCache]: Analyzing trace with hash -774864669, now seen corresponding path program 22 times [2022-12-05 21:55:48,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:55:48,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322564479] [2022-12-05 21:55:48,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:55:48,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:55:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:55:48,622 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:55:48,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:55:48,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322564479] [2022-12-05 21:55:48,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322564479] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:55:48,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876778003] [2022-12-05 21:55:48,623 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-05 21:55:48,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:55:48,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:55:48,624 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 21:55:48,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-05 21:55:48,682 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-05 21:55:48,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:55:48,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-05 21:55:48,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:55:48,892 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:55:48,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:55:49,134 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:55:49,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876778003] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:55:49,134 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:55:49,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-12-05 21:55:49,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240979563] [2022-12-05 21:55:49,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:55:49,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-05 21:55:49,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:55:49,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-05 21:55:49,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2022-12-05 21:55:49,135 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 21:55:49,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 496 places, 1374 transitions, 42063 flow. Second operand has 24 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 states have internal predecessors, (41), 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-05 21:55:49,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:55:49,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 21:55:49,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:55:59,976 INFO L130 PetriNetUnfolder]: 4202/8528 cut-off events. [2022-12-05 21:55:59,976 INFO L131 PetriNetUnfolder]: For 1022976/1022976 co-relation queries the response was YES. [2022-12-05 21:56:00,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121918 conditions, 8528 events. 4202/8528 cut-off events. For 1022976/1022976 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 74206 event pairs, 138 based on Foata normal form. 36/8564 useless extension candidates. Maximal degree in co-relation 120971. Up to 2573 conditions per place. [2022-12-05 21:56:00,092 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 690 selfloop transitions, 977 changer transitions 9/1676 dead transitions. [2022-12-05 21:56:00,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 1676 transitions, 50885 flow [2022-12-05 21:56:00,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-12-05 21:56:00,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2022-12-05 21:56:00,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 324 transitions. [2022-12-05 21:56:00,094 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32727272727272727 [2022-12-05 21:56:00,094 INFO L175 Difference]: Start difference. First operand has 496 places, 1374 transitions, 42063 flow. Second operand 66 states and 324 transitions. [2022-12-05 21:56:00,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 1676 transitions, 50885 flow [2022-12-05 21:56:08,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 1676 transitions, 50371 flow, removed 201 selfloop flow, removed 15 redundant places. [2022-12-05 21:56:08,339 INFO L231 Difference]: Finished difference. Result has 559 places, 1461 transitions, 47975 flow [2022-12-05 21:56:08,340 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=41517, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=890, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=66, PETRI_FLOW=47975, PETRI_PLACES=559, PETRI_TRANSITIONS=1461} [2022-12-05 21:56:08,340 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 539 predicate places. [2022-12-05 21:56:08,340 INFO L495 AbstractCegarLoop]: Abstraction has has 559 places, 1461 transitions, 47975 flow [2022-12-05 21:56:08,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 states have internal predecessors, (41), 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-05 21:56:08,341 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:56:08,341 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:56:08,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-05 21:56:08,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:56:08,545 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 21:56:08,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:56:08,545 INFO L85 PathProgramCache]: Analyzing trace with hash -424801353, now seen corresponding path program 23 times [2022-12-05 21:56:08,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:56:08,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409643205] [2022-12-05 21:56:08,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:56:08,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:56:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:56:08,769 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:56:08,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:56:08,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409643205] [2022-12-05 21:56:08,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409643205] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:56:08,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470205817] [2022-12-05 21:56:08,769 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-05 21:56:08,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:56:08,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:56:08,792 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 21:56:08,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-05 21:56:08,848 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-05 21:56:08,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:56:08,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-05 21:56:08,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:56:09,052 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:56:09,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:56:09,360 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:56:09,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470205817] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:56:09,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:56:09,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2022-12-05 21:56:09,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794651837] [2022-12-05 21:56:09,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:56:09,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 21:56:09,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:56:09,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 21:56:09,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-12-05 21:56:09,362 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 21:56:09,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 1461 transitions, 47975 flow. Second operand has 20 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:56:09,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:56:09,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 21:56:09,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:56:21,331 INFO L130 PetriNetUnfolder]: 4670/9593 cut-off events. [2022-12-05 21:56:21,331 INFO L131 PetriNetUnfolder]: For 1414569/1414569 co-relation queries the response was YES. [2022-12-05 21:56:21,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145983 conditions, 9593 events. 4670/9593 cut-off events. For 1414569/1414569 co-relation queries the response was YES. Maximal size of possible extension queue 770. Compared 85918 event pairs, 77 based on Foata normal form. 104/9697 useless extension candidates. Maximal degree in co-relation 144944. Up to 2429 conditions per place. [2022-12-05 21:56:21,463 INFO L137 encePairwiseOnDemand]: 6/15 looper letters, 706 selfloop transitions, 1025 changer transitions 14/1745 dead transitions. [2022-12-05 21:56:21,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 1745 transitions, 59276 flow [2022-12-05 21:56:21,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-12-05 21:56:21,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-12-05 21:56:21,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 224 transitions. [2022-12-05 21:56:21,465 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3393939393939394 [2022-12-05 21:56:21,465 INFO L175 Difference]: Start difference. First operand has 559 places, 1461 transitions, 47975 flow. Second operand 44 states and 224 transitions. [2022-12-05 21:56:21,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 1745 transitions, 59276 flow [2022-12-05 21:56:34,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 1745 transitions, 58526 flow, removed 225 selfloop flow, removed 39 redundant places. [2022-12-05 21:56:34,053 INFO L231 Difference]: Finished difference. Result has 570 places, 1600 transitions, 56334 flow [2022-12-05 21:56:34,054 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=47252, PETRI_DIFFERENCE_MINUEND_PLACES=520, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=906, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=56334, PETRI_PLACES=570, PETRI_TRANSITIONS=1600} [2022-12-05 21:56:34,054 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 550 predicate places. [2022-12-05 21:56:34,054 INFO L495 AbstractCegarLoop]: Abstraction has has 570 places, 1600 transitions, 56334 flow [2022-12-05 21:56:34,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:56:34,055 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:56:34,055 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:56:34,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-05 21:56:34,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:56:34,258 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 21:56:34,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:56:34,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2144334351, now seen corresponding path program 24 times [2022-12-05 21:56:34,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:56:34,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234041173] [2022-12-05 21:56:34,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:56:34,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:56:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:56:34,487 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:56:34,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:56:34,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234041173] [2022-12-05 21:56:34,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234041173] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:56:34,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635188604] [2022-12-05 21:56:34,487 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-05 21:56:34,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:56:34,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:56:34,504 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 21:56:34,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-05 21:56:34,572 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-12-05 21:56:34,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:56:34,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-05 21:56:34,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:56:34,773 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:56:34,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:56:35,006 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:56:35,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635188604] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:56:35,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:56:35,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-12-05 21:56:35,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680267860] [2022-12-05 21:56:35,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:56:35,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-05 21:56:35,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:56:35,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-05 21:56:35,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-12-05 21:56:35,007 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 21:56:35,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 1600 transitions, 56334 flow. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 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-05 21:56:35,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:56:35,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 21:56:35,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:56:48,451 INFO L130 PetriNetUnfolder]: 5113/10570 cut-off events. [2022-12-05 21:56:48,452 INFO L131 PetriNetUnfolder]: For 1669182/1669182 co-relation queries the response was YES. [2022-12-05 21:56:48,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171657 conditions, 10570 events. 5113/10570 cut-off events. For 1669182/1669182 co-relation queries the response was YES. Maximal size of possible extension queue 867. Compared 97417 event pairs, 702 based on Foata normal form. 30/10600 useless extension candidates. Maximal degree in co-relation 170931. Up to 3124 conditions per place. [2022-12-05 21:56:48,694 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 942 selfloop transitions, 975 changer transitions 7/1924 dead transitions. [2022-12-05 21:56:48,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 1924 transitions, 70988 flow [2022-12-05 21:56:48,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-12-05 21:56:48,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2022-12-05 21:56:48,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 282 transitions. [2022-12-05 21:56:48,695 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3418181818181818 [2022-12-05 21:56:48,696 INFO L175 Difference]: Start difference. First operand has 570 places, 1600 transitions, 56334 flow. Second operand 55 states and 282 transitions. [2022-12-05 21:56:48,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 1924 transitions, 70988 flow [2022-12-05 21:57:10,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 1924 transitions, 64461 flow, removed 2729 selfloop flow, removed 21 redundant places. [2022-12-05 21:57:10,761 INFO L231 Difference]: Finished difference. Result has 620 places, 1722 transitions, 60948 flow [2022-12-05 21:57:10,763 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=52217, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1593, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=858, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=60948, PETRI_PLACES=620, PETRI_TRANSITIONS=1722} [2022-12-05 21:57:10,763 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 600 predicate places. [2022-12-05 21:57:10,763 INFO L495 AbstractCegarLoop]: Abstraction has has 620 places, 1722 transitions, 60948 flow [2022-12-05 21:57:10,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 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-05 21:57:10,763 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:57:10,763 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:57:10,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-05 21:57:10,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-05 21:57:10,968 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 21:57:10,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:57:10,968 INFO L85 PathProgramCache]: Analyzing trace with hash 345710133, now seen corresponding path program 25 times [2022-12-05 21:57:10,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:57:10,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812615759] [2022-12-05 21:57:10,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:57:10,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:57:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:57:11,222 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:57:11,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:57:11,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812615759] [2022-12-05 21:57:11,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812615759] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:57:11,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757501520] [2022-12-05 21:57:11,223 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-05 21:57:11,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:57:11,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:57:11,228 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 21:57:11,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-05 21:57:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:57:11,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-05 21:57:11,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:57:11,450 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:57:11,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:58:12,291 WARN L233 SmtUtils]: Spent 40.91s on a formula simplification. DAG size of input: 78 DAG size of output: 77 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 21:58:20,284 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:58:20,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757501520] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:58:20,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:58:20,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-12-05 21:58:20,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133625097] [2022-12-05 21:58:20,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:58:20,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-05 21:58:20,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:58:20,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-05 21:58:20,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=436, Unknown=7, NotChecked=0, Total=552 [2022-12-05 21:58:20,285 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 21:58:20,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 1722 transitions, 60948 flow. Second operand has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 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-05 21:58:20,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:58:20,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 21:58:20,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:58:43,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 [1] [2022-12-05 21:58:46,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 21:58:48,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 21:58:50,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 21:58:52,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 [1] [2022-12-05 21:58:54,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 21:58:56,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 21:58:58,500 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296))) (and (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse2 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse0 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse1 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse4 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 4294967295))) (or (<= (+ .cse0 .cse1 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 .cse3)) (< 0 (+ .cse2 4294967295)) (<= (+ .cse0 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296))) (<= .cse4 .cse0) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (<= .cse4 (+ .cse0 .cse1)) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95) (<= .cse4 0))))) (let ((.cse5 (mod c_~M~0 4294967296))) (or (let ((.cse6 (- .cse5))) (and (or (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse5 8589934590 (* 4294967296 (div (+ (- 8589934590) c_thread2Thread1of1ForFork0_~i~1) 4294967296)))) (< c_thread2Thread1of1ForFork0_~i~1 (+ 4294967295 (* 4294967296 (div (+ c_thread2Thread1of1ForFork0_~i~1 .cse6 1) 4294967296))))) (or (< c_thread2Thread1of1ForFork0_~i~1 (+ (* (div (+ c_thread2Thread1of1ForFork0_~i~1 .cse6) 4294967296) 4294967296) 4294967296)) (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse5 (* (div (+ (- 8589934591) c_thread2Thread1of1ForFork0_~i~1) 4294967296) 4294967296) 8589934591))))) (not (< .cse3 .cse5)))))) is different from false [2022-12-05 21:59:00,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 21:59:02,676 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (.cse3 (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296))) (and (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int)) (let ((.cse2 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse1 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse4 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 4294967295)) (.cse0 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296))) (or (<= (+ .cse0 .cse1 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 .cse3)) (< 0 (+ .cse2 4294967295)) (<= .cse4 .cse0) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (<= .cse4 (+ .cse0 .cse1)) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95) (<= .cse4 0) (<= (+ .cse0 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 (mod (+ c_thread1Thread1of1ForFork1_~i~0 2) 4294967296))))))) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse7 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse5 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse6 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse9 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse7 4294967295))) (or (<= (+ .cse5 .cse6 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse7 .cse8)) (< 0 (+ .cse7 4294967295)) (<= (+ .cse5 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse7 .cse3)) (<= .cse9 .cse5) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (<= .cse9 (+ .cse5 .cse6)) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95) (<= .cse9 0))))) (let ((.cse10 (mod c_~M~0 4294967296))) (or (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse10 4294967295 (* (div (+ c_thread2Thread1of1ForFork0_~i~1 (- 4294967295)) 4294967296) 4294967296))) (not (< (mod c_thread2Thread1of1ForFork0_~i~1 4294967296) .cse10)) (not (< .cse8 .cse10)))) (or (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_div_aux_mod_~M~0_21_32 Int)) (let ((.cse11 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse12 (* (div (+ (- 8589934591) c_thread2Thread1of1ForFork0_~i~1) 4294967296) 4294967296))) (or (< (+ c_thread2Thread1of1ForFork0_~i~1 .cse11) (+ 8589934592 .cse3 .cse12)) (< 4294967294 (+ .cse3 (* 4294967296 aux_div_aux_mod_~M~0_21_32))) (< 4294967295 .cse11) (< (+ c_thread2Thread1of1ForFork0_~i~1 (* 8589934592 aux_div_aux_mod_~M~0_21_32) .cse11) (+ (* (div (+ .cse8 1) 4294967296) 4294967296) .cse12 4294967296))))) (< (+ (* (div (+ (- c_thread2Thread1of1ForFork0_~i~1) 8589934590) 4294967296) 4294967296) c_thread2Thread1of1ForFork0_~i~1) (+ (* 4294967296 (div (+ .cse3 (- 4294967295)) 4294967296)) 8589934592)) (< 4294967294 .cse8)) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse16 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse15 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse13 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse16 4294967295)) (.cse14 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296))) (or (<= .cse13 c_thread2Thread1of1ForFork0_~i~1) (<= (+ c_thread2Thread1of1ForFork0_~i~1 .cse14 .cse15 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse16 .cse8)) (<= .cse13 (+ c_thread2Thread1of1ForFork0_~i~1 .cse14 .cse15)) (<= .cse13 (+ c_thread2Thread1of1ForFork0_~i~1 .cse14)) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95) (< c_thread2Thread1of1ForFork0_~i~1 (+ (mod (+ c_thread2Thread1of1ForFork0_~i~1 (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296) 8589934590 (* 4294967296 (div (+ (- 8589934590) c_thread2Thread1of1ForFork0_~i~1) 4294967296)))) (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse16 4294967295)) (<= (+ c_thread2Thread1of1ForFork0_~i~1 .cse14 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse16 .cse3)))))))) is different from false [2022-12-05 21:59:04,915 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 [1] [2022-12-05 21:59:06,998 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (.cse4 (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296))) (and (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse2 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse0 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse1 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse5 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 4294967295))) (or (<= (+ .cse0 .cse1 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 .cse3)) (< 0 (+ .cse2 4294967295)) (<= (+ .cse0 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 .cse4)) (<= .cse5 .cse0) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (<= .cse5 (+ .cse0 .cse1)) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95) (<= .cse5 0))))) (let ((.cse6 (mod c_~M~0 4294967296))) (or (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse6 4294967295 (* (div (+ c_thread2Thread1of1ForFork0_~i~1 (- 4294967295)) 4294967296) 4294967296))) (not (< (mod c_thread2Thread1of1ForFork0_~i~1 4294967296) .cse6)) (not (< .cse3 .cse6)))) (or (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_div_aux_mod_~M~0_21_32 Int)) (let ((.cse7 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse8 (* (div (+ (- 8589934591) c_thread2Thread1of1ForFork0_~i~1) 4294967296) 4294967296))) (or (< (+ c_thread2Thread1of1ForFork0_~i~1 .cse7) (+ 8589934592 .cse4 .cse8)) (< 4294967294 (+ .cse4 (* 4294967296 aux_div_aux_mod_~M~0_21_32))) (< 4294967295 .cse7) (< (+ c_thread2Thread1of1ForFork0_~i~1 (* 8589934592 aux_div_aux_mod_~M~0_21_32) .cse7) (+ (* (div (+ .cse3 1) 4294967296) 4294967296) .cse8 4294967296))))) (< (+ (* (div (+ (- c_thread2Thread1of1ForFork0_~i~1) 8589934590) 4294967296) 4294967296) c_thread2Thread1of1ForFork0_~i~1) (+ (* 4294967296 (div (+ .cse4 (- 4294967295)) 4294967296)) 8589934592)) (< 4294967294 .cse3)) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse12 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse11 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse9 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse12 4294967295)) (.cse10 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296))) (or (<= .cse9 c_thread2Thread1of1ForFork0_~i~1) (<= (+ c_thread2Thread1of1ForFork0_~i~1 .cse10 .cse11 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse12 .cse3)) (<= .cse9 (+ c_thread2Thread1of1ForFork0_~i~1 .cse10 .cse11)) (<= .cse9 (+ c_thread2Thread1of1ForFork0_~i~1 .cse10)) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95) (< c_thread2Thread1of1ForFork0_~i~1 (+ (mod (+ c_thread2Thread1of1ForFork0_~i~1 (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296) 8589934590 (* 4294967296 (div (+ (- 8589934590) c_thread2Thread1of1ForFork0_~i~1) 4294967296)))) (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse12 4294967295)) (<= (+ c_thread2Thread1of1ForFork0_~i~1 .cse10 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse12 .cse4)))))))) is different from false [2022-12-05 21:59:09,049 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (.cse5 (mod c_~M~0 4294967296))) (and (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse2 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse0 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse1 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse4 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 4294967295))) (or (<= (+ .cse0 .cse1 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 .cse3)) (< 0 (+ .cse2 4294967295)) (<= (+ .cse0 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296))) (<= .cse4 .cse0) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (<= .cse4 (+ .cse0 .cse1)) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95) (<= .cse4 0))))) (or (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse5 4294967295 (* (div (+ c_thread2Thread1of1ForFork0_~i~1 (- 4294967295)) 4294967296) 4294967296))) (not (< (mod c_thread2Thread1of1ForFork0_~i~1 4294967296) .cse5))) (or (let ((.cse6 (- .cse5))) (and (or (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse5 8589934590 (* 4294967296 (div (+ (- 8589934590) c_thread2Thread1of1ForFork0_~i~1) 4294967296)))) (< c_thread2Thread1of1ForFork0_~i~1 (+ 4294967295 (* 4294967296 (div (+ c_thread2Thread1of1ForFork0_~i~1 .cse6 1) 4294967296))))) (or (< c_thread2Thread1of1ForFork0_~i~1 (+ (* (div (+ c_thread2Thread1of1ForFork0_~i~1 .cse6) 4294967296) 4294967296) 4294967296)) (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse5 (* (div (+ (- 8589934591) c_thread2Thread1of1ForFork0_~i~1) 4294967296) 4294967296) 8589934591))))) (not (< .cse3 .cse5))))) is different from false [2022-12-05 21:59:11,352 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* (div c_~M~0 4294967296) 4294967296)) (.cse16 (= c_thread2Thread1of1ForFork0_~i~1 0))) (let ((.cse1 (and (<= (+ 2 .cse2) c_~M~0) .cse16)) (.cse0 (<= 1 c_thread2Thread1of1ForFork0_~i~1)) (.cse15 (* (div (+ (- 8589934591) c_thread2Thread1of1ForFork0_~i~1) 4294967296) 4294967296)) (.cse8 (mod c_~M~0 4294967296)) (.cse12 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (.cse17 (* 4294967296 (div (+ (- 8589934590) c_thread2Thread1of1ForFork0_~i~1) 4294967296))) (.cse6 (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296))) (and (or (and (<= (+ c_thread2Thread1of1ForFork0_~i~1 1) c_thread1Thread1of1ForFork1_~i~0) .cse0 (<= (div c_thread1Thread1of1ForFork1_~i~0 4294967296) 0) (<= (+ c_~C~0 c_~counter~0) (+ (* (div (+ (- 1) c_~C~0 c_~counter~0) 4294967296) 4294967296) 4294967294))) .cse1) (or .cse1 (and .cse0 (<= (+ c_thread2Thread1of1ForFork0_~i~1 2 .cse2) c_~M~0) (<= (+ (* (div c_~counter~0 4294967296) 4294967296) 1) c_~counter~0))) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int)) (let ((.cse5 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse4 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse7 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse5 4294967295)) (.cse3 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296))) (or (<= (+ .cse3 .cse4 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse5 .cse6)) (< 0 (+ .cse5 4294967295)) (<= .cse7 .cse3) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (<= .cse7 (+ .cse3 .cse4)) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95) (<= .cse7 0) (<= (+ .cse3 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse5 (mod (+ c_thread1Thread1of1ForFork1_~i~0 2) 4294967296))))))) (< 2 .cse8) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse11 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse9 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse10 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse13 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse11 4294967295))) (or (<= (+ .cse9 .cse10 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse11 .cse12)) (< 0 (+ .cse11 4294967295)) (<= (+ .cse9 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse11 .cse6)) (<= .cse13 .cse9) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (<= .cse13 (+ .cse9 .cse10)) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95) (<= .cse13 0))))) (or (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_div_aux_mod_~M~0_21_32 Int)) (let ((.cse14 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296))) (or (< (+ c_thread2Thread1of1ForFork0_~i~1 .cse14) (+ 8589934592 .cse6 .cse15)) (< 4294967294 (+ .cse6 (* 4294967296 aux_div_aux_mod_~M~0_21_32))) (< 4294967295 .cse14) (< (+ c_thread2Thread1of1ForFork0_~i~1 (* 8589934592 aux_div_aux_mod_~M~0_21_32) .cse14) (+ (* (div (+ .cse12 1) 4294967296) 4294967296) .cse15 4294967296))))) (< (+ (* (div (+ (- c_thread2Thread1of1ForFork0_~i~1) 8589934590) 4294967296) 4294967296) c_thread2Thread1of1ForFork0_~i~1) (+ (* 4294967296 (div (+ .cse6 (- 4294967295)) 4294967296)) 8589934592)) (< 4294967294 .cse12)) (or .cse16 (= c_thread2Thread1of1ForFork0_~i~1 1)) (or (let ((.cse18 (- .cse8))) (and (or (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse8 8589934590 .cse17)) (< c_thread2Thread1of1ForFork0_~i~1 (+ 4294967295 (* 4294967296 (div (+ c_thread2Thread1of1ForFork0_~i~1 .cse18 1) 4294967296))))) (or (< c_thread2Thread1of1ForFork0_~i~1 (+ (* (div (+ c_thread2Thread1of1ForFork0_~i~1 .cse18) 4294967296) 4294967296) 4294967296)) (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse8 .cse15 8589934591))))) (not (< .cse12 .cse8))) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse22 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse21 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse19 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse22 4294967295)) (.cse20 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296))) (or (<= .cse19 c_thread2Thread1of1ForFork0_~i~1) (<= (+ c_thread2Thread1of1ForFork0_~i~1 .cse20 .cse21 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse22 .cse12)) (<= .cse19 (+ c_thread2Thread1of1ForFork0_~i~1 .cse20 .cse21)) (<= .cse19 (+ c_thread2Thread1of1ForFork0_~i~1 .cse20)) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95) (< c_thread2Thread1of1ForFork0_~i~1 (+ (mod (+ c_thread2Thread1of1ForFork0_~i~1 (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296) 8589934590 .cse17)) (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse22 4294967295)) (<= (+ c_thread2Thread1of1ForFork0_~i~1 .cse20 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse22 .cse6))))))))) is different from false [2022-12-05 21:59:30,978 WARN L233 SmtUtils]: Spent 6.51s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 21:59:41,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 21:59:44,038 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296))) (and (let ((.cse0 (* (div c_~M~0 4294967296) 4294967296))) (or (and (<= (+ 2 .cse0) c_~M~0) (= c_thread2Thread1of1ForFork0_~i~1 0)) (and (<= 1 c_thread2Thread1of1ForFork0_~i~1) (<= (+ c_thread2Thread1of1ForFork0_~i~1 2 .cse0) c_~M~0) (<= (+ (* (div c_~counter~0 4294967296) 4294967296) 1) c_~counter~0)))) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse3 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse1 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse2 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse5 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse3 4294967295))) (or (<= (+ .cse1 .cse2 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse3 .cse4)) (< 0 (+ .cse3 4294967295)) (<= (+ .cse1 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse3 (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296))) (<= .cse5 .cse1) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (<= .cse5 (+ .cse1 .cse2)) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95) (<= .cse5 0))))) (let ((.cse6 (mod c_~M~0 4294967296))) (or (let ((.cse7 (- .cse6))) (and (or (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse6 8589934590 (* 4294967296 (div (+ (- 8589934590) c_thread2Thread1of1ForFork0_~i~1) 4294967296)))) (< c_thread2Thread1of1ForFork0_~i~1 (+ 4294967295 (* 4294967296 (div (+ c_thread2Thread1of1ForFork0_~i~1 .cse7 1) 4294967296))))) (or (< c_thread2Thread1of1ForFork0_~i~1 (+ (* (div (+ c_thread2Thread1of1ForFork0_~i~1 .cse7) 4294967296) 4294967296) 4294967296)) (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse6 (* (div (+ (- 8589934591) c_thread2Thread1of1ForFork0_~i~1) 4294967296) 4294967296) 8589934591))))) (not (< .cse4 .cse6)))))) is different from false [2022-12-05 21:59:46,422 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_thread2Thread1of1ForFork0_~i~1 0)) (.cse14 (* (div (+ (- 8589934591) c_thread2Thread1of1ForFork0_~i~1) 4294967296) 4294967296)) (.cse7 (mod c_~M~0 4294967296)) (.cse11 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (.cse15 (* 4294967296 (div (+ (- 8589934590) c_thread2Thread1of1ForFork0_~i~1) 4294967296))) (.cse5 (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296))) (and (let ((.cse0 (* (div c_~M~0 4294967296) 4294967296))) (or (and (<= (+ 2 .cse0) c_~M~0) .cse1) (and (<= 1 c_thread2Thread1of1ForFork0_~i~1) (<= (+ c_thread2Thread1of1ForFork0_~i~1 2 .cse0) c_~M~0) (<= (+ (* (div c_~counter~0 4294967296) 4294967296) 1) c_~counter~0)))) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int)) (let ((.cse4 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse3 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse6 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse4 4294967295)) (.cse2 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296))) (or (<= (+ .cse2 .cse3 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse4 .cse5)) (< 0 (+ .cse4 4294967295)) (<= .cse6 .cse2) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (<= .cse6 (+ .cse2 .cse3)) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95) (<= .cse6 0) (<= (+ .cse2 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse4 (mod (+ c_thread1Thread1of1ForFork1_~i~0 2) 4294967296))))))) (< 2 .cse7) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse10 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse8 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse9 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse12 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse10 4294967295))) (or (<= (+ .cse8 .cse9 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse10 .cse11)) (< 0 (+ .cse10 4294967295)) (<= (+ .cse8 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse10 .cse5)) (<= .cse12 .cse8) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (<= .cse12 (+ .cse8 .cse9)) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95) (<= .cse12 0))))) (or (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_div_aux_mod_~M~0_21_32 Int)) (let ((.cse13 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296))) (or (< (+ c_thread2Thread1of1ForFork0_~i~1 .cse13) (+ 8589934592 .cse5 .cse14)) (< 4294967294 (+ .cse5 (* 4294967296 aux_div_aux_mod_~M~0_21_32))) (< 4294967295 .cse13) (< (+ c_thread2Thread1of1ForFork0_~i~1 (* 8589934592 aux_div_aux_mod_~M~0_21_32) .cse13) (+ (* (div (+ .cse11 1) 4294967296) 4294967296) .cse14 4294967296))))) (< (+ (* (div (+ (- c_thread2Thread1of1ForFork0_~i~1) 8589934590) 4294967296) 4294967296) c_thread2Thread1of1ForFork0_~i~1) (+ (* 4294967296 (div (+ .cse5 (- 4294967295)) 4294967296)) 8589934592)) (< 4294967294 .cse11)) (or .cse1 (= c_thread2Thread1of1ForFork0_~i~1 1)) (or (let ((.cse16 (- .cse7))) (and (or (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse7 8589934590 .cse15)) (< c_thread2Thread1of1ForFork0_~i~1 (+ 4294967295 (* 4294967296 (div (+ c_thread2Thread1of1ForFork0_~i~1 .cse16 1) 4294967296))))) (or (< c_thread2Thread1of1ForFork0_~i~1 (+ (* (div (+ c_thread2Thread1of1ForFork0_~i~1 .cse16) 4294967296) 4294967296) 4294967296)) (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse7 .cse14 8589934591))))) (not (< .cse11 .cse7))) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse20 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse19 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse17 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse20 4294967295)) (.cse18 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296))) (or (<= .cse17 c_thread2Thread1of1ForFork0_~i~1) (<= (+ c_thread2Thread1of1ForFork0_~i~1 .cse18 .cse19 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse20 .cse11)) (<= .cse17 (+ c_thread2Thread1of1ForFork0_~i~1 .cse18 .cse19)) (<= .cse17 (+ c_thread2Thread1of1ForFork0_~i~1 .cse18)) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95) (< c_thread2Thread1of1ForFork0_~i~1 (+ (mod (+ c_thread2Thread1of1ForFork0_~i~1 (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296) 8589934590 .cse15)) (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse20 4294967295)) (<= (+ c_thread2Thread1of1ForFork0_~i~1 .cse18 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse20 .cse5)))))))) is different from false [2022-12-05 21:59:48,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:00:15,865 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 [1] [2022-12-05 22:00:18,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:00:20,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:00:22,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:00:25,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:00:27,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:00:30,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:00:32,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:00:34,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:00:36,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:00:40,170 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (.cse5 (mod c_~M~0 4294967296))) (and (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse2 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse0 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse1 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse4 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 4294967295))) (or (<= (+ .cse0 .cse1 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 .cse3)) (< 0 (+ .cse2 4294967295)) (<= (+ .cse0 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296))) (<= .cse4 .cse0) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (<= .cse4 (+ .cse0 .cse1)) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95) (<= .cse4 0))))) (< (mod c_thread2Thread1of1ForFork0_~i~1 4294967296) .cse5) (or (let ((.cse6 (- .cse5))) (and (or (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse5 8589934590 (* 4294967296 (div (+ (- 8589934590) c_thread2Thread1of1ForFork0_~i~1) 4294967296)))) (< c_thread2Thread1of1ForFork0_~i~1 (+ 4294967295 (* 4294967296 (div (+ c_thread2Thread1of1ForFork0_~i~1 .cse6 1) 4294967296))))) (or (< c_thread2Thread1of1ForFork0_~i~1 (+ (* (div (+ c_thread2Thread1of1ForFork0_~i~1 .cse6) 4294967296) 4294967296) 4294967296)) (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse5 (* (div (+ (- 8589934591) c_thread2Thread1of1ForFork0_~i~1) 4294967296) 4294967296) 8589934591))))) (not (< .cse3 .cse5))))) is different from false [2022-12-05 22:00:42,543 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (* (div (+ (- 8589934591) c_thread2Thread1of1ForFork0_~i~1) 4294967296) 4294967296)) (.cse0 (mod c_~M~0 4294967296)) (.cse4 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (.cse9 (* 4294967296 (div (+ (- 8589934590) c_thread2Thread1of1ForFork0_~i~1) 4294967296))) (.cse5 (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296))) (and (< 2 .cse0) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse3 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse1 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse2 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse6 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse3 4294967295))) (or (<= (+ .cse1 .cse2 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse3 .cse4)) (< 0 (+ .cse3 4294967295)) (<= (+ .cse1 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse3 .cse5)) (<= .cse6 .cse1) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (<= .cse6 (+ .cse1 .cse2)) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95) (<= .cse6 0))))) (or (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_div_aux_mod_~M~0_21_32 Int)) (let ((.cse7 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296))) (or (< (+ c_thread2Thread1of1ForFork0_~i~1 .cse7) (+ 8589934592 .cse5 .cse8)) (< 4294967294 (+ .cse5 (* 4294967296 aux_div_aux_mod_~M~0_21_32))) (< 4294967295 .cse7) (< (+ c_thread2Thread1of1ForFork0_~i~1 (* 8589934592 aux_div_aux_mod_~M~0_21_32) .cse7) (+ (* (div (+ .cse4 1) 4294967296) 4294967296) .cse8 4294967296))))) (< (+ (* (div (+ (- c_thread2Thread1of1ForFork0_~i~1) 8589934590) 4294967296) 4294967296) c_thread2Thread1of1ForFork0_~i~1) (+ (* 4294967296 (div (+ .cse5 (- 4294967295)) 4294967296)) 8589934592)) (< 4294967294 .cse4)) (or (= c_thread2Thread1of1ForFork0_~i~1 2) (= c_thread2Thread1of1ForFork0_~i~1 0) (= c_thread2Thread1of1ForFork0_~i~1 1)) (or (let ((.cse10 (- .cse0))) (and (or (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse0 8589934590 .cse9)) (< c_thread2Thread1of1ForFork0_~i~1 (+ 4294967295 (* 4294967296 (div (+ c_thread2Thread1of1ForFork0_~i~1 .cse10 1) 4294967296))))) (or (< c_thread2Thread1of1ForFork0_~i~1 (+ (* (div (+ c_thread2Thread1of1ForFork0_~i~1 .cse10) 4294967296) 4294967296) 4294967296)) (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse0 .cse8 8589934591))))) (not (< .cse4 .cse0))) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse14 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse13 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse11 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse14 4294967295)) (.cse12 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296))) (or (<= .cse11 c_thread2Thread1of1ForFork0_~i~1) (<= (+ c_thread2Thread1of1ForFork0_~i~1 .cse12 .cse13 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse14 .cse4)) (<= .cse11 (+ c_thread2Thread1of1ForFork0_~i~1 .cse12 .cse13)) (<= .cse11 (+ c_thread2Thread1of1ForFork0_~i~1 .cse12)) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95) (< c_thread2Thread1of1ForFork0_~i~1 (+ (mod (+ c_thread2Thread1of1ForFork0_~i~1 (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296) 8589934590 .cse9)) (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse14 4294967295)) (<= (+ c_thread2Thread1of1ForFork0_~i~1 .cse12 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse14 .cse5)))))))) is different from false [2022-12-05 22:00:44,667 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~M~0 4294967296))) (and (< 2 .cse0) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse3 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse1 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse2 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse4 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse3 4294967295))) (or (<= (+ .cse1 .cse2 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse3 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296))) (< 0 (+ .cse3 4294967295)) (<= (+ .cse1 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse3 (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296))) (<= .cse4 .cse1) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (<= .cse4 (+ .cse1 .cse2)) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95) (<= .cse4 0))))) (or (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse0 4294967295 (* (div (+ c_thread2Thread1of1ForFork0_~i~1 (- 4294967295)) 4294967296) 4294967296))) (not (< (mod c_thread2Thread1of1ForFork0_~i~1 4294967296) .cse0))) (or (= c_thread2Thread1of1ForFork0_~i~1 2) (= c_thread2Thread1of1ForFork0_~i~1 0) (= c_thread2Thread1of1ForFork0_~i~1 1)))) is different from false [2022-12-05 22:00:47,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:00:49,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:00:51,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:00:53,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:01:30,363 WARN L233 SmtUtils]: Spent 11.07s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 22:01:32,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:01:34,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:01:36,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:01:38,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:01:41,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:01:43,385 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 [1] [2022-12-05 22:01:45,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:01:47,591 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 [1] [2022-12-05 22:01:49,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:01:52,382 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (mod c_~M~0 4294967296))) (let ((.cse8 (< (mod c_thread2Thread1of1ForFork0_~i~1 4294967296) .cse9)) (.cse7 (* (div (+ (- 8589934591) c_thread2Thread1of1ForFork0_~i~1) 4294967296) 4294967296)) (.cse3 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (.cse10 (* 4294967296 (div (+ (- 8589934590) c_thread2Thread1of1ForFork0_~i~1) 4294967296))) (.cse4 (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296))) (and (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse2 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse0 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse1 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse5 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 4294967295))) (or (<= (+ .cse0 .cse1 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 .cse3)) (< 0 (+ .cse2 4294967295)) (<= (+ .cse0 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 .cse4)) (<= .cse5 .cse0) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (<= .cse5 (+ .cse0 .cse1)) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95) (<= .cse5 0))))) (or (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_div_aux_mod_~M~0_21_32 Int)) (let ((.cse6 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296))) (or (< (+ c_thread2Thread1of1ForFork0_~i~1 .cse6) (+ 8589934592 .cse4 .cse7)) (< 4294967294 (+ .cse4 (* 4294967296 aux_div_aux_mod_~M~0_21_32))) (< 4294967295 .cse6) (< (+ c_thread2Thread1of1ForFork0_~i~1 (* 8589934592 aux_div_aux_mod_~M~0_21_32) .cse6) (+ (* (div (+ .cse3 1) 4294967296) 4294967296) .cse7 4294967296))))) (< (+ (* (div (+ (- c_thread2Thread1of1ForFork0_~i~1) 8589934590) 4294967296) 4294967296) c_thread2Thread1of1ForFork0_~i~1) (+ (* 4294967296 (div (+ .cse4 (- 4294967295)) 4294967296)) 8589934592)) (< 4294967294 .cse3)) .cse8 (or (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse9 4294967295 (* (div (+ c_thread2Thread1of1ForFork0_~i~1 (- 4294967295)) 4294967296) 4294967296))) (not .cse8)) (or (let ((.cse11 (- .cse9))) (and (or (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse9 8589934590 .cse10)) (< c_thread2Thread1of1ForFork0_~i~1 (+ 4294967295 (* 4294967296 (div (+ c_thread2Thread1of1ForFork0_~i~1 .cse11 1) 4294967296))))) (or (< c_thread2Thread1of1ForFork0_~i~1 (+ (* (div (+ c_thread2Thread1of1ForFork0_~i~1 .cse11) 4294967296) 4294967296) 4294967296)) (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse9 .cse7 8589934591))))) (not (< .cse3 .cse9))) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse15 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse14 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse12 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse15 4294967295)) (.cse13 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296))) (or (<= .cse12 c_thread2Thread1of1ForFork0_~i~1) (<= (+ c_thread2Thread1of1ForFork0_~i~1 .cse13 .cse14 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse15 .cse3)) (<= .cse12 (+ c_thread2Thread1of1ForFork0_~i~1 .cse13 .cse14)) (<= .cse12 (+ c_thread2Thread1of1ForFork0_~i~1 .cse13)) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95) (< c_thread2Thread1of1ForFork0_~i~1 (+ (mod (+ c_thread2Thread1of1ForFork0_~i~1 (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296) 8589934590 .cse10)) (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse15 4294967295)) (<= (+ c_thread2Thread1of1ForFork0_~i~1 .cse13 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse15 .cse4))))))))) is different from false [2022-12-05 22:02:56,365 WARN L233 SmtUtils]: Spent 13.75s on a formula simplification. DAG size of input: 50 DAG size of output: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 22:02:58,466 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296))) (and (<= (+ c_thread2Thread1of1ForFork0_~i~1 (* (div c_~M~0 4294967296) 4294967296) 1) c_~M~0) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse2 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse0 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse1 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse4 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 4294967295))) (or (<= (+ .cse0 .cse1 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 .cse3)) (< 0 (+ .cse2 4294967295)) (<= (+ .cse0 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296))) (<= .cse4 .cse0) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (<= .cse4 (+ .cse0 .cse1)) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95) (<= .cse4 0))))) (not (<= (+ 1 (div c_thread2Thread1of1ForFork0_~i~1 4294967296)) 0)) (let ((.cse5 (mod c_~M~0 4294967296))) (or (let ((.cse6 (- .cse5))) (and (or (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse5 8589934590 (* 4294967296 (div (+ (- 8589934590) c_thread2Thread1of1ForFork0_~i~1) 4294967296)))) (< c_thread2Thread1of1ForFork0_~i~1 (+ 4294967295 (* 4294967296 (div (+ c_thread2Thread1of1ForFork0_~i~1 .cse6 1) 4294967296))))) (or (< c_thread2Thread1of1ForFork0_~i~1 (+ (* (div (+ c_thread2Thread1of1ForFork0_~i~1 .cse6) 4294967296) 4294967296) 4294967296)) (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse5 (* (div (+ (- 8589934591) c_thread2Thread1of1ForFork0_~i~1) 4294967296) 4294967296) 8589934591))))) (not (< .cse3 .cse5)))))) is different from false [2022-12-05 22:03:00,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 [1] [2022-12-05 22:03:02,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:03:04,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:03:06,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:03:48,462 WARN L233 SmtUtils]: Spent 8.97s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 22:03:50,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:03:52,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:03:54,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:03:56,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:03:58,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:04:00,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:04:03,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:04:05,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:04:07,263 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 [1] [2022-12-05 22:04:09,281 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 [1] [2022-12-05 22:04:11,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:04:14,137 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (* (div (+ (- 8589934591) c_thread2Thread1of1ForFork0_~i~1) 4294967296) 4294967296)) (.cse8 (mod c_~M~0 4294967296)) (.cse3 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (.cse9 (* 4294967296 (div (+ (- 8589934590) c_thread2Thread1of1ForFork0_~i~1) 4294967296))) (.cse4 (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296))) (and (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse2 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse0 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse1 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse5 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 4294967295))) (or (<= (+ .cse0 .cse1 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 .cse3)) (< 0 (+ .cse2 4294967295)) (<= (+ .cse0 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 .cse4)) (<= .cse5 .cse0) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (<= .cse5 (+ .cse0 .cse1)) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95) (<= .cse5 0))))) (or (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_div_aux_mod_~M~0_21_32 Int)) (let ((.cse6 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296))) (or (< (+ c_thread2Thread1of1ForFork0_~i~1 .cse6) (+ 8589934592 .cse4 .cse7)) (< 4294967294 (+ .cse4 (* 4294967296 aux_div_aux_mod_~M~0_21_32))) (< 4294967295 .cse6) (< (+ c_thread2Thread1of1ForFork0_~i~1 (* 8589934592 aux_div_aux_mod_~M~0_21_32) .cse6) (+ (* (div (+ .cse3 1) 4294967296) 4294967296) .cse7 4294967296))))) (< (+ (* (div (+ (- c_thread2Thread1of1ForFork0_~i~1) 8589934590) 4294967296) 4294967296) c_thread2Thread1of1ForFork0_~i~1) (+ (* 4294967296 (div (+ .cse4 (- 4294967295)) 4294967296)) 8589934592)) (< 4294967294 .cse3)) (< (mod c_thread2Thread1of1ForFork0_~i~1 4294967296) .cse8) (or (let ((.cse10 (- .cse8))) (and (or (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse8 8589934590 .cse9)) (< c_thread2Thread1of1ForFork0_~i~1 (+ 4294967295 (* 4294967296 (div (+ c_thread2Thread1of1ForFork0_~i~1 .cse10 1) 4294967296))))) (or (< c_thread2Thread1of1ForFork0_~i~1 (+ (* (div (+ c_thread2Thread1of1ForFork0_~i~1 .cse10) 4294967296) 4294967296) 4294967296)) (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse8 .cse7 8589934591))))) (not (< .cse3 .cse8))) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse14 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse13 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse11 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse14 4294967295)) (.cse12 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296))) (or (<= .cse11 c_thread2Thread1of1ForFork0_~i~1) (<= (+ c_thread2Thread1of1ForFork0_~i~1 .cse12 .cse13 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse14 .cse3)) (<= .cse11 (+ c_thread2Thread1of1ForFork0_~i~1 .cse12 .cse13)) (<= .cse11 (+ c_thread2Thread1of1ForFork0_~i~1 .cse12)) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95) (< c_thread2Thread1of1ForFork0_~i~1 (+ (mod (+ c_thread2Thread1of1ForFork0_~i~1 (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296) 8589934590 .cse9)) (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse14 4294967295)) (<= (+ c_thread2Thread1of1ForFork0_~i~1 .cse12 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse14 .cse4)))))))) is different from false [2022-12-05 22:04:16,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:04:18,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:04:20,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:04:22,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:04:24,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:04:26,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:04:28,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:04:30,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:04:32,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:04:35,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:04:37,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:04:39,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:04:41,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:04:43,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:04:45,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:04:47,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:04:49,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:04:51,686 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 [1] [2022-12-05 22:04:53,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:04:55,727 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 [1] [2022-12-05 22:04:57,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:04:59,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:05:02,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:05:04,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:05:06,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:05:08,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:05:10,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:05:12,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:05:14,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:05:16,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:05:18,536 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (* (div (+ (- 8589934591) c_thread2Thread1of1ForFork0_~i~1) 4294967296) 4294967296)) (.cse8 (mod c_~M~0 4294967296)) (.cse3 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (.cse9 (* 4294967296 (div (+ (- 8589934590) c_thread2Thread1of1ForFork0_~i~1) 4294967296))) (.cse4 (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296))) (and (<= (+ c_thread2Thread1of1ForFork0_~i~1 (* (div c_~M~0 4294967296) 4294967296) 1) c_~M~0) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse2 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse0 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse1 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse5 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 4294967295))) (or (<= (+ .cse0 .cse1 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 .cse3)) (< 0 (+ .cse2 4294967295)) (<= (+ .cse0 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 .cse4)) (<= .cse5 .cse0) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (<= .cse5 (+ .cse0 .cse1)) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95) (<= .cse5 0))))) (not (<= (+ 1 (div c_thread2Thread1of1ForFork0_~i~1 4294967296)) 0)) (or (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_div_aux_mod_~M~0_21_32 Int)) (let ((.cse6 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296))) (or (< (+ c_thread2Thread1of1ForFork0_~i~1 .cse6) (+ 8589934592 .cse4 .cse7)) (< 4294967294 (+ .cse4 (* 4294967296 aux_div_aux_mod_~M~0_21_32))) (< 4294967295 .cse6) (< (+ c_thread2Thread1of1ForFork0_~i~1 (* 8589934592 aux_div_aux_mod_~M~0_21_32) .cse6) (+ (* (div (+ .cse3 1) 4294967296) 4294967296) .cse7 4294967296))))) (< (+ (* (div (+ (- c_thread2Thread1of1ForFork0_~i~1) 8589934590) 4294967296) 4294967296) c_thread2Thread1of1ForFork0_~i~1) (+ (* 4294967296 (div (+ .cse4 (- 4294967295)) 4294967296)) 8589934592)) (< 4294967294 .cse3)) (or (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse8 4294967295 (* (div (+ c_thread2Thread1of1ForFork0_~i~1 (- 4294967295)) 4294967296) 4294967296))) (not (< (mod c_thread2Thread1of1ForFork0_~i~1 4294967296) .cse8))) (or (let ((.cse10 (- .cse8))) (and (or (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse8 8589934590 .cse9)) (< c_thread2Thread1of1ForFork0_~i~1 (+ 4294967295 (* 4294967296 (div (+ c_thread2Thread1of1ForFork0_~i~1 .cse10 1) 4294967296))))) (or (< c_thread2Thread1of1ForFork0_~i~1 (+ (* (div (+ c_thread2Thread1of1ForFork0_~i~1 .cse10) 4294967296) 4294967296) 4294967296)) (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse8 .cse7 8589934591))))) (not (< .cse3 .cse8))) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse14 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse13 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse11 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse14 4294967295)) (.cse12 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296))) (or (<= .cse11 c_thread2Thread1of1ForFork0_~i~1) (<= (+ c_thread2Thread1of1ForFork0_~i~1 .cse12 .cse13 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse14 .cse3)) (<= .cse11 (+ c_thread2Thread1of1ForFork0_~i~1 .cse12 .cse13)) (<= .cse11 (+ c_thread2Thread1of1ForFork0_~i~1 .cse12)) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95) (< c_thread2Thread1of1ForFork0_~i~1 (+ (mod (+ c_thread2Thread1of1ForFork0_~i~1 (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296) 8589934590 .cse9)) (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse14 4294967295)) (<= (+ c_thread2Thread1of1ForFork0_~i~1 .cse12 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse14 .cse4)))))))) is different from false [2022-12-05 22:06:32,790 WARN L233 SmtUtils]: Spent 22.05s on a formula simplification. DAG size of input: 58 DAG size of output: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 22:06:34,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:06:37,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:06:39,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:06:41,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:06:43,773 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 [1] [2022-12-05 22:06:45,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:06:47,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:06:49,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:06:51,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:07:29,245 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (* (div (+ (- 8589934591) c_thread2Thread1of1ForFork0_~i~1) 4294967296) 4294967296)) (.cse3 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (.cse9 (* 4294967296 (div (+ (- 8589934590) c_thread2Thread1of1ForFork0_~i~1) 4294967296))) (.cse4 (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296))) (and (<= (+ c_thread2Thread1of1ForFork0_~i~1 (* (div c_~M~0 4294967296) 4294967296) 1) c_~M~0) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse2 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse0 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296)) (.cse1 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse5 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 4294967295))) (or (<= (+ .cse0 .cse1 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 .cse3)) (< 0 (+ .cse2 4294967295)) (<= (+ .cse0 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse2 .cse4)) (<= .cse5 .cse0) (< 2 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296)) (<= .cse5 (+ .cse0 .cse1)) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95) (<= .cse5 0))))) (not (<= (+ 1 (div c_thread2Thread1of1ForFork0_~i~1 4294967296)) 0)) (or (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_div_aux_mod_~M~0_21_32 Int)) (let ((.cse6 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296))) (or (< (+ c_thread2Thread1of1ForFork0_~i~1 .cse6) (+ 8589934592 .cse4 .cse7)) (< 4294967294 (+ .cse4 (* 4294967296 aux_div_aux_mod_~M~0_21_32))) (< 4294967295 .cse6) (< (+ c_thread2Thread1of1ForFork0_~i~1 (* 8589934592 aux_div_aux_mod_~M~0_21_32) .cse6) (+ (* (div (+ .cse3 1) 4294967296) 4294967296) .cse7 4294967296))))) (< (+ (* (div (+ (- c_thread2Thread1of1ForFork0_~i~1) 8589934590) 4294967296) 4294967296) c_thread2Thread1of1ForFork0_~i~1) (+ (* 4294967296 (div (+ .cse4 (- 4294967295)) 4294967296)) 8589934592)) (< 4294967294 .cse3)) (let ((.cse8 (mod c_~M~0 4294967296))) (or (let ((.cse10 (- .cse8))) (and (or (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse8 8589934590 .cse9)) (< c_thread2Thread1of1ForFork0_~i~1 (+ 4294967295 (* 4294967296 (div (+ c_thread2Thread1of1ForFork0_~i~1 .cse10 1) 4294967296))))) (or (< c_thread2Thread1of1ForFork0_~i~1 (+ (* (div (+ c_thread2Thread1of1ForFork0_~i~1 .cse10) 4294967296) 4294967296) 4294967296)) (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse8 .cse7 8589934591))))) (not (< .cse3 .cse8)))) (forall ((aux_div_aux_mod_aux_mod_~M~0_21_32_43 Int) (aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int) (aux_div_aux_mod_~M~0_21_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 Int)) (let ((.cse14 (* aux_div_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967296))) (let ((.cse13 (* 4294967296 aux_div_aux_mod_~M~0_21_32)) (.cse11 (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse14 4294967295)) (.cse12 (* aux_div_aux_mod_aux_mod_~M~0_21_32_43 4294967296))) (or (<= .cse11 c_thread2Thread1of1ForFork0_~i~1) (<= (+ c_thread2Thread1of1ForFork0_~i~1 .cse12 .cse13 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse14 .cse3)) (<= .cse11 (+ c_thread2Thread1of1ForFork0_~i~1 .cse12 .cse13)) (<= .cse11 (+ c_thread2Thread1of1ForFork0_~i~1 .cse12)) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95) (< c_thread2Thread1of1ForFork0_~i~1 (+ (mod (+ c_thread2Thread1of1ForFork0_~i~1 (* aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 4294967295) 1) 4294967296) 8589934590 .cse9)) (< c_thread2Thread1of1ForFork0_~i~1 (+ .cse14 4294967295)) (<= (+ c_thread2Thread1of1ForFork0_~i~1 .cse12 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_~M~0_21_32_43_95 .cse14 .cse4)))))))) is different from false [2022-12-05 22:07:31,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:07:33,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:07:35,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:07:37,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:07:39,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:07:41,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:07:43,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:07:45,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:07:47,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:07:49,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:07:51,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:07:53,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:07:55,937 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 [1] [2022-12-05 22:07:57,944 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 [1] [2022-12-05 22:07:59,964 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 [1] [2022-12-05 22:08:02,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:08:04,052 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 [1] [2022-12-05 22:08:06,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:08:08,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:08:10,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:08:12,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:08:14,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:08:16,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:08:18,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:08:20,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:08:22,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:08:24,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:08:27,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:08:29,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:08:31,798 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 [1] [2022-12-05 22:08:33,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2022-12-05 22:08:35,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-05 22:08:35,343 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-05 22:08:35,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:08:36,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-05 22:08:36,563 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-05 22:08:36,632 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-05 22:08:36,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-05 22:08:36,632 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-12-05 22:08:36,633 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-05 22:08:36,633 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-05 22:08:36,633 INFO L458 BasicCegarLoop]: Path program histogram: [25, 2, 1] [2022-12-05 22:08:36,637 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 22:08:36,637 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 22:08:36,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 10:08:36 BasicIcfg [2022-12-05 22:08:36,638 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 22:08:36,639 INFO L158 Benchmark]: Toolchain (without parser) took 868909.63ms. Allocated memory was 166.7MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 143.4MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-12-05 22:08:36,640 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 166.7MB. Free memory was 142.8MB in the beginning and 142.7MB in the end (delta: 82.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 22:08:36,640 INFO L158 Benchmark]: CACSL2BoogieTranslator took 145.82ms. Allocated memory is still 166.7MB. Free memory was 143.4MB in the beginning and 132.0MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-05 22:08:36,640 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.44ms. Allocated memory is still 166.7MB. Free memory was 132.0MB in the beginning and 130.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 22:08:36,640 INFO L158 Benchmark]: Boogie Preprocessor took 14.57ms. Allocated memory is still 166.7MB. Free memory was 130.4MB in the beginning and 128.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 22:08:36,640 INFO L158 Benchmark]: RCFGBuilder took 310.01ms. Allocated memory is still 166.7MB. Free memory was 128.9MB in the beginning and 115.2MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-05 22:08:36,640 INFO L158 Benchmark]: TraceAbstraction took 868414.85ms. Allocated memory was 166.7MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 114.6MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-12-05 22:08:36,641 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks [2022-12-05 22:08:36,644 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 Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 166.7MB. Free memory was 142.8MB in the beginning and 142.7MB in the end (delta: 82.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 145.82ms. Allocated memory is still 166.7MB. Free memory was 143.4MB in the beginning and 132.0MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.44ms. Allocated memory is still 166.7MB. Free memory was 132.0MB in the beginning and 130.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.57ms. Allocated memory is still 166.7MB. Free memory was 130.4MB in the beginning and 128.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 310.01ms. Allocated memory is still 166.7MB. Free memory was 128.9MB in the beginning and 115.2MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 868414.85ms. Allocated memory was 166.7MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 114.6MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 68 PlacesBefore, 20 PlacesAfterwards, 67 TransitionsBefore, 15 TransitionsAfterwards, 404 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 32 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 52 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 191, independent: 189, independent conditional: 189, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 191, independent: 189, independent conditional: 0, independent unconditional: 189, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 191, independent: 189, independent conditional: 0, independent unconditional: 189, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 191, independent: 189, independent conditional: 0, independent unconditional: 189, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 191, independent: 189, independent conditional: 0, independent unconditional: 189, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 191, independent: 189, independent conditional: 0, independent unconditional: 189, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 191, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 191, unknown conditional: 0, unknown unconditional: 191] , Statistics on independence cache: Total cache size (in pairs): 293, Positive cache size: 291, Positive conditional cache size: 0, Positive unconditional cache size: 291, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 89 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 868.3s, OverallIterations: 28, TraceHistogramMax: 3, PathProgramHistogramMax: 25, EmptinessCheckTime: 0.0s, AutomataDifference: 777.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 119 mSolverCounterUnknown, 3960 SdHoareTripleChecker+Valid, 268.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3960 mSDsluCounter, 454 SdHoareTripleChecker+Invalid, 257.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 317 IncrementalHoareTripleChecker+Unchecked, 325 mSDsCounter, 969 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12897 IncrementalHoareTripleChecker+Invalid, 14303 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 969 mSolverCounterUnsat, 129 mSDtfsCounter, 12897 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1613 GetRequests, 682 SyntacticMatches, 28 SemanticMatches, 903 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 11840 ImplicationChecksByTransitivity, 458.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60948occurred in iteration=27, InterpolantAutomatonStates: 708, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 81.4s InterpolantComputationTime, 883 NumberOfCodeBlocks, 874 NumberOfCodeBlocksAsserted, 83 NumberOfCheckSat, 1226 ConstructedInterpolants, 5 QuantifiedInterpolants, 11683 SizeOfPredicates, 205 NumberOfNonLiveVariables, 2993 ConjunctsInSsa, 320 ConjunctsInUnsatCore, 78 InterpolantComputations, 3 PerfectInterpolantSequences, 118/452 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown