/usr/bin/java -Xmx16000000000 -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-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 03:30:12,811 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 03:30:12,812 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 03:30:12,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 03:30:12,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 03:30:12,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 03:30:12,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 03:30:12,847 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 03:30:12,848 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 03:30:12,852 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 03:30:12,853 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 03:30:12,854 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 03:30:12,854 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 03:30:12,856 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 03:30:12,857 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 03:30:12,858 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 03:30:12,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 03:30:12,859 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 03:30:12,861 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 03:30:12,864 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 03:30:12,865 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 03:30:12,866 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 03:30:12,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 03:30:12,867 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 03:30:12,873 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 03:30:12,873 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 03:30:12,873 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 03:30:12,874 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 03:30:12,874 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 03:30:12,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 03:30:12,875 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 03:30:12,875 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 03:30:12,876 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 03:30:12,877 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 03:30:12,877 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 03:30:12,877 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 03:30:12,878 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 03:30:12,878 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 03:30:12,878 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 03:30:12,878 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 03:30:12,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 03:30:12,880 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-VariableLbe.epf [2023-01-28 03:30:12,899 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 03:30:12,899 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 03:30:12,900 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 03:30:12,901 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 03:30:12,902 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 03:30:12,902 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 03:30:12,902 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 03:30:12,902 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 03:30:12,902 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 03:30:12,902 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 03:30:12,903 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 03:30:12,903 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 03:30:12,903 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 03:30:12,903 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 03:30:12,903 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 03:30:12,903 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 03:30:12,904 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 03:30:12,904 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 03:30:12,904 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 03:30:12,905 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 03:30:12,905 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 03:30:12,909 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 03:30:12,909 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 03:30:12,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 03:30:12,910 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 03:30:12,910 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 03:30:12,910 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 03:30:12,911 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 03:30:12,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 03:30:12,911 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 03:30:12,911 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 03:30:12,911 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-01-28 03:30:13,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 03:30:13,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 03:30:13,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 03:30:13,136 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 03:30:13,136 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 03:30:13,137 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c [2023-01-28 03:30:14,294 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 03:30:14,443 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 03:30:14,444 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c [2023-01-28 03:30:14,456 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9f1d5aa5/1279a1a52d3a4034be610f581698d44d/FLAGb511f1b1f [2023-01-28 03:30:14,465 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9f1d5aa5/1279a1a52d3a4034be610f581698d44d [2023-01-28 03:30:14,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 03:30:14,468 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 03:30:14,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 03:30:14,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 03:30:14,471 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 03:30:14,472 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 03:30:14" (1/1) ... [2023-01-28 03:30:14,472 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18f3e08a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 03:30:14, skipping insertion in model container [2023-01-28 03:30:14,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 03:30:14" (1/1) ... [2023-01-28 03:30:14,477 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 03:30:14,491 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 03:30:14,605 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c[4372,4385] [2023-01-28 03:30:14,612 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 03:30:14,619 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 03:30:14,638 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c[4372,4385] [2023-01-28 03:30:14,641 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 03:30:14,647 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 03:30:14,648 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 03:30:14,652 INFO L208 MainTranslator]: Completed translation [2023-01-28 03:30:14,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 03:30:14 WrapperNode [2023-01-28 03:30:14,653 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 03:30:14,653 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 03:30:14,654 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 03:30:14,654 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 03:30:14,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 03:30:14" (1/1) ... [2023-01-28 03:30:14,665 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 03:30:14" (1/1) ... [2023-01-28 03:30:14,684 INFO L138 Inliner]: procedures = 29, calls = 95, calls flagged for inlining = 21, calls inlined = 27, statements flattened = 303 [2023-01-28 03:30:14,685 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 03:30:14,685 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 03:30:14,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 03:30:14,685 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 03:30:14,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 03:30:14" (1/1) ... [2023-01-28 03:30:14,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 03:30:14" (1/1) ... [2023-01-28 03:30:14,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 03:30:14" (1/1) ... [2023-01-28 03:30:14,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 03:30:14" (1/1) ... [2023-01-28 03:30:14,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 03:30:14" (1/1) ... [2023-01-28 03:30:14,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 03:30:14" (1/1) ... [2023-01-28 03:30:14,706 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 03:30:14" (1/1) ... [2023-01-28 03:30:14,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 03:30:14" (1/1) ... [2023-01-28 03:30:14,710 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 03:30:14,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 03:30:14,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 03:30:14,711 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 03:30:14,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 03:30:14" (1/1) ... [2023-01-28 03:30:14,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 03:30:14,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 03:30:14,740 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) [2023-01-28 03:30:14,750 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 [2023-01-28 03:30:14,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 03:30:14,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 03:30:14,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 03:30:14,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 03:30:14,778 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-28 03:30:14,778 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-28 03:30:14,778 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-28 03:30:14,778 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-28 03:30:14,778 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-28 03:30:14,778 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-28 03:30:14,779 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-01-28 03:30:14,779 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-01-28 03:30:14,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 03:30:14,779 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-01-28 03:30:14,779 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-01-28 03:30:14,779 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-01-28 03:30:14,779 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-01-28 03:30:14,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 03:30:14,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 03:30:14,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-28 03:30:14,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 03:30:14,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 03:30:14,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 03:30:14,781 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 03:30:14,870 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 03:30:14,872 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 03:30:15,368 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 03:30:15,562 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 03:30:15,562 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-01-28 03:30:15,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 03:30:15 BoogieIcfgContainer [2023-01-28 03:30:15,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 03:30:15,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 03:30:15,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 03:30:15,571 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 03:30:15,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 03:30:14" (1/3) ... [2023-01-28 03:30:15,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6895e342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 03:30:15, skipping insertion in model container [2023-01-28 03:30:15,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 03:30:14" (2/3) ... [2023-01-28 03:30:15,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6895e342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 03:30:15, skipping insertion in model container [2023-01-28 03:30:15,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 03:30:15" (3/3) ... [2023-01-28 03:30:15,573 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1-dsl.wvr.c [2023-01-28 03:30:15,584 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 03:30:15,584 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 03:30:15,584 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 03:30:15,678 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2023-01-28 03:30:15,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 262 transitions, 596 flow [2023-01-28 03:30:15,799 INFO L130 PetriNetUnfolder]: 18/234 cut-off events. [2023-01-28 03:30:15,799 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-01-28 03:30:15,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 234 events. 18/234 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 313 event pairs, 0 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 203. Up to 3 conditions per place. [2023-01-28 03:30:15,806 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 262 transitions, 596 flow [2023-01-28 03:30:15,812 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 227 places, 226 transitions, 500 flow [2023-01-28 03:30:15,814 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 03:30:15,830 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 227 places, 226 transitions, 500 flow [2023-01-28 03:30:15,836 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 227 places, 226 transitions, 500 flow [2023-01-28 03:30:15,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 227 places, 226 transitions, 500 flow [2023-01-28 03:30:15,882 INFO L130 PetriNetUnfolder]: 18/226 cut-off events. [2023-01-28 03:30:15,882 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-01-28 03:30:15,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 226 events. 18/226 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 312 event pairs, 0 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 203. Up to 3 conditions per place. [2023-01-28 03:30:15,889 INFO L119 LiptonReduction]: Number of co-enabled transitions 7920 [2023-01-28 03:30:20,698 INFO L134 LiptonReduction]: Checked pairs total: 33320 [2023-01-28 03:30:20,698 INFO L136 LiptonReduction]: Total number of compositions: 192 [2023-01-28 03:30:20,713 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 03:30:20,719 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;@7af9ef2f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 03:30:20,719 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-01-28 03:30:20,729 INFO L130 PetriNetUnfolder]: 9/64 cut-off events. [2023-01-28 03:30:20,729 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-01-28 03:30:20,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 03:30:20,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 03:30:20,730 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-01-28 03:30:20,735 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 03:30:20,735 INFO L85 PathProgramCache]: Analyzing trace with hash -773500682, now seen corresponding path program 1 times [2023-01-28 03:30:20,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 03:30:20,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408419071] [2023-01-28 03:30:20,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 03:30:20,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 03:30:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 03:30:21,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 03:30:21,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 03:30:21,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408419071] [2023-01-28 03:30:21,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408419071] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 03:30:21,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 03:30:21,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 03:30:21,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747025808] [2023-01-28 03:30:21,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 03:30:21,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 03:30:21,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 03:30:21,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 03:30:21,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 03:30:21,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 458 [2023-01-28 03:30:21,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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) [2023-01-28 03:30:21,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 03:30:21,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 458 [2023-01-28 03:30:21,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 03:30:23,824 INFO L130 PetriNetUnfolder]: 24447/32779 cut-off events. [2023-01-28 03:30:23,824 INFO L131 PetriNetUnfolder]: For 5201/5216 co-relation queries the response was YES. [2023-01-28 03:30:23,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69555 conditions, 32779 events. 24447/32779 cut-off events. For 5201/5216 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 171485 event pairs, 10465 based on Foata normal form. 4/25142 useless extension candidates. Maximal degree in co-relation 68091. Up to 12303 conditions per place. [2023-01-28 03:30:23,964 INFO L137 encePairwiseOnDemand]: 451/458 looper letters, 109 selfloop transitions, 8 changer transitions 1/138 dead transitions. [2023-01-28 03:30:23,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 138 transitions, 641 flow [2023-01-28 03:30:23,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 03:30:23,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 03:30:23,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 971 transitions. [2023-01-28 03:30:23,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5300218340611353 [2023-01-28 03:30:23,990 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 971 transitions. [2023-01-28 03:30:23,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 971 transitions. [2023-01-28 03:30:23,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 03:30:23,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 971 transitions. [2023-01-28 03:30:23,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 242.75) internal successors, (971), 4 states have internal predecessors, (971), 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) [2023-01-28 03:30:24,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 458.0) internal successors, (2290), 5 states have internal predecessors, (2290), 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) [2023-01-28 03:30:24,002 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 458.0) internal successors, (2290), 5 states have internal predecessors, (2290), 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) [2023-01-28 03:30:24,003 INFO L175 Difference]: Start difference. First operand has 75 places, 65 transitions, 178 flow. Second operand 4 states and 971 transitions. [2023-01-28 03:30:24,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 138 transitions, 641 flow [2023-01-28 03:30:24,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 138 transitions, 555 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-01-28 03:30:24,102 INFO L231 Difference]: Finished difference. Result has 68 places, 72 transitions, 199 flow [2023-01-28 03:30:24,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=68, PETRI_TRANSITIONS=72} [2023-01-28 03:30:24,105 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -7 predicate places. [2023-01-28 03:30:24,105 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 72 transitions, 199 flow [2023-01-28 03:30:24,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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) [2023-01-28 03:30:24,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 03:30:24,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 03:30:24,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 03:30:24,106 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-01-28 03:30:24,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 03:30:24,106 INFO L85 PathProgramCache]: Analyzing trace with hash -549139452, now seen corresponding path program 2 times [2023-01-28 03:30:24,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 03:30:24,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600318363] [2023-01-28 03:30:24,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 03:30:24,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 03:30:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 03:30:24,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 03:30:24,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 03:30:24,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600318363] [2023-01-28 03:30:24,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600318363] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 03:30:24,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 03:30:24,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 03:30:24,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170804267] [2023-01-28 03:30:24,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 03:30:24,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 03:30:24,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 03:30:24,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 03:30:24,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 03:30:24,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 458 [2023-01-28 03:30:24,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 72 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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) [2023-01-28 03:30:24,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 03:30:24,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 458 [2023-01-28 03:30:24,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 03:30:28,127 INFO L130 PetriNetUnfolder]: 40211/54287 cut-off events. [2023-01-28 03:30:28,128 INFO L131 PetriNetUnfolder]: For 11968/11968 co-relation queries the response was YES. [2023-01-28 03:30:28,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120541 conditions, 54287 events. 40211/54287 cut-off events. For 11968/11968 co-relation queries the response was YES. Maximal size of possible extension queue 1398. Compared 304734 event pairs, 15979 based on Foata normal form. 1/41699 useless extension candidates. Maximal degree in co-relation 43207. Up to 22845 conditions per place. [2023-01-28 03:30:28,314 INFO L137 encePairwiseOnDemand]: 451/458 looper letters, 115 selfloop transitions, 11 changer transitions 1/147 dead transitions. [2023-01-28 03:30:28,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 147 transitions, 654 flow [2023-01-28 03:30:28,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 03:30:28,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 03:30:28,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 973 transitions. [2023-01-28 03:30:28,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5311135371179039 [2023-01-28 03:30:28,316 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 973 transitions. [2023-01-28 03:30:28,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 973 transitions. [2023-01-28 03:30:28,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 03:30:28,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 973 transitions. [2023-01-28 03:30:28,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 243.25) internal successors, (973), 4 states have internal predecessors, (973), 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) [2023-01-28 03:30:28,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 458.0) internal successors, (2290), 5 states have internal predecessors, (2290), 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) [2023-01-28 03:30:28,322 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 458.0) internal successors, (2290), 5 states have internal predecessors, (2290), 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) [2023-01-28 03:30:28,322 INFO L175 Difference]: Start difference. First operand has 68 places, 72 transitions, 199 flow. Second operand 4 states and 973 transitions. [2023-01-28 03:30:28,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 147 transitions, 654 flow [2023-01-28 03:30:28,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 147 transitions, 654 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 03:30:28,329 INFO L231 Difference]: Finished difference. Result has 73 places, 79 transitions, 278 flow [2023-01-28 03:30:28,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=278, PETRI_PLACES=73, PETRI_TRANSITIONS=79} [2023-01-28 03:30:28,330 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -2 predicate places. [2023-01-28 03:30:28,330 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 79 transitions, 278 flow [2023-01-28 03:30:28,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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) [2023-01-28 03:30:28,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 03:30:28,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 03:30:28,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 03:30:28,331 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-01-28 03:30:28,331 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 03:30:28,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1731748126, now seen corresponding path program 1 times [2023-01-28 03:30:28,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 03:30:28,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039397370] [2023-01-28 03:30:28,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 03:30:28,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 03:30:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 03:30:28,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 03:30:28,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 03:30:28,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039397370] [2023-01-28 03:30:28,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039397370] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 03:30:28,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 03:30:28,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 03:30:28,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543040768] [2023-01-28 03:30:28,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 03:30:28,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 03:30:28,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 03:30:28,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 03:30:28,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 03:30:28,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 458 [2023-01-28 03:30:28,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 79 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 207.8) internal successors, (1039), 5 states have internal predecessors, (1039), 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) [2023-01-28 03:30:28,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 03:30:28,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 458 [2023-01-28 03:30:28,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 03:30:33,451 INFO L130 PetriNetUnfolder]: 52244/70746 cut-off events. [2023-01-28 03:30:33,451 INFO L131 PetriNetUnfolder]: For 34959/34959 co-relation queries the response was YES. [2023-01-28 03:30:33,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169029 conditions, 70746 events. 52244/70746 cut-off events. For 34959/34959 co-relation queries the response was YES. Maximal size of possible extension queue 1811. Compared 414211 event pairs, 34723 based on Foata normal form. 0/54996 useless extension candidates. Maximal degree in co-relation 71207. Up to 50266 conditions per place. [2023-01-28 03:30:33,736 INFO L137 encePairwiseOnDemand]: 452/458 looper letters, 121 selfloop transitions, 5 changer transitions 0/146 dead transitions. [2023-01-28 03:30:33,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 146 transitions, 753 flow [2023-01-28 03:30:33,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 03:30:33,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 03:30:33,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1112 transitions. [2023-01-28 03:30:33,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.485589519650655 [2023-01-28 03:30:33,743 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1112 transitions. [2023-01-28 03:30:33,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1112 transitions. [2023-01-28 03:30:33,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 03:30:33,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1112 transitions. [2023-01-28 03:30:33,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 222.4) internal successors, (1112), 5 states have internal predecessors, (1112), 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) [2023-01-28 03:30:33,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 458.0) internal successors, (2748), 6 states have internal predecessors, (2748), 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) [2023-01-28 03:30:33,752 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 458.0) internal successors, (2748), 6 states have internal predecessors, (2748), 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) [2023-01-28 03:30:33,752 INFO L175 Difference]: Start difference. First operand has 73 places, 79 transitions, 278 flow. Second operand 5 states and 1112 transitions. [2023-01-28 03:30:33,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 146 transitions, 753 flow [2023-01-28 03:30:33,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 146 transitions, 749 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-01-28 03:30:33,773 INFO L231 Difference]: Finished difference. Result has 80 places, 83 transitions, 324 flow [2023-01-28 03:30:33,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=324, PETRI_PLACES=80, PETRI_TRANSITIONS=83} [2023-01-28 03:30:33,774 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 5 predicate places. [2023-01-28 03:30:33,777 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 83 transitions, 324 flow [2023-01-28 03:30:33,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 207.8) internal successors, (1039), 5 states have internal predecessors, (1039), 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) [2023-01-28 03:30:33,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 03:30:33,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 03:30:33,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 03:30:33,778 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-01-28 03:30:33,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 03:30:33,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1011656969, now seen corresponding path program 1 times [2023-01-28 03:30:33,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 03:30:33,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874486352] [2023-01-28 03:30:33,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 03:30:33,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 03:30:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 03:30:33,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 03:30:33,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 03:30:33,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874486352] [2023-01-28 03:30:33,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874486352] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 03:30:33,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 03:30:33,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 03:30:33,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273518693] [2023-01-28 03:30:33,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 03:30:33,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 03:30:33,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 03:30:33,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 03:30:33,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 03:30:33,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 458 [2023-01-28 03:30:33,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 83 transitions, 324 flow. Second operand has 5 states, 5 states have (on average 207.8) internal successors, (1039), 5 states have internal predecessors, (1039), 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) [2023-01-28 03:30:33,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 03:30:33,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 458 [2023-01-28 03:30:33,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 03:30:38,342 INFO L130 PetriNetUnfolder]: 43919/59576 cut-off events. [2023-01-28 03:30:38,342 INFO L131 PetriNetUnfolder]: For 33750/33750 co-relation queries the response was YES. [2023-01-28 03:30:38,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146471 conditions, 59576 events. 43919/59576 cut-off events. For 33750/33750 co-relation queries the response was YES. Maximal size of possible extension queue 1587. Compared 341974 event pairs, 30832 based on Foata normal form. 0/50903 useless extension candidates. Maximal degree in co-relation 134447. Up to 50266 conditions per place. [2023-01-28 03:30:38,586 INFO L137 encePairwiseOnDemand]: 452/458 looper letters, 58 selfloop transitions, 2 changer transitions 51/131 dead transitions. [2023-01-28 03:30:38,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 131 transitions, 677 flow [2023-01-28 03:30:38,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 03:30:38,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 03:30:38,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1103 transitions. [2023-01-28 03:30:38,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4816593886462882 [2023-01-28 03:30:38,594 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1103 transitions. [2023-01-28 03:30:38,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1103 transitions. [2023-01-28 03:30:38,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 03:30:38,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1103 transitions. [2023-01-28 03:30:38,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 220.6) internal successors, (1103), 5 states have internal predecessors, (1103), 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) [2023-01-28 03:30:38,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 458.0) internal successors, (2748), 6 states have internal predecessors, (2748), 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) [2023-01-28 03:30:38,599 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 458.0) internal successors, (2748), 6 states have internal predecessors, (2748), 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) [2023-01-28 03:30:38,599 INFO L175 Difference]: Start difference. First operand has 80 places, 83 transitions, 324 flow. Second operand 5 states and 1103 transitions. [2023-01-28 03:30:38,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 131 transitions, 677 flow [2023-01-28 03:30:38,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 131 transitions, 673 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 03:30:38,612 INFO L231 Difference]: Finished difference. Result has 85 places, 80 transitions, 302 flow [2023-01-28 03:30:38,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=302, PETRI_PLACES=85, PETRI_TRANSITIONS=80} [2023-01-28 03:30:38,613 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 10 predicate places. [2023-01-28 03:30:38,613 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 80 transitions, 302 flow [2023-01-28 03:30:38,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 207.8) internal successors, (1039), 5 states have internal predecessors, (1039), 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) [2023-01-28 03:30:38,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 03:30:38,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 03:30:38,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 03:30:38,615 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-01-28 03:30:38,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 03:30:38,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1272608977, now seen corresponding path program 1 times [2023-01-28 03:30:38,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 03:30:38,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759443108] [2023-01-28 03:30:38,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 03:30:38,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 03:30:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 03:30:38,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 03:30:38,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 03:30:38,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759443108] [2023-01-28 03:30:38,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759443108] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 03:30:38,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471779832] [2023-01-28 03:30:38,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 03:30:38,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 03:30:38,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 03:30:38,806 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) [2023-01-28 03:30:38,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-28 03:30:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 03:30:38,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 11 conjunts are in the unsatisfiable core [2023-01-28 03:30:38,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 03:30:39,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 03:30:39,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 03:30:39,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 03:30:39,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471779832] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 03:30:39,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 03:30:39,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-01-28 03:30:39,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704486886] [2023-01-28 03:30:39,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 03:30:39,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-01-28 03:30:39,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 03:30:39,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-01-28 03:30:39,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-01-28 03:30:39,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 458 [2023-01-28 03:30:39,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 80 transitions, 302 flow. Second operand has 11 states, 11 states have (on average 205.27272727272728) internal successors, (2258), 11 states have internal predecessors, (2258), 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) [2023-01-28 03:30:39,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 03:30:39,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 458 [2023-01-28 03:30:39,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 03:30:44,217 INFO L130 PetriNetUnfolder]: 50674/69621 cut-off events. [2023-01-28 03:30:44,217 INFO L131 PetriNetUnfolder]: For 48114/48114 co-relation queries the response was YES. [2023-01-28 03:30:44,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175548 conditions, 69621 events. 50674/69621 cut-off events. For 48114/48114 co-relation queries the response was YES. Maximal size of possible extension queue 1807. Compared 428541 event pairs, 15551 based on Foata normal form. 3638/69221 useless extension candidates. Maximal degree in co-relation 175527. Up to 28288 conditions per place. [2023-01-28 03:30:44,521 INFO L137 encePairwiseOnDemand]: 450/458 looper letters, 159 selfloop transitions, 8 changer transitions 0/187 dead transitions. [2023-01-28 03:30:44,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 187 transitions, 1059 flow [2023-01-28 03:30:44,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 03:30:44,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 03:30:44,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1544 transitions. [2023-01-28 03:30:44,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4815970056144729 [2023-01-28 03:30:44,524 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1544 transitions. [2023-01-28 03:30:44,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1544 transitions. [2023-01-28 03:30:44,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 03:30:44,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1544 transitions. [2023-01-28 03:30:44,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 220.57142857142858) internal successors, (1544), 7 states have internal predecessors, (1544), 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) [2023-01-28 03:30:44,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 458.0) internal successors, (3664), 8 states have internal predecessors, (3664), 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) [2023-01-28 03:30:44,531 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 458.0) internal successors, (3664), 8 states have internal predecessors, (3664), 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) [2023-01-28 03:30:44,531 INFO L175 Difference]: Start difference. First operand has 85 places, 80 transitions, 302 flow. Second operand 7 states and 1544 transitions. [2023-01-28 03:30:44,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 187 transitions, 1059 flow [2023-01-28 03:30:44,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 187 transitions, 1035 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-01-28 03:30:44,554 INFO L231 Difference]: Finished difference. Result has 88 places, 86 transitions, 368 flow [2023-01-28 03:30:44,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=368, PETRI_PLACES=88, PETRI_TRANSITIONS=86} [2023-01-28 03:30:44,555 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 13 predicate places. [2023-01-28 03:30:44,555 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 368 flow [2023-01-28 03:30:44,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 205.27272727272728) internal successors, (2258), 11 states have internal predecessors, (2258), 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) [2023-01-28 03:30:44,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 03:30:44,556 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 03:30:44,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-01-28 03:30:44,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 03:30:44,761 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-01-28 03:30:44,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 03:30:44,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2079067074, now seen corresponding path program 1 times [2023-01-28 03:30:44,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 03:30:44,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318278992] [2023-01-28 03:30:44,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 03:30:44,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 03:30:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 03:30:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 03:30:45,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 03:30:45,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318278992] [2023-01-28 03:30:45,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318278992] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 03:30:45,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92170938] [2023-01-28 03:30:45,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 03:30:45,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 03:30:45,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 03:30:45,079 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) [2023-01-28 03:30:45,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-28 03:30:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 03:30:45,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 13 conjunts are in the unsatisfiable core [2023-01-28 03:30:45,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 03:30:45,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 03:30:45,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 03:30:45,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 03:30:45,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92170938] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 03:30:45,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 03:30:45,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-01-28 03:30:45,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121153696] [2023-01-28 03:30:45,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 03:30:45,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-01-28 03:30:45,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 03:30:45,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-01-28 03:30:45,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-01-28 03:30:45,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 458 [2023-01-28 03:30:45,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 86 transitions, 368 flow. Second operand has 11 states, 11 states have (on average 205.27272727272728) internal successors, (2258), 11 states have internal predecessors, (2258), 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) [2023-01-28 03:30:45,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 03:30:45,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 458 [2023-01-28 03:30:45,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 03:30:49,606 INFO L130 PetriNetUnfolder]: 40749/56313 cut-off events. [2023-01-28 03:30:49,606 INFO L131 PetriNetUnfolder]: For 64677/64677 co-relation queries the response was YES. [2023-01-28 03:30:49,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156646 conditions, 56313 events. 40749/56313 cut-off events. For 64677/64677 co-relation queries the response was YES. Maximal size of possible extension queue 1566. Compared 339564 event pairs, 12668 based on Foata normal form. 2458/55154 useless extension candidates. Maximal degree in co-relation 143767. Up to 26698 conditions per place. [2023-01-28 03:30:49,826 INFO L137 encePairwiseOnDemand]: 450/458 looper letters, 100 selfloop transitions, 5 changer transitions 51/176 dead transitions. [2023-01-28 03:30:49,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 176 transitions, 1023 flow [2023-01-28 03:30:49,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 03:30:49,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 03:30:49,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1535 transitions. [2023-01-28 03:30:49,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47878976918278227 [2023-01-28 03:30:49,830 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1535 transitions. [2023-01-28 03:30:49,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1535 transitions. [2023-01-28 03:30:49,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 03:30:49,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1535 transitions. [2023-01-28 03:30:49,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 219.28571428571428) internal successors, (1535), 7 states have internal predecessors, (1535), 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) [2023-01-28 03:30:49,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 458.0) internal successors, (3664), 8 states have internal predecessors, (3664), 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) [2023-01-28 03:30:49,836 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 458.0) internal successors, (3664), 8 states have internal predecessors, (3664), 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) [2023-01-28 03:30:49,836 INFO L175 Difference]: Start difference. First operand has 88 places, 86 transitions, 368 flow. Second operand 7 states and 1535 transitions. [2023-01-28 03:30:49,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 176 transitions, 1023 flow [2023-01-28 03:30:49,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 176 transitions, 1007 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-01-28 03:30:49,855 INFO L231 Difference]: Finished difference. Result has 96 places, 85 transitions, 362 flow [2023-01-28 03:30:49,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=362, PETRI_PLACES=96, PETRI_TRANSITIONS=85} [2023-01-28 03:30:49,857 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 21 predicate places. [2023-01-28 03:30:49,857 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 85 transitions, 362 flow [2023-01-28 03:30:49,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 205.27272727272728) internal successors, (2258), 11 states have internal predecessors, (2258), 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) [2023-01-28 03:30:49,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 03:30:49,858 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 03:30:49,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-01-28 03:30:50,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-01-28 03:30:50,063 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-01-28 03:30:50,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 03:30:50,063 INFO L85 PathProgramCache]: Analyzing trace with hash -982059132, now seen corresponding path program 1 times [2023-01-28 03:30:50,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 03:30:50,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725145763] [2023-01-28 03:30:50,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 03:30:50,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 03:30:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 03:30:50,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 03:30:50,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 03:30:50,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725145763] [2023-01-28 03:30:50,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725145763] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 03:30:50,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764602907] [2023-01-28 03:30:50,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 03:30:50,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 03:30:50,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 03:30:50,265 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) [2023-01-28 03:30:50,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-28 03:30:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 03:30:50,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 11 conjunts are in the unsatisfiable core [2023-01-28 03:30:50,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 03:30:50,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 03:30:50,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 03:30:50,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 03:30:50,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764602907] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 03:30:50,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 03:30:50,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2023-01-28 03:30:50,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798078643] [2023-01-28 03:30:50,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 03:30:50,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-01-28 03:30:50,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 03:30:50,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-01-28 03:30:50,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-01-28 03:30:50,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 458 [2023-01-28 03:30:50,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 85 transitions, 362 flow. Second operand has 13 states, 13 states have (on average 206.6153846153846) internal successors, (2686), 13 states have internal predecessors, (2686), 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) [2023-01-28 03:30:50,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 03:30:50,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 458 [2023-01-28 03:30:50,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 03:30:53,640 INFO L130 PetriNetUnfolder]: 28494/38831 cut-off events. [2023-01-28 03:30:53,641 INFO L131 PetriNetUnfolder]: For 64304/64304 co-relation queries the response was YES. [2023-01-28 03:30:53,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122203 conditions, 38831 events. 28494/38831 cut-off events. For 64304/64304 co-relation queries the response was YES. Maximal size of possible extension queue 1074. Compared 213410 event pairs, 15424 based on Foata normal form. 1152/38010 useless extension candidates. Maximal degree in co-relation 122162. Up to 32677 conditions per place. [2023-01-28 03:30:53,848 INFO L137 encePairwiseOnDemand]: 451/458 looper letters, 89 selfloop transitions, 7 changer transitions 0/116 dead transitions. [2023-01-28 03:30:53,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 116 transitions, 693 flow [2023-01-28 03:30:53,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 03:30:53,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 03:30:53,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1280 transitions. [2023-01-28 03:30:53,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4657933042212518 [2023-01-28 03:30:53,865 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1280 transitions. [2023-01-28 03:30:53,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1280 transitions. [2023-01-28 03:30:53,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 03:30:53,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1280 transitions. [2023-01-28 03:30:53,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 213.33333333333334) internal successors, (1280), 6 states have internal predecessors, (1280), 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) [2023-01-28 03:30:53,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 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) [2023-01-28 03:30:53,870 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 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) [2023-01-28 03:30:53,870 INFO L175 Difference]: Start difference. First operand has 96 places, 85 transitions, 362 flow. Second operand 6 states and 1280 transitions. [2023-01-28 03:30:53,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 116 transitions, 693 flow [2023-01-28 03:30:53,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 116 transitions, 651 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-01-28 03:30:53,891 INFO L231 Difference]: Finished difference. Result has 91 places, 87 transitions, 368 flow [2023-01-28 03:30:53,891 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=368, PETRI_PLACES=91, PETRI_TRANSITIONS=87} [2023-01-28 03:30:53,891 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 16 predicate places. [2023-01-28 03:30:53,891 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 87 transitions, 368 flow [2023-01-28 03:30:53,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 206.6153846153846) internal successors, (2686), 13 states have internal predecessors, (2686), 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) [2023-01-28 03:30:53,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 03:30:53,892 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 03:30:53,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-28 03:30:54,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 03:30:54,097 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-01-28 03:30:54,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 03:30:54,097 INFO L85 PathProgramCache]: Analyzing trace with hash -140044149, now seen corresponding path program 1 times [2023-01-28 03:30:54,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 03:30:54,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873111179] [2023-01-28 03:30:54,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 03:30:54,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 03:30:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 03:30:54,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 03:30:54,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 03:30:54,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873111179] [2023-01-28 03:30:54,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873111179] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 03:30:54,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677170001] [2023-01-28 03:30:54,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 03:30:54,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 03:30:54,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 03:30:54,265 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) [2023-01-28 03:30:54,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-28 03:30:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 03:30:54,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 13 conjunts are in the unsatisfiable core [2023-01-28 03:30:54,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 03:30:54,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 03:30:54,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 03:30:54,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 03:30:54,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677170001] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-28 03:30:54,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-28 03:30:54,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2023-01-28 03:30:54,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601148535] [2023-01-28 03:30:54,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 03:30:54,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 03:30:54,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 03:30:54,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 03:30:54,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-01-28 03:30:54,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 458 [2023-01-28 03:30:54,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 87 transitions, 368 flow. Second operand has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 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) [2023-01-28 03:30:54,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 03:30:54,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 458 [2023-01-28 03:30:54,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 03:30:56,941 INFO L130 PetriNetUnfolder]: 21901/29265 cut-off events. [2023-01-28 03:30:56,942 INFO L131 PetriNetUnfolder]: For 41498/41498 co-relation queries the response was YES. [2023-01-28 03:30:57,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92241 conditions, 29265 events. 21901/29265 cut-off events. For 41498/41498 co-relation queries the response was YES. Maximal size of possible extension queue 806. Compared 147207 event pairs, 10095 based on Foata normal form. 816/28638 useless extension candidates. Maximal degree in co-relation 92202. Up to 25062 conditions per place. [2023-01-28 03:30:57,101 INFO L137 encePairwiseOnDemand]: 451/458 looper letters, 93 selfloop transitions, 7 changer transitions 0/120 dead transitions. [2023-01-28 03:30:57,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 120 transitions, 714 flow [2023-01-28 03:30:57,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 03:30:57,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 03:30:57,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1280 transitions. [2023-01-28 03:30:57,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4657933042212518 [2023-01-28 03:30:57,107 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1280 transitions. [2023-01-28 03:30:57,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1280 transitions. [2023-01-28 03:30:57,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 03:30:57,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1280 transitions. [2023-01-28 03:30:57,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 213.33333333333334) internal successors, (1280), 6 states have internal predecessors, (1280), 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) [2023-01-28 03:30:57,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 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) [2023-01-28 03:30:57,130 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 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) [2023-01-28 03:30:57,130 INFO L175 Difference]: Start difference. First operand has 91 places, 87 transitions, 368 flow. Second operand 6 states and 1280 transitions. [2023-01-28 03:30:57,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 120 transitions, 714 flow [2023-01-28 03:30:57,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 120 transitions, 689 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-01-28 03:30:57,171 INFO L231 Difference]: Finished difference. Result has 93 places, 89 transitions, 384 flow [2023-01-28 03:30:57,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=384, PETRI_PLACES=93, PETRI_TRANSITIONS=89} [2023-01-28 03:30:57,172 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 18 predicate places. [2023-01-28 03:30:57,172 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 89 transitions, 384 flow [2023-01-28 03:30:57,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 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) [2023-01-28 03:30:57,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 03:30:57,173 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 03:30:57,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-01-28 03:30:57,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 03:30:57,378 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-01-28 03:30:57,378 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 03:30:57,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1310477910, now seen corresponding path program 1 times [2023-01-28 03:30:57,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 03:30:57,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210960063] [2023-01-28 03:30:57,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 03:30:57,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 03:30:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 03:30:58,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 03:30:58,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 03:30:58,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210960063] [2023-01-28 03:30:58,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210960063] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 03:30:58,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320086766] [2023-01-28 03:30:58,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 03:30:58,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 03:30:58,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 03:30:58,546 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) [2023-01-28 03:30:58,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-28 03:30:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 03:30:58,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 62 conjunts are in the unsatisfiable core [2023-01-28 03:30:58,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 03:30:58,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 03:30:58,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-28 03:30:59,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 03:30:59,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-28 03:30:59,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 03:30:59,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-28 03:30:59,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-01-28 03:30:59,207 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 03:30:59,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 03:30:59,382 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (and (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_496) |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_497) c_~X_0~0.base) .cse0)) (+ 1 c_~s_2~0))) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_496) |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_497) c_~X_0~0.base) .cse0)))))) is different from false [2023-01-28 03:30:59,414 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0) (+ 1 c_~s_2~0))))) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0))))))) is different from false [2023-01-28 03:30:59,432 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0) (+ c_~t_4~0 1 c_~s_2~0))))) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0))))))) is different from false [2023-01-28 03:31:00,773 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0) (+ c_~t_4~0 1 c_~s_2~0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))))) is different from false [2023-01-28 03:31:00,839 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int) (v_ArrVal_495 (Array Int Int))) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_495) |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0) (+ c_~t_4~0 1 c_~s_2~0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int) (v_ArrVal_495 (Array Int Int))) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_495) |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))))) is different from false [2023-01-28 03:31:00,904 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 03:31:00,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 216 treesize of output 146 [2023-01-28 03:31:00,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 122 [2023-01-28 03:31:00,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 114 [2023-01-28 03:31:00,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2023-01-28 03:31:01,035 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 03:31:01,036 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 03:31:01,036 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 03:31:01,151 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 03:31:01,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320086766] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 03:31:01,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 03:31:01,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 31 [2023-01-28 03:31:01,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953067583] [2023-01-28 03:31:01,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 03:31:01,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-01-28 03:31:01,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 03:31:01,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-01-28 03:31:01,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=660, Unknown=9, NotChecked=280, Total=1056 [2023-01-28 03:31:01,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 458 [2023-01-28 03:31:01,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 89 transitions, 384 flow. Second operand has 33 states, 33 states have (on average 171.15151515151516) internal successors, (5648), 33 states have internal predecessors, (5648), 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) [2023-01-28 03:31:01,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 03:31:01,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 458 [2023-01-28 03:31:01,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 03:31:11,301 INFO L130 PetriNetUnfolder]: 80622/105027 cut-off events. [2023-01-28 03:31:11,301 INFO L131 PetriNetUnfolder]: For 135851/135851 co-relation queries the response was YES. [2023-01-28 03:31:11,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327904 conditions, 105027 events. 80622/105027 cut-off events. For 135851/135851 co-relation queries the response was YES. Maximal size of possible extension queue 2137. Compared 573223 event pairs, 17446 based on Foata normal form. 1/101225 useless extension candidates. Maximal degree in co-relation 327864. Up to 45218 conditions per place. [2023-01-28 03:31:11,820 INFO L137 encePairwiseOnDemand]: 441/458 looper letters, 527 selfloop transitions, 117 changer transitions 1/655 dead transitions. [2023-01-28 03:31:11,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 655 transitions, 3884 flow [2023-01-28 03:31:11,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-01-28 03:31:11,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-01-28 03:31:11,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4427 transitions. [2023-01-28 03:31:11,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4202582115056009 [2023-01-28 03:31:11,826 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4427 transitions. [2023-01-28 03:31:11,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4427 transitions. [2023-01-28 03:31:11,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 03:31:11,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4427 transitions. [2023-01-28 03:31:11,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 192.47826086956522) internal successors, (4427), 23 states have internal predecessors, (4427), 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) [2023-01-28 03:31:11,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 458.0) internal successors, (10992), 24 states have internal predecessors, (10992), 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) [2023-01-28 03:31:11,841 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 458.0) internal successors, (10992), 24 states have internal predecessors, (10992), 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) [2023-01-28 03:31:11,842 INFO L175 Difference]: Start difference. First operand has 93 places, 89 transitions, 384 flow. Second operand 23 states and 4427 transitions. [2023-01-28 03:31:11,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 655 transitions, 3884 flow [2023-01-28 03:31:11,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 655 transitions, 3864 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-01-28 03:31:11,924 INFO L231 Difference]: Finished difference. Result has 125 places, 217 transitions, 1483 flow [2023-01-28 03:31:11,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1483, PETRI_PLACES=125, PETRI_TRANSITIONS=217} [2023-01-28 03:31:11,924 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 50 predicate places. [2023-01-28 03:31:11,924 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 217 transitions, 1483 flow [2023-01-28 03:31:11,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 171.15151515151516) internal successors, (5648), 33 states have internal predecessors, (5648), 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) [2023-01-28 03:31:11,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 03:31:11,926 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 03:31:11,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-01-28 03:31:12,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 03:31:12,131 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-01-28 03:31:12,131 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 03:31:12,131 INFO L85 PathProgramCache]: Analyzing trace with hash 906209572, now seen corresponding path program 2 times [2023-01-28 03:31:12,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 03:31:12,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861716017] [2023-01-28 03:31:12,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 03:31:12,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 03:31:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 03:31:12,993 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 03:31:12,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 03:31:12,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861716017] [2023-01-28 03:31:12,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861716017] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 03:31:12,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401611182] [2023-01-28 03:31:12,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 03:31:12,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 03:31:12,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 03:31:13,005 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) [2023-01-28 03:31:13,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-28 03:31:13,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 03:31:13,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 03:31:13,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 80 conjunts are in the unsatisfiable core [2023-01-28 03:31:13,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 03:31:13,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-28 03:31:13,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-28 03:31:13,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-28 03:31:13,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-28 03:31:13,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-28 03:31:13,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 03:31:13,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 03:31:13,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 03:31:13,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 03:31:13,973 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 03:31:13,975 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 03:31:13,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2023-01-28 03:31:14,065 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 03:31:14,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 03:31:14,182 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (and (forall ((v_ArrVal_579 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse0)))) (forall ((v_ArrVal_579 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse0)) (+ 1 c_~s_2~0))))) is different from false [2023-01-28 03:31:31,590 WARN L222 SmtUtils]: Spent 7.62s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 03:31:45,403 WARN L222 SmtUtils]: Spent 9.67s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 03:33:43,070 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 03:33:43,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 60 [2023-01-28 03:33:43,096 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 03:33:43,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 758774 treesize of output 739326 [2023-01-28 03:33:43,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1434 treesize of output 1306 [2023-01-28 03:33:43,557 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 03:33:43,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1306 treesize of output 1202 [2023-01-28 03:33:43,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1194 treesize of output 1130 [2023-01-28 03:33:43,606 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 03:33:43,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1130 treesize of output 914 [2023-01-28 03:33:43,638 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 03:33:43,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 439 treesize of output 420 [2023-01-28 03:33:43,670 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 03:33:43,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 466 treesize of output 419 [2023-01-28 03:33:45,300 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-01-28 03:33:45,349 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-28 03:33:45,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 1 [2023-01-28 03:33:49,486 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 03:33:49,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401611182] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 03:33:49,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 03:33:49,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19, 19] total 45 [2023-01-28 03:33:49,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361079392] [2023-01-28 03:33:49,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 03:33:49,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-01-28 03:33:49,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 03:33:49,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-01-28 03:33:49,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1745, Unknown=108, NotChecked=88, Total=2162 [2023-01-28 03:33:49,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 458 [2023-01-28 03:33:49,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 217 transitions, 1483 flow. Second operand has 47 states, 47 states have (on average 152.2127659574468) internal successors, (7154), 47 states have internal predecessors, (7154), 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) [2023-01-28 03:33:49,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 03:33:49,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 458 [2023-01-28 03:33:49,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 03:34:14,641 WARN L222 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 03:34:16,816 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] [2023-01-28 03:34:18,827 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] [2023-01-28 03:34:20,833 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] [2023-01-28 03:34:22,834 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] [2023-01-28 03:34:24,837 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] [2023-01-28 03:34:26,879 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] [2023-01-28 03:34:28,917 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] [2023-01-28 03:34:47,440 WARN L222 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 03:34:49,881 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] [2023-01-28 03:34:51,892 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] [2023-01-28 03:34:53,902 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] [2023-01-28 03:34:55,904 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] [2023-01-28 03:34:57,906 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] [2023-01-28 03:35:19,685 WARN L222 SmtUtils]: Spent 17.41s on a formula simplification. DAG size of input: 68 DAG size of output: 48 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 03:35:21,897 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] [2023-01-28 03:35:23,926 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] [2023-01-28 03:35:25,927 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] [2023-01-28 03:35:27,934 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] [2023-01-28 03:35:29,945 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] [2023-01-28 03:35:31,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 03:35:33,976 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] [2023-01-28 03:35:35,978 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] [2023-01-28 03:35:37,993 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] [2023-01-28 03:35:39,995 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] [2023-01-28 03:35:42,048 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] [2023-01-28 03:35:56,996 WARN L222 SmtUtils]: Spent 10.49s on a formula simplification. DAG size of input: 83 DAG size of output: 63 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 03:36:16,583 WARN L222 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 03:36:41,307 WARN L222 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 03:36:59,715 WARN L222 SmtUtils]: Spent 12.10s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 03:37:02,073 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] [2023-01-28 03:37:04,084 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] [2023-01-28 03:37:06,090 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] [2023-01-28 03:37:08,092 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] [2023-01-28 03:37:10,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 03:37:12,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 03:37:25,640 WARN L222 SmtUtils]: Spent 12.21s on a formula simplification. DAG size of input: 73 DAG size of output: 53 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 03:37:27,643 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] [2023-01-28 03:37:28,222 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))) (.cse2 (+ 1 c_~s_2~0)) (.cse1 (+ c_~X_0~0.offset 4)) (.cse0 (< c_~i_3~0 c_~n_1~0))) (and (<= 1 c_~n_1~0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (or .cse0 (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_37| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_37| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_33| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (<= c_~s_2~0 (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_37| v_ArrVal_578) |v_thread4Thread1of1ForFork0_~#t6~0.base_33| v_ArrVal_579) c_~X_0~0.base) .cse1))))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_37| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_33| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_37| v_ArrVal_578) |v_thread4Thread1of1ForFork0_~#t6~0.base_33| v_ArrVal_579) c_~X_0~0.base) .cse1) .cse2)))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_37| |c_#StackHeapBarrier|))))) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t3~0.base|) (forall ((v_ArrVal_579 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse3)))) (< c_~X_0~0.base |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (forall ((v_ArrVal_579 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse3)) .cse2)) (or .cse0 (and (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_578) |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse3)))) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_578) |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse3)) .cse2)))) (or (and (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_33| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_578) |v_thread4Thread1of1ForFork0_~#t6~0.base_33| v_ArrVal_579) c_~X_0~0.base) .cse1) .cse2)))) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_33| Int)) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (<= c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_578) |v_thread4Thread1of1ForFork0_~#t6~0.base_33| v_ArrVal_579) c_~X_0~0.base) .cse1))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_33| |c_#StackHeapBarrier|)))) .cse0) (= c_~X_0~0.offset 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2023-01-28 03:37:40,968 WARN L222 SmtUtils]: Spent 10.24s on a formula simplification. DAG size of input: 71 DAG size of output: 51 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 03:37:43,562 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] [2023-01-28 03:37:46,255 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 [0, 1] [2023-01-28 03:37:48,256 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 [0, 1] [2023-01-28 03:37:50,275 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] [2023-01-28 03:37:52,278 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 [0, 1] [2023-01-28 03:37:54,289 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] [2023-01-28 03:37:56,307 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] [2023-01-28 03:38:02,795 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 [0, 1] [2023-01-28 03:38:02,808 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1 c_~s_2~0)) (.cse5 (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (let ((.cse0 (< c_~i_3~0 c_~n_1~0)) (.cse3 (forall ((v_ArrVal_579 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse5))))) (.cse4 (forall ((v_ArrVal_579 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse5)) .cse2)))) (and (<= 1 c_~n_1~0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (or .cse0 (let ((.cse1 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_37| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_37| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_33| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (<= c_~s_2~0 (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_37| v_ArrVal_578) |v_thread4Thread1of1ForFork0_~#t6~0.base_33| v_ArrVal_579) c_~X_0~0.base) .cse1))))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_37| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_33| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_37| v_ArrVal_578) |v_thread4Thread1of1ForFork0_~#t6~0.base_33| v_ArrVal_579) c_~X_0~0.base) .cse1) .cse2)))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_37| |c_#StackHeapBarrier|)))))) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t3~0.base|) .cse3 (< c_~X_0~0.base |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|) (or .cse0 (and .cse3 .cse4)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse4 (= c_~X_0~0.offset 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|)))) is different from false [2023-01-28 03:38:05,518 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] [2023-01-28 03:38:08,167 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] [2023-01-28 03:38:10,216 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] [2023-01-28 03:38:38,537 WARN L222 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 03:38:41,495 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] [2023-01-28 03:38:43,546 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] [2023-01-28 03:38:45,549 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] [2023-01-28 03:38:47,552 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] [2023-01-28 03:38:49,555 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] [2023-01-28 03:38:51,559 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] [2023-01-28 03:39:17,710 WARN L222 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 03:39:19,713 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] [2023-01-28 03:39:21,715 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] [2023-01-28 03:39:23,716 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] [2023-01-28 03:39:25,876 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] [2023-01-28 03:39:29,230 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] [2023-01-28 03:39:31,233 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] [2023-01-28 03:39:33,236 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] [2023-01-28 03:39:35,239 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] [2023-01-28 03:39:37,242 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] [2023-01-28 03:39:39,248 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] [2023-01-28 03:39:41,250 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] [2023-01-28 03:39:43,251 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] [2023-01-28 03:39:45,255 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] [2023-01-28 03:39:48,751 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] [2023-01-28 03:39:52,424 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] [2023-01-28 03:39:55,917 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] [2023-01-28 03:39:57,921 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] [2023-01-28 03:39:59,924 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] [2023-01-28 03:40:01,928 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] [2023-01-28 03:40:05,905 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] [2023-01-28 03:40:07,909 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] [2023-01-28 03:40:09,913 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] [2023-01-28 03:40:11,918 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] [2023-01-28 03:40:16,021 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] [2023-01-28 03:40:19,747 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] [2023-01-28 03:40:21,751 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] [2023-01-28 03:40:27,008 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] [2023-01-28 03:40:30,685 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] [2023-01-28 03:40:32,688 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] [2023-01-28 03:40:34,741 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] [2023-01-28 03:40:37,671 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] [2023-01-28 03:40:39,969 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] [2023-01-28 03:40:41,970 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] [2023-01-28 03:40:43,977 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] [2023-01-28 03:40:45,079 INFO L130 PetriNetUnfolder]: 147775/192696 cut-off events. [2023-01-28 03:40:45,079 INFO L131 PetriNetUnfolder]: For 573942/574216 co-relation queries the response was YES. [2023-01-28 03:40:45,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 729278 conditions, 192696 events. 147775/192696 cut-off events. For 573942/574216 co-relation queries the response was YES. Maximal size of possible extension queue 4019. Compared 1139686 event pairs, 21171 based on Foata normal form. 268/185334 useless extension candidates. Maximal degree in co-relation 729226. Up to 93682 conditions per place. [2023-01-28 03:40:46,541 INFO L137 encePairwiseOnDemand]: 423/458 looper letters, 1039 selfloop transitions, 368 changer transitions 31/1448 dead transitions. [2023-01-28 03:40:46,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 1448 transitions, 10718 flow [2023-01-28 03:40:46,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-01-28 03:40:46,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2023-01-28 03:40:46,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 9662 transitions. [2023-01-28 03:40:46,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37010648892974796 [2023-01-28 03:40:46,553 INFO L72 ComplementDD]: Start complementDD. Operand 57 states and 9662 transitions. [2023-01-28 03:40:46,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 9662 transitions. [2023-01-28 03:40:46,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 03:40:46,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 57 states and 9662 transitions. [2023-01-28 03:40:46,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 58 states, 57 states have (on average 169.50877192982455) internal successors, (9662), 57 states have internal predecessors, (9662), 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) [2023-01-28 03:40:46,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 58 states, 58 states have (on average 458.0) internal successors, (26564), 58 states have internal predecessors, (26564), 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) [2023-01-28 03:40:46,588 INFO L81 ComplementDD]: Finished complementDD. Result has 58 states, 58 states have (on average 458.0) internal successors, (26564), 58 states have internal predecessors, (26564), 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) [2023-01-28 03:40:46,589 INFO L175 Difference]: Start difference. First operand has 125 places, 217 transitions, 1483 flow. Second operand 57 states and 9662 transitions. [2023-01-28 03:40:46,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 1448 transitions, 10718 flow [2023-01-28 03:40:58,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 1448 transitions, 10625 flow, removed 43 selfloop flow, removed 2 redundant places. [2023-01-28 03:40:58,181 INFO L231 Difference]: Finished difference. Result has 224 places, 572 transitions, 5696 flow [2023-01-28 03:40:58,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=5696, PETRI_PLACES=224, PETRI_TRANSITIONS=572} [2023-01-28 03:40:58,182 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 149 predicate places. [2023-01-28 03:40:58,182 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 572 transitions, 5696 flow [2023-01-28 03:40:58,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 152.2127659574468) internal successors, (7154), 47 states have internal predecessors, (7154), 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) [2023-01-28 03:40:58,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 03:40:58,184 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 03:40:58,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-01-28 03:40:58,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 03:40:58,390 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-01-28 03:40:58,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 03:40:58,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1156224530, now seen corresponding path program 3 times [2023-01-28 03:40:58,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 03:40:58,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18769937] [2023-01-28 03:40:58,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 03:40:58,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 03:40:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 03:40:59,606 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 03:40:59,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 03:40:59,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18769937] [2023-01-28 03:40:59,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18769937] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 03:40:59,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449826247] [2023-01-28 03:40:59,607 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 03:40:59,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 03:40:59,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 03:40:59,608 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) [2023-01-28 03:40:59,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-28 03:40:59,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-01-28 03:40:59,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 03:40:59,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 92 conjunts are in the unsatisfiable core [2023-01-28 03:40:59,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 03:40:59,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 03:40:59,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 03:40:59,863 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-01-28 03:40:59,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-01-28 03:40:59,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-01-28 03:40:59,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-28 03:41:00,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-28 03:41:00,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 03:41:00,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-01-28 03:41:00,132 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-01-28 03:41:00,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-01-28 03:41:00,178 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-01-28 03:41:00,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-01-28 03:41:00,219 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 03:41:00,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 03:41:00,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-28 03:41:00,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 03:41:00,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 03:41:00,602 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 03:41:00,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 15 [2023-01-28 03:41:00,749 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 03:41:00,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 03:41:28,421 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 03:41:28,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 54 [2023-01-28 03:41:28,453 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 03:41:28,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1527798 treesize of output 1462270 [2023-01-28 03:41:28,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 704 treesize of output 656 [2023-01-28 03:41:28,807 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 03:41:28,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 656 treesize of output 620 [2023-01-28 03:41:28,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 612 treesize of output 516 [2023-01-28 03:41:28,845 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 03:41:28,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 516 treesize of output 436 [2023-01-28 03:41:28,870 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 03:41:28,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 224 treesize of output 211 [2023-01-28 03:41:29,837 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-01-28 03:41:29,890 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 03:41:29,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 56 [2023-01-28 03:41:29,932 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 03:41:29,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 207350 treesize of output 199166 [2023-01-28 03:41:30,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 768 treesize of output 720 [2023-01-28 03:41:30,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 720 treesize of output 624 [2023-01-28 03:41:30,198 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 03:41:30,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 624 treesize of output 544 [2023-01-28 03:41:30,223 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 03:41:30,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 257 treesize of output 244 [2023-01-28 03:41:30,248 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 03:41:30,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 278 treesize of output 243 [2023-01-28 03:41:31,678 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-01-28 03:41:32,044 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 03:41:32,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449826247] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 03:41:32,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 03:41:32,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 50 [2023-01-28 03:41:32,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382805469] [2023-01-28 03:41:32,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 03:41:32,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-01-28 03:41:32,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 03:41:32,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-01-28 03:41:32,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2426, Unknown=51, NotChecked=0, Total=2652 [2023-01-28 03:41:32,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 458 [2023-01-28 03:41:32,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 572 transitions, 5696 flow. Second operand has 52 states, 52 states have (on average 146.0) internal successors, (7592), 52 states have internal predecessors, (7592), 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) [2023-01-28 03:41:32,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 03:41:32,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 458 [2023-01-28 03:41:32,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 03:41:38,857 WARN L222 SmtUtils]: Spent 6.21s on a formula simplification that was a NOOP. DAG size: 122 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 03:41:40,888 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] [2023-01-28 03:42:09,278 WARN L222 SmtUtils]: Spent 25.43s on a formula simplification that was a NOOP. DAG size: 117 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 03:42:15,892 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] [2023-01-28 03:42:17,919 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] [2023-01-28 03:42:19,938 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] [2023-01-28 03:42:24,947 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] [2023-01-28 03:42:26,969 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] [2023-01-28 03:42:28,983 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] [2023-01-28 03:42:32,056 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] [2023-01-28 03:42:34,667 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] [2023-01-28 03:43:14,711 WARN L222 SmtUtils]: Spent 34.32s on a formula simplification that was a NOOP. DAG size: 115 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 03:43:16,902 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] [2023-01-28 03:43:18,990 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] [2023-01-28 03:43:21,450 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] [2023-01-28 03:43:23,782 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] [2023-01-28 03:43:25,901 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] [2023-01-28 03:43:28,150 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] [2023-01-28 03:43:59,535 WARN L222 SmtUtils]: Spent 22.47s on a formula simplification that was a NOOP. DAG size: 125 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 03:44:02,142 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] [2023-01-28 03:44:04,334 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] [2023-01-28 03:44:06,397 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] [2023-01-28 03:44:08,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 03:44:10,078 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] [2023-01-28 03:44:12,484 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] [2023-01-28 03:44:14,566 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] Received shutdown request... [2023-01-28 03:44:28,558 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 [2023-01-28 03:44:28,558 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 03:44:29,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-01-28 03:44:29,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-01-28 03:44:29,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 03:44:29,714 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:236) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:376) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:483) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfoldingHelper(PetriNetUnfolder.java:209) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfolding(PetriNetUnfolder.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:129) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:481) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-01-28 03:44:29,716 INFO L158 Benchmark]: Toolchain (without parser) took 855248.24ms. Allocated memory was 427.8MB in the beginning and 14.3GB in the end (delta: 13.8GB). Free memory was 386.8MB in the beginning and 9.1GB in the end (delta: -8.8GB). Peak memory consumption was 5.1GB. Max. memory is 16.0GB. [2023-01-28 03:44:29,717 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 255.9MB. Free memory is still 213.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 03:44:29,717 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.97ms. Allocated memory is still 427.8MB. Free memory was 386.4MB in the beginning and 373.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-01-28 03:44:29,717 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.25ms. Allocated memory is still 427.8MB. Free memory was 373.8MB in the beginning and 371.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 03:44:29,717 INFO L158 Benchmark]: Boogie Preprocessor took 25.14ms. Allocated memory is still 427.8MB. Free memory was 371.2MB in the beginning and 368.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 03:44:29,717 INFO L158 Benchmark]: RCFGBuilder took 856.65ms. Allocated memory is still 427.8MB. Free memory was 368.8MB in the beginning and 391.2MB in the end (delta: -22.4MB). Peak memory consumption was 50.9MB. Max. memory is 16.0GB. [2023-01-28 03:44:29,717 INFO L158 Benchmark]: TraceAbstraction took 854146.80ms. Allocated memory was 427.8MB in the beginning and 14.3GB in the end (delta: 13.8GB). Free memory was 390.3MB in the beginning and 9.1GB in the end (delta: -8.8GB). Peak memory consumption was 5.1GB. Max. memory is 16.0GB. [2023-01-28 03:44:29,718 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 255.9MB. Free memory is still 213.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 183.97ms. Allocated memory is still 427.8MB. Free memory was 386.4MB in the beginning and 373.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 31.25ms. Allocated memory is still 427.8MB. Free memory was 373.8MB in the beginning and 371.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 25.14ms. Allocated memory is still 427.8MB. Free memory was 371.2MB in the beginning and 368.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 856.65ms. Allocated memory is still 427.8MB. Free memory was 368.8MB in the beginning and 391.2MB in the end (delta: -22.4MB). Peak memory consumption was 50.9MB. Max. memory is 16.0GB. * TraceAbstraction took 854146.80ms. Allocated memory was 427.8MB in the beginning and 14.3GB in the end (delta: 13.8GB). Free memory was 390.3MB in the beginning and 9.1GB in the end (delta: -8.8GB). Peak memory consumption was 5.1GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9s, 227 PlacesBefore, 75 PlacesAfterwards, 226 TransitionsBefore, 65 TransitionsAfterwards, 7920 CoEnabledTransitionPairs, 8 FixpointIterations, 103 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 17 TrivialYvCompositions, 14 ConcurrentYvCompositions, 9 ChoiceCompositions, 192 TotalNumberOfCompositions, 33320 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 19758, independent: 19225, independent conditional: 0, independent unconditional: 19225, dependent: 533, dependent conditional: 0, dependent unconditional: 533, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4264, independent: 4201, independent conditional: 0, independent unconditional: 4201, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 19758, independent: 15024, independent conditional: 0, independent unconditional: 15024, dependent: 470, dependent conditional: 0, dependent unconditional: 470, unknown: 4264, unknown conditional: 0, unknown unconditional: 4264] , Statistics on independence cache: Total cache size (in pairs): 712, Positive cache size: 674, Positive conditional cache size: 0, Positive unconditional cache size: 674, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown